PAT (Advanced Level) Practise 1129 Recommendation System (25)
来源:互联网 发布:linux安装qq输入法 编辑:程序博客网 时间:2024/05/17 22:53
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
题意:根据用户每次点击的东西的编号,输出k个他在点当前编号之前应该给这个用户推荐的商品的编号,也就是输出用户曾经点击过的商品编号的最多的前k个,如果恰好两个商品有相同的点击次数,就输出编号较小的那个
解题思路:用set来统计
#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <algorithm>#include <cmath>#include <map>#include <set>#include <stack>#include <queue>#include <vector>#include <bitset>#include <functional>using namespace std;#define LL long longconst int INF = 0x3f3f3f3f;int n, k,a,visit[50005];struct node{int id;int sum;friend bool operator <(node a, node b){if (a.sum != b.sum) return a.sum > b.sum;else return a.id < b.id;}}pre;int main(){while (~scanf("%d%d%d", &n, &k, &a)){memset(visit, 0, sizeof visit);pre.id = a, pre.sum = 1;visit[a]++;set<node>s;s.insert(pre);for (int i = 1; i < n; i++){scanf("%d", &a);printf("%d:", a);set<node>::iterator it = s.begin();for(int j=1;j<=k;j++){if (it == s.end()) break;printf(" %d", it->id);it++;}printf("\n");pre.id = a;pre.sum = visit[a];if (visit[a]++) s.erase(pre);pre.id = a; pre.sum = visit[a];s.insert(pre);}}return 0;}
- PAT (Advanced Level) Practise 1129 Recommendation System (25)
- PAT (Advanced Level) Practise 1129 Recommendation System (25)
- 【PAT】【Advanced Level】1129. Recommendation System (25)
- [PAT] (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- 1029. Median (25) @ PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise 1032. Sharing (25)
- PAT (Advanced Level) Practise 1003. Emergency (25)
- PAT (Advanced Level) Practise 1010. Radix (25)
- PAT (Advanced Level) Practise 1003Emergency (25)
- 树中两个节点的最近公共祖先 多种情况分析
- 第11届东北地区大学生程序设计竞赛
- Java概念性问题11
- java-------华为机试-------汽水瓶(水题)
- jQuery遍历
- PAT (Advanced Level) Practise 1129 Recommendation System (25)
- 从0到1Android自定义View(三)画图的五个元素组件
- 第11届东北地区大学城程序设计竞赛
- tf.argmax的使用
- Java基础笔记之理解面向对象
- an
- 读书笔记《Effective C++》条款22:将成员变量声明为private
- CodeForces 805CFind Amir
- 单例模式进一步讲解