1129 Recommendation System (25分)
作者:CHEN, Yue
单位:浙江大学
代码长度限制:16 KB
时间限制:400 ms
内存限制:64 MB
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 (≤ 50,000), 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
题意:
推荐目前为止出现次数最多的k个数字,若数字的出现次数相同,数值小的先推荐。
思路:
若采用插入排序,由于对出现次数相同的情况还要取数值小的优先,测试案例3会超时,改用set内部的排序,保证了数值小的优先,也保证了唯一性。每次find这个数有没有出现过,若出现过则删除并更新,若没有则直接更新。
参考代码:
#include <iostream>
#include <set>
using namespace std;
struct node {
int val, num;
node(int a, int b) : val(a), num(b) {}
bool operator<(node a){
return num == a.num ? val < a.val : num > a.num;
}
};
int hashtable[50001] = {0};
int main() {
int n, k, a;
set<node> com;
scanf("%d%d", &n, &k);
for (int i = 0; i < n; i++) {
scanf("%d", &a);
if (i != 0)printf("%d:", a);
int cnt = 0;
for (auto it = com.begin(); it != com.end() && cnt < k; it++, cnt++)
printf(" %d", it->val);
if (i != 0)printf("\n");
auto it = com.find(node(a, hashtable[a]));
if (it != com.end())com.erase(it);
hashtable[a]++;
com.insert(node(a, hashtable[a]));
}
return 0;
}
如有错误,欢迎指正