zoukankan      html  css  js  c++  java
  • 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 (≤ 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
    #include<iostream>
    #include<set>
    using namespace std;
    struct node{
        int value,cnt;
        bool operator< (const node &a) const{
              return (cnt != a.cnt) ? cnt > a.cnt : value < a.value;
        }
    };
    int book[50001];
    
    int main(){
        int n,m,num;
        scanf("%d%d",&n,&m);
        set<node> s;
        for(int i = 0; i < n; i++){
            scanf("%d",&num);
            if(i != 0){
                printf("%d:",num);
                int tempCnt = 0;
                for(auto it = s.begin(); tempCnt < m && it != s.end();it++){
                    printf(" %d",it->value);
                    tempCnt++;
                }
                printf("
    ");
            }
            auto it = s.find(node{num,book[num]});
            if(it != s.end()) s.erase(it);
            book[num]++;
            s.insert(node{num,book[num]});
        }
        return 0;
    }
  • 相关阅读:
    洛谷 P1057 传球游戏
    BZOJ 1801: [Ahoi2009]chess 中国象棋
    BZOJ 1806: [Ioi2007]Miners 矿工配餐
    51nod 1276 岛屿的数量
    BZOJ 1800: [Ahoi2009]fly 飞行棋
    路由控制和视图层
    django的零碎注意点
    Django框架简介
    Bootstrap框架
    jQuery基础知识
  • 原文地址:https://www.cnblogs.com/wanghao-boke/p/10458553.html
Copyright © 2011-2022 走看看