HDOJ 5437 Alisha’s Party (优先队列)(长春网络赛)
来源:互联网 发布:算法结构 编辑:程序博客网 时间:2024/06/07 11:21
Alisha’s Party
Time Limit: 3000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1104 Accepted Submission(s): 306
Problem Description
Princess Alisha invites her friends to come to her birthday party. Each of her friends will bring a gift of some valuev , and all of them will come at a different time. Because the lobby is not large enough, Alisha can only let a few people in at a time. She decides to let the person whose gift has the highest value enter first.
Each time when Alisha opens the door, she can decide to letp people enter her castle. If there are less than p people in the lobby, then all of them would enter. And after all of her friends has arrived, Alisha will open the door again and this time every friend who has not entered yet would enter.
If there are two friends who bring gifts of the same value, then the one who comes first should enter first. Given a queryn Please tell Alisha who the n−th person to enter her castle is.
Each time when Alisha opens the door, she can decide to let
If there are two friends who bring gifts of the same value, then the one who comes first should enter first. Given a query
Input
The first line of the input gives the number of test cases,T , where 1≤T≤15 .
In each test case, the first line contains three numbersk,m and q separated by blanks. k is the number of her friends invited where 1≤k≤150,000 . The door would open m times before all Alisha’s friends arrive where 0≤m≤k . Alisha will have q queries where 1≤q≤100 .
Thei−th of the following k lines gives a string Bi , which consists of no more than 200 English characters, and an integer vi ,1≤vi≤108 , separated by a blank. Bi is the name of the i−th person coming to Alisha’s party and Bi brings a gift of value vi .
Each of the followingm lines contains two integers t(1≤t≤k) and p(0≤p≤k) separated by a blank. The door will open right after the t−th person arrives, and Alisha will let p friends enter her castle.
The last line of each test case will containq numbers n1,...,nq separated by a space, which means Alisha wants to know who are the n1−th,...,nq−th friends to enter her castle.
Note: there will be at most two test cases containingn>10000 .
In each test case, the first line contains three numbers
The
Each of the following
The last line of each test case will contain
Note: there will be at most two test cases containing
Output
For each test case, output the corresponding name of Alisha’s query, separated by a space.
Sample Input
15 2 3Sorey 3Rose 3Maltran 3Lailah 5Mikleo 61 14 21 2 3
Sample Output
Sorey Lailah Rose大意:一群人去参加party,拿的有不同的礼物,规定例如在第i个人到来时让过去j个人,(礼物贵重的先进,如果相同,就谁先来谁先进),问第k个进去的是谁,注意最后都要进去,解法:优先队列,不过中间繁琐,刚开始做想到了最后一点但是没写(⊙﹏⊙)ac代码:#include<stdio.h>#include<string.h>#include<queue>#include<iostream>#include<algorithm>#define MAXN 150000using namespace std;struct s{int a;int b;}come[MAXN];struct ss{int cas;int value;friend bool operator<(ss a,ss b){if(a.value==b.value)return a.cas>b.cas;return a.value<b.value;}}d,e;int val[MAXN+10];char man[MAXN+10][210];int num[MAXN+10];int qq[MAXN+10];bool cmp(s aa,s bb){return aa.a<bb.a;}int main(){int t;int i,j,k,m,pro,qqq;scanf("%d",&t);while(t--){scanf("%d%d%d",&k,&m,&qqq);priority_queue<ss>q;for(i=1;i<=k;i++){scanf("%s%d",man[i],&val[i]);qq[i]=i;}for(i=1;i<=m;i++)scanf("%d%d",&come[i].a,&come[i].b);sort(come+1,come+m+1,cmp);//对要求排序,刚开始以为题目不会要求这个,但是后来一想,还是写吧int j=1;int ans=1;for(i=1;i<=m;i++){while(j<=come[i].a&&j<=k){d.cas=qq[j];d.value=val[j];q.push(d);j++;}int w=0;while(w<come[i].b&&!q.empty()){e=q.top();num[ans++]=e.cas;q.pop();w++;}}for(i=j;i<=k;i++){d.cas=qq[i];d.value=val[i];q.push(d);}while(!q.empty()){ e=q.top();num[ans++]=e.cas;q.pop();}for(i=0;i<qqq;i++){scanf("%d",&pro);printf(i==qqq-1?"%s\n":"%s ",man[num[pro]]);}}return 0;}
0 0
- HDOJ 5437 Alisha’s Party (优先队列)(长春网络赛)
- HDU 5437 Alisha’s Party(优先队列)(2015网络赛长春站)
- hdu 5437 Alisha’s Party(长春网络赛——优先队列)
- HDU 5437 Alisha’s Party(2015ACM长春赛区网络赛+优先队列)
- HDU5437(2015长春网赛)——Alisha’s Party(优先队列)
- [hdu5437] Alisha’s Party(优先队列)
- hdu 5437 Alisha’s Party(优先队列)
- hdu 5437Alisha’s Party(优先队列)
- HDU 5437 Alisha’s Party(优先队列+模拟)
- Alisha’s Party 5437 (字符串+优先队列)好题
- hdu 5437Alisha’s Party(优先队列)
- HDU 5437 Alisha’s Party (优先队列模拟)
- HDU 5437 Alisha's Party(优先队列)
- HDU 5437 Alisha’s Party(优先队列模拟)
- hdu 5437 Alisha’s Party(优先队列)
- hdoj 5437 Alisha’s Party 【优先队列 模拟】
- hdu 5437 Alisha’s Party 2015长春网络赛 模拟
- HDU 5437 Alisha’s Party 优先队列
- 编码规范-注释
- Android SDK : Local Datas Storage
- C#中的Decimal的四舍五入
- Cucumber 经验总结
- 八皇后问题,自己写的c语言
- HDOJ 5437 Alisha’s Party (优先队列)(长春网络赛)
- 枚举与字符串的转换
- 编辑器vi使用方法详细介绍
- 开发中用到的视频存储
- Ring3/Ring0的四种通信方式
- 常用的机器学习&数据挖掘知识(点)总结
- 浅谈Java中的hashcode方法
- python垃圾回收机制
- 猫猫学iOS之最近的反思