PAT甲级 1129. Recommendation System (25)
来源:互联网 发布:软件作业互助组 编辑:程序博客网 时间:2024/06/05 18:02
1129. Recommendation System (25)
Recommendation system predicts the preference that a user would give to an item. Now you are asked to program a very simple recommendation system that rates the user's preference by the number of times that an item has been accessed by this user.
Input Specification:
Each input file contains one test case. For each test case, the first line contains two positive integers: N (<= 50000), the total number of queries, and K (<= 10), the maximum number of recommendations the system must show to the user. Then given in the second line are the indices of items that the user is accessing -- for the sake of simplicity, all the items are indexed from 1 to N. All the numbers in a line are separated by a space.
Output Specification:
For each case, process the queries one by one. Output the recommendations for each query in a line in the format:
query: rec[1] rec[2] ... rec[K]
where query is the item that the user is accessing, and rec[i] (i = 1, ... K) is the i-th item that the system recommends to the user. The first K items that have been accessed most frequently are supposed to be recommended in non-increasing order of their frequencies. If there is a tie, the items will be ordered by their indices in increasing order.
Note: there is no output for the first item since it is impossible to give any recommendation at the time. It is guaranteed to have the output for at least one query.
Sample Input:12 33 5 7 5 5 3 2 1 8 3 8 12Sample Output:
5: 37: 3 55: 3 5 75: 5 3 73: 5 3 72: 5 3 71: 5 3 28: 5 3 13: 5 3 18: 3 5 112: 3 5 8
#include<iostream>#include<cstdio>#include<cmath>#include<cstring>#include<algorithm>#include<string>#include<queue>#include<stack>#include<map>#include<set>using namespace std;#define LL long longconst int inf=0x3f3f3f3f;struct node{ int x,t; bool friend operator<(node a,node b) { if(a.t!=b.t) return a.t>b.t; return a.x<b.x; }};int main(){ int n,k,x; int vis[100005]; node f,ans[100]; memset(vis,0,sizeof vis); set<node>s; scanf("%d%d",&n,&k); scanf("%d",&x); f.x=x; f.t=1; s.insert(f); vis[x]=1; for(int i=1; i<n; i++) { scanf("%d",&x); printf("%d:",x); int cnt=0; set<node>::iterator it=s.begin(); for(; cnt<k&&it!=s.end(); it++,cnt++) { printf(" %d",(*it).x); } printf("\n"); f.x=x; f.t=vis[x]; it=s.find(f); if(it!=s.end()) s.erase(it); vis[x]++; f.x=x; f.t=vis[x]; s.insert(f); } return 0;}
- PAT甲级 1129. Recommendation System (25)
- PAT 甲级 1129. Recommendation System (25)
- PAT 1129. Recommendation System (25)
- PAT--1129. Recommendation System
- PAT 1129. Recommendation System (25) 数数
- 【PAT】【Advanced Level】1129. Recommendation System (25)
- PAT(A)-1129. Recommendation System (25)(优先队列)
- pat 1129. Recommendation System (25)(set的增删)
- 1129. Recommendation System (25)
- 1129. Recommendation System (25)
- 1129. Recommendation System (25)
- 1129. Recommendation System (25)
- 1129. Recommendation System (25)
- 1129. Recommendation System (25)
- 1129. Recommendation System (25)
- PAT 1129Recommendation System
- 1129. Recommendation System (25) set
- PAT 1129. Recommendation System (25) 优先队列--维持前k个最大堆
- php面试题目分享(1)
- 复制转发CSDN博客快捷方法
- 【剑指Offer】面试题28:字符串的排序
- Spring-IOC原理及装配Bean(XML方式)
- python中的six.moves模块的下载函数urlretrieve
- PAT甲级 1129. Recommendation System (25)
- oracle drop、truncate 分区表分区注意
- 1.4 Getting Started
- android纯代码方式适配屏幕
- 程序员面试金典:字符串--确定字符串互异、原串翻转、空格替换
- XShell + Xmanager Forward X11 through tunnelling
- Target Sum
- Leetcode 89 Gray Code
- 查找