HDU5437 Alisha’s Party(优先队列+模拟)
来源:互联网 发布:海量数据免费下载 编辑:程序博客网 时间:2024/05/17 15:21
Alisha’s Party
Time Limit: 3000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 4075 Accepted Submission(s): 1052
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
Source
2015 ACM/ICPC Asia Regional Changchun Online
题意:有k个人带着价值vi的礼物来,开m次门,每次在有t个人来的时候开门放进来p个人,所有人都来了之后再开一次门把剩下的人都放进来,每次带礼物价值高的人先进,价值相同先来先进,q次询问,询问第n个进来的人的名字。
分析:优先队列+模拟就可以了,只是注意m可以为0。
<span style="font-size:18px;">#include <iostream>#include <cstdio>#include <cstring>#include <stack>#include <queue>#include <map>#include <set>#include <vector>#include <cmath>#include <algorithm>using namespace std;const double eps = 1e-6;const double pi = acos(-1.0);const int INF = 0x3f3f3f3f;const int MOD = 1000000007;#define ll long long#define CL(a,b) memset(a,b,sizeof(a))#define lson (i<<1)#define rson ((i<<1)|1)#define MAXN 150010struct node{ int id,v; char name[220]; bool operator < (const node &tmp) const { if(v == tmp.v) return id < tmp.id; return v > tmp.v; }}p[MAXN];struct opendoor{ int a,b; bool operator < (const opendoor &tmp) const { return a < tmp.a; }}od[MAXN];set<node> s;int query[110];int main(){ int T,n,m,q; scanf("%d",&T); while(T--) { s.clear(); scanf("%d%d%d",&n,&m,&q); for(int i=1; i<=n; i++) { scanf("%s %d",p[i].name, &p[i].v); p[i].id = i; } for(int i=0; i<m; i++) scanf("%d%d",&od[i].a, &od[i].b); sort(od, od+m); int maxq; for(int i=0; i<q; i++) { scanf("%d",&query[i]); maxq = max(maxq, query[i]); } vector <int> ans; int cnt = 0; for(int i=1; i<=n&&ans.size()<maxq; i++) { s.insert(p[i]); while(od[cnt].a==i && cnt<m) { for(int j=0; j<od[cnt].b&&!s.empty()&&ans.size()<maxq; j++) { ans.push_back(s.begin()->id); s.erase(s.begin()); } cnt++; } } while(!s.empty() && ans.size()<maxq) { ans.push_back(s.begin()->id); s.erase(s.begin()); } for(int i=0; i<q; i++) { if(i) printf(" "); cout<<p[ans[query[i]-1]].name; } puts(""); } return 0;}</span>
0 0
- hdu5437 Alisha’s Party(优先队列、模拟)
- HDU5437 - Alisha’s Party (优先队列 模拟)
- HDU5437 Alisha’s Party(优先队列+模拟)
- [hdu5437] Alisha’s Party(优先队列)
- hdu5437 Alisha’s Party 优先队列
- HDU5437 Alisha’s Party 优先队列
- 优先对列模拟 hdu5437 Alisha’s Party
- HDU5437(2015长春网赛)——Alisha’s Party(优先队列)
- hdu5437 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(优先队列)
- hdu 5437Alisha’s Party(优先队列)
- Alisha’s Party 5437 (字符串+优先队列)好题
- hdu 5437Alisha’s Party(优先队列)
- HDU 5437 Alisha's Party(优先队列)
- 学习笔记第一章UML
- 侧滑返回通知被移除
- cocos模拟器已经启动 但是不能访问6010端口
- 快速排序算法的时间复杂度为什么是O(NlogN),还有O(N^2)
- 外部系统调用EAS 凭证webserivce标准接口问题总结以及流程
- HDU5437 Alisha’s Party(优先队列+模拟)
- 使用swift开发Cordova插件
- Yast: SSL certificate problem, verify that the CA cert is OK
- 内核栈是干什么用的?TSS作用,进程上下文
- listview嵌套listview子listview显示不全的问题
- spring中IOC和DI
- 初识Jstorm 多个bolt应用
- linux服务器配置
- Getting Spring Application context from a non bean object