HDU __5437 Alisha’s Party

Alisha’s Party

Time Limit: 3000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)

Total Submission(s): 2513 Accepted Submission(s): 681



[align=left]Problem Description[/align]
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.

[align=left]Input[/align]
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 B

i



,
which consists of no more than 200


English characters, and an integer v

i



,
1≤v

i

≤10

8



,
separated by a blank. B

i




is the name of the i−th


person coming to Alisha’s party and Bi brings a gift of value
v

i



.

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 n

1

,...,n

q




separated by a space, which means Alisha wants to know who are the
n

1

−th,...,n

q

−th


friends to enter her castle.

Note: there will be at most two test cases containing
n>10000

.

[align=left]Output[/align]
For each test case, output the corresponding name of Alisha’s query, separated by a space.

[align=left]Sample Input[/align]

1
5 2 3
Sorey 3
Rose 3
Maltran  3
Lailah 5
Mikleo  6
1 1
4 2
1 2 3

[align=left]Sample Output[/align]

Sorey Lailah Rose

[align=left]Source[/align]
2015 ACM/ICPC Asia Regional Changchun Online

当时网络赛没弄出来，弄到最后拿了个TLE。。。
优先队列，或者集合模拟过程也行。。代码是看别人的日志敲得。。区别是加了自己的理解注释。。。这个题让我顺带让我了一下优先队列

#include<iostream>
#include<cstdio>
#include<queue>
#include<algorithm>
using namespace std;
#define LL long long
#define N 150005

struct Node {
int v,x;//v是价值，x是排队的序号
char name[250];
bool operator < (const Node &_t)const{
if(_t.v == v) return x >_t.x;   //序号大的优先级小，所有队列顶端为序号小的，
return v < _t.v;
}       //赋予每个元素优先级
}fir
;        //存储每个人信息的数组

struct query{
int t,p;                //t表示第几个人来时开门，进p个人
bool operator < (const query &_t)const {
return t < _t.t;
}

}que
;        //存储出队的操作信息

priority_queue <Node> q;
int ans
;

int main(){
int T;
int k,m,Q;
int a;
scanf("%d",&T);
while(T--){
scanf("%d%d%d",&k,&m,&Q);
for(int i= 1;i <= k;++i){
scanf("%s%d",fir[i].name,&fir[i].v);
fir[i].x = i;
}
for(int i = 1;i <= m;++i){
scanf("%d%d",&que[i].t,&que[i].p);
}
sort(que + 1,que + m + 1);      //que[0]没有存储信息，注意que可能不是有序的，所以要排序
int now = 1;                    //now标记que数组的指针表示第now次开门
int cnt = 0;
while(!q.empty()) q.pop();      //清空队列
for(int i = 1;i <=k;i++){
q.push(fir[i]);
while(i == que[now].t && now <= m){     //每有一个人入队就要判断一下是否达到开门条件
for(int j = 1;j <= que[now].p && (!q.empty());j++){
ans[++cnt] = q.top().x;
q.pop();
}
now++;
}
}
while(!q.empty()){      //当门的次数开完之后，剩下的所有的人全部放进来
ans[++cnt] = q.top().x;
q.pop();
}
for(int i = 1;i <= Q;i++){
scanf("%d",&a);
if(i != 1) printf(" ");
printf("%s",fir[ans[a]].name);
}
printf("\n");
}
return 0;
}