http://acm.hdu.edu.cn/showproblem.php?pid=4020
Ads ProposalTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 607 Accepted Submission(s): 234
Problem Description
There are N customers set their M different advertisements on Baidu. Each advertisement is owned by single customer. The ads system of Baidu records the number of clicks of each advertisement this year. The proposal system wants to analysis the advertisements about the relativity of the description length and the number of clicks of the advertisements. During the analysis, it is very important to do such a query to ask the total length of the advertisements with top k clicking times for each customer. You may assume the number of clicks of all advertisements are distinct.
Your task is to help Baidu to design this little toolkit.
Input
The input consist multiple test cases. The number of test cases is given in the first line of the input.
For each test case, the first line contains three integers N, M and Q, denoting the number customer, the number of advertisement instances and the number of queries. (N <= 100000, M <= 500000, Q <= 100000) Then M lines follow, each line contains three numbers, U, C and L, indicating the owner of this advertisement, the clicks for this advertisement and the length. (1 <= U <= N, 0 <= C, L <= 1000000000) Finally Q lines come. Each line contains only one integer k, representing the query for top k clicking advertisements for each customer.
Output
For each test case, output Q lines, each line contains only one integer, denoting the sum of total length of the top k number of clicks for each customer.
Sample Input
Sample Output
Source
|
题意:有N个客户投资了M个广告,现给出M个广告的信息(所属客户 , 点击量 , 广告长度)
现给Q次查询,每次查询内容为每个客户TOP K 点击量的广告长度之和,即求每个客户前K个点击量最高的广告的总长度
题解: 第一次排序,按客户排序,相同客户所属的广告按点击量高到低排序.
第二次排序其实就是:把所属客户相同的广告做分类标记好每个广告在所属客户中的层次后,把所有广告信息按TOP i 排序.
最后O(N) 线性把答案给打表了.
如果还不明白可以把代码中的注释打印出来看下
#include <iostream> #include <algorithm> using namespace std; const int N =500010; #define min(a,b) a<b?a:b struct node { __int64 c,l,u,no; bool operator<(const node t)const { if(u==t.u) return t.c<c; return u<t.u; } }num[500010]; int cmp(const void *p,const void *q) //按 { return (*(node*)p).no-(*(node*)q).no; } __int64 ans[N]; int main() { int t,n,m,q,i,k,cnt=1; scanf("%d",&t); while (t--) { scanf("%d%d%d",&n,&m,&q); for(i=0;i<m;i++) scanf("%d%d%d",&num[i].u,&num[i].c,&num[i].l); sort(num,num+m); // printf("\nafter once sort:\n"); // for(i=0;i<m;i++) // printf("%I64d %I64d %I64d\n",num[i].u,num[i].c,num[i].l); num[0].no=0; int Maxlen=-1; for(i=1;i<m;i++) { if(num[i].u == num[i-1].u) num[i].no=num[i-1].no+1; else num[i].no=0; if(Maxlen<num[i].no) Maxlen=num[i].no; } qsort(num,m,sizeof(num[0]),cmp); // printf("\nafter twice sort:\n"); // for(i=0;i<m;i++) // printf("%I64d %I64d %I64d\n",num[i].u,num[i].c,num[i].l); //计算出结果 int hh=1; ans[1]=num[0].l; for(i=1;i<m;i++) { if(num[i].no!=num[i-1].no) { ans[hh]+=ans[hh-1]; hh++; ans[hh]=num[i].l; } else ans[hh]+=num[i].l; } ans[hh]+=ans[hh-1]; printf("Case #%d:\n",cnt++); while (q--) { scanf("%d",&k); k=min(hh,k); printf("%I64d\n",ans[k]); } } return 0; }