1129. Recommendation System (25) set
来源:互联网 发布:js color 编辑:程序博客网 时间:2024/06/06 01: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
自定义set排序
#include<iostream> #include<cstdio> #include<cstring> #include<cmath> #include<algorithm> #include<queue> #include<map> #include<set>using namespace std;typedef struct node{int num,len;friend bool operator < (node n1,node n2){if(n1.len==n2.len) return n1.num<n2.num;return n1.len>n2.len;}}node; int main(){int n,k;int a[50000+10];scanf("%d%d",&n,&k);for(int i=1;i<=n;i++){scanf("%d",&a[i]);}set<node> s;s.insert({a[1],1});int v[50000+10]={0};v[a[1]]=1;for(int i=2;i<=n;i++){printf("%d:",a[i]);int kk=0;set<node>::iterator it;for(it=s.begin();it!=s.end()&&kk<k;it++,kk++){printf(" %d",it->num);}printf("\n");if(s.find({a[i],v[a[i]]})!=s.end()){s.erase({a[i],v[a[i]]});}v[a[i]]++;s.insert({a[i],v[a[i]]});} return 0; }
- 1129. Recommendation System (25) set
- 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 1129. Recommendation System (25)(set的增删)
- PAT 1129. Recommendation System (25)
- 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)(优先队列)
- 论文:Faster R-CNN
- 深入理解Java PriorityQueue
- Unity Shader 编程之一
- 每秒处理10万订单乐视集团支付架构
- chisel测试指令
- 1129. Recommendation System (25) set
- 作业 | 机票预订系统和银行计算机储蓄系统的数据流图及实体图
- 正则之sed
- angular JS + PrimeNG 初学使用
- maven 配置参数大全
- 每天一道算法题——用两个栈实现队列和用两个队列实现栈
- Js基本语法、变量、数据类型
- C++高级编程 第九章: 精通类和对象
- Java垃圾收集机制