1129. Recommendation System (25)
来源:互联网 发布:达芬奇 知乎 编辑:程序博客网 时间:2024/05/16 15:42
- 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 3
3 5 7 5 5 3 2 1 8 3 8 12
Sample Output:
5: 3
7: 3 5
5: 3 5 7
5: 5 3 7
3: 5 3 7
2: 5 3 7
1: 5 3 2
8: 5 3 1
3: 5 3 1
8: 3 5 1
12: 3 5 8
方法是我同学的,对于其中的高级数据结构还不够熟练,以后多看看语法。
#include<iostream>#include<set>using namespace std;int m[50005];struct node{ int w,cnt; friend bool operator <(struct node a,struct node b)//a与b是友元,重载运算符 { if (a.cnt!=b.cnt) return a.cnt>b.cnt; return a.w<b.w; }};int main(){ int n,k,temp; cin>>n>>k; set<struct node > s; set<struct node >::iterator it; for (int i=0;i<n;i++) { int v; cin>>v; if (i!=0) { cout<<v<<":"; for (it=s.begin(),temp=0;it!=s.end()&&temp<k;it++,temp++) cout<<" "<<it->w; cout<<endl; } it=s.find({v,m[v]}); if(it!=s.end()) s.erase(it);//如果曾经出现过这个值,就先将这个值删除,之后再加入新的值 s.insert({v,++m[v]}); } return 0;}
- 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 1129. Recommendation System (25)
- 1129. Recommendation System (25) set
- 1129. Recommendation System (25)[set集合-排序]
- PAT甲级 1129. Recommendation System (25)
- PAT 1129. Recommendation System (25) 数数
- 【PAT】【Advanced Level】1129. Recommendation System (25)
- PAT 甲级 1129. Recommendation System (25)
- 1129. Recommendation System 解析
- PAT--1129. Recommendation System
- PAT(A)-1129. Recommendation System (25)(优先队列)
- pat 1129. Recommendation System (25)(set的增删)
- 训练日记-39
- 数据库隔离级别
- 11月16日
- 学学Gradle之一
- C#基础(19)——path、File类的基本操作
- 1129. Recommendation System (25)
- javascript 函数
- 计蒜客 非递归二叉树的前序遍历(树结构)
- Java 文件路劲获取(流的方式),适用与jar包或war包运行方式
- Python死锁和可重入死锁
- 角点检测--harris
- 常用算法程序集(c/c++)笔记(一)
- springboot第一个应用hello
- 【小白的CFD之旅】15 四种境界