PAT_A1129#Recommendation System

Source:

PAT A1129 Recommendation System (25 分)

Description:

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

Keys:

• 快乐模拟

Attention:

• 在线处理
• cmp引用传参
• 其实运算符重载也是可以的

Code:

 /*
 Data: 2019-08-11 21:13:07
 Problem: PAT_A1129#Recommendation System
 AC: 43:20
 
 题目大意：
 推荐系统会预测用户对于商品的喜好程度，现在通过用户获取商品的次数来评估用户的喜好程度
 输入：
 第一行给出，查询次数N<=5e4，系统给出推荐最大数量K<=10
 第二行给出，用户依次查询的商品编号（1~N）
 输出：
 当前搜索编号：推荐商品编号 <=k
 */
 #include<cstdio>
 #include<vector>
 #include<algorithm>
 using namespace std;
 const int M=1e6;
 int h[M]={},t[M]={};
 
 bool cmp(const int &a, const int &b)
 {
     if(t[a] != t[b])
         return t[a] > t[b];
     else
         return a < b;
 }
 
 int main()
 {
 #ifdef ONLINE_JUDGE
 #else
     freopen("Test.txt", "r", stdin);
 #endif // ONLINE_JUDGE
 
     int n,k,x;
     vector<int> recmd;
     scanf("%d%d", &n, &k);
     for(int i=; i<n; i++)
     {
         scanf("%d", &x);
         if(i!=)
         {
             printf("%d: ", x);
             for(int i=; i<recmd.size(); i++)
                 printf("%d%c", recmd[i], i==recmd.size()-?'\n':' ');
         }
         t[x]++;
         if(recmd.size()<k && h[x]==)
         {
             recmd.push_back(x);
             h[x]=;
         }
         else if(recmd.size()==k && h[x]==)
         {
             if(t[x]>t[recmd[k-]] || (t[x]==t[recmd[k-]] && x<recmd[k-]) )
             {
                 h[recmd[k-]]=;
                 h[x]=;
                 recmd[k-]=x;
             }
         }
         sort(recmd.begin(),recmd.end(),cmp);
     }
 
     return ;
 }