Alisha’s Party
Time Limit: 3000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 2301 Accepted Submission(s): 628
Problem Description
Princess Alisha invites her friends to come to her birthday party. Each of her friends will bring a gift of some value
v
, 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 let p 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 query n 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 p 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 query n Please tell Alisha who the n−th person to enter her castle is.
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 numbers k,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 .
The i−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 following m 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 contain q 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 containing n>10000 .
In each test case, the first line contains three numbers k,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 .
The i−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 following m 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 contain q 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 containing n>10000 .
Output
For each test case, output the corresponding name of Alisha’s query, separated by a space.
Sample Input
1 5 2 3 Sorey 3 Rose 3 Maltran 3 Lailah 5 Mikleo 6 1 1 4 2 1 2 3
Sample Output
Sorey Lailah Rose
Source
优先队列模拟,题目很简单,但是题目没看懂一直WA!WA!
对每次选着(t, p)要按照t的大小排序。
#include
#include
#include
#include
#include
using namespace std; const int N = 150011; char str[N][222]; //姓名 int b[N]; //b[i]表示选着的第i个的编号 struct node { int num;//编号 int val;//价值 bool operator<(const node &tmp) const { if(val != tmp.val) return val < tmp.val; return num > tmp.num; } }a[N]; priority_queue
que; struct tt{ int x; int y; }X[N]; bool cm(tt a, tt b) { return a.x < b.x; } int main(void) { int T; scanf("%d", &T); while(T--) { int k, m, q; int i, j; scanf("%d%d%d", &k, &m, &q); for(i = 1; i <= k; i++) { a[i].num = i; scanf("%s %d", str[i], &a[i].val); } int top = 1;//记录选着的人的个数 X[0].x = 0; for(i = 1; i <= m; i++) scanf("%d%d", &X[i].x, &X[i].y); sort(X+1, X+m+1, cm); while(!que.empty()) que.pop(); for(j = 1; j <= m; j++) { for(i = X[j-1].x+1; i <= X[j].x; i++)//X[j-1].x+1到X[j].x之间的人入队列 { if(a[i].val) { que.push(a[i]); a[i].val = 0;//入过队列的人使其价值为0 } } for(i = 1; i <= X[j].y && !que.empty(); i++)//选y个人 { node tmp = que.top(); que.pop(); b[top++] = tmp.num; } } //还没选着的人全部再选 for(i = 1; i <= k; i++) { if(a[i].val)//价值不为0的入队列 { que.push(a[i]); a[i].val=0; } } while(!que.empty()) { node tmp = que.top(); que.pop(); b[top++] = tmp.num; } int tmp; for(i = 0; i < q; i++) { scanf("%d", &tmp); if(i) printf(" "); printf("%s", str[b[tmp]]); } printf("\n"); } return 0; }