Alisha’s Party

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

Total Submission(s): 1079    Accepted Submission(s): 297

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.
 
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.
 
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 2http://write.blog.csdn.net/postedit
1 2 3
 
Sample Outputhttp://write.blog.csdn.net/postedit
Sorey Lailah Rose
 
Source
 
Recommend
hujie   |   We have carefully selected several similar problems for you:  5449 5448 5447 5446 5445 
 

优先队列+模拟,en,应该还行,时间上应该不会超时了,但是下面问题来了。。。

真的是无力吐槽了,感觉。。。

因为排序的问题,一直错,一直错,一直错,结果拖累的小组最后这个题都没A掉。。。

#include<iostream>
#include<stdio.h>
#include<math.h>
#include <string>
#include<string.h>
#include<map>
#include<queue>
#include<set>
#include<utility>
#include<vector>
#include<algorithm>
#include<stdlib.h>
using namespace std;
#define eps 1e-8
#define pii pair<int,int>
#define INF 0x3f3f3f3f
#define rd(x) scanf("%d",&x)
#define rd2(x,y) scanf("%d%d",&x,&y)
#define ll long long int
char outname[150005][205];
int coun=0; struct People
{
char name[205];
int value;
int pre;
friend bool operator < (People n1, People n2)
{
if(n1.value != n2.value) return n1.value < n2.value;
return n1.pre > n2.pre;
}
} people[150005]; int main ()
{
//cout<<"&&&"<<endl;
int Case;
rd(Case);
while(Case--)
{
int now=0;
coun=0;
int n,innum,quenum;
rd(n);
rd2(innum,quenum);
for(int i=0; i<n; i++)
{
scanf("%s",&people[i].name);
rd(people[i].value);
people[i].pre = i;
} priority_queue <People> que;
int temp1,temp2;
<span style="background-color: rgb(153, 255, 153);"> for(int i=0; i<innum; i++)
{
rd2(temp1,temp2);
for(int i=now; i<temp1; i++)
que.push(people[i]);//查push和push_back区别 now=temp1;
temp2 = (temp2>que.size() ? que.size() : temp2);
for(int i=0; i<temp2 ; i++)
{
strcpy(outname[coun++],que.top().name);
que.pop();
}
}</span>
int quearr[150005],tempmax=-1;
for(int i=0; i<quenum; i++)
{
rd(quearr[i]);
if(tempmax<quearr[i]) tempmax=quearr[i];
} if( tempmax > coun+1 )
{
for(int i=now; i<n ; i++)
que.push(people[i]);
}
while(!que.empty())
{
strcpy(outname[coun++],que.top().name);
que.pop();
}
for(int i=0; i<quenum; i++)
{
printf("%s",outname[ quearr[i]-1 ]);
if(i<quenum-1) printf(" ");
}
printf("\n");
}
return 0 ;
}

增加一个排序就好了,但是好像还是模拟的有点问题,因为还有一个排序啊,这样就很慢了,所以应该用数组记录下来,遍历模拟。。。

#include<iostream>
#include<stdio.h>
#include<math.h>
#include <string>
#include<string.h>
#include<map>
#include<queue>
#include<set>
#include<utility>
#include<vector>
#include<algorithm>
#include<stdlib.h>
using namespace std;
#define eps 1e-8
#define pii pair<int,int>
#define INF 0x3f3f3f3f
#define rd(x) scanf("%d",&x)
#define rd2(x,y) scanf("%d%d",&x,&y)
#define ll long long int
char outname[150005][205];
int coun=0;
struct T{
int a,b;
}a[150005];
bool cmp(T x,T y){
return x.a<y.a;
}
struct People
{
char name[205];
int value;
int pre;
friend bool operator < (People n1, People n2)
{
if(n1.value != n2.value) return n1.value < n2.value;
return n1.pre > n2.pre;
}
} people[150005]; int main ()
{
//cout<<"&&&"<<endl;
int Case;
rd(Case);
while(Case--)
{
int now=0;
coun=0;
int n,innum,quenum;
rd(n);
rd2(innum,quenum);
for(int i=0; i<n; i++)
{
scanf("%s",&people[i].name);
rd(people[i].value);
people[i].pre = i;
} priority_queue <People> que;
int temp1,temp2;
for(int i=0; i<innum ;i++) rd2(a[i].a,a[i].b);
sort(a,a+innum,cmp); for(int i=0; i<innum; i++)
{
temp1=a[i].a,temp2=a[i].b;
for(int i=now; i<temp1; i++)
que.push(people[i]);//查push和push_back区别 now=temp1;
//temp2 = (temp2>que.size() ? que.size() : temp2);
for(int i=0; i<temp2 ; i++)
{
if(que.empty()) break;
strcpy(outname[coun++],que.top().name);
que.pop();
}
}
int quearr[150005],tempmax=-1;
for(int i=0; i<quenum; i++)
{
rd(quearr[i]);
// if(tempmax<quearr[i]) tempmax=quearr[i];
} //if( tempmax > coun+1 )
// {
for(int i=now; i<n ; i++)
que.push(people[i]);
// }
while(!que.empty())
{
strcpy(outname[coun++],que.top().name);
que.pop();
}
for(int i=0; i<quenum; i++)
{
printf("%s",outname[ quearr[i]-1 ]);
if(i<quenum-1) printf(" ");
}
printf("\n");
}
return 0 ;
}

。。。good code。。。

#pragma comment(linker, "/STACK:102400000,102400000")
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
#include <queue>
#include <map>
#include <vector>
#include <algorithm>
#include <conio.h>
#include <iostream>
using namespace std;
#define rd(x) scanf("%d",&x)
#define rd2(x,y) scanf("%d%d",&x,&y)
#define ll long long int
#define maxn 100005
#define mod 1000000007
#define pii pair<int,int>
#define maxn 150005
int n,m,t,q,x,y;
struct node
{
int k,v;
friend bool operator <(node a,node b)
{
if(a.v==b.v) return a.k>b.k;
return a.v<b.v;
}
};
char s[maxn][205];
int v[maxn];
int ans[maxn];
int ti[maxn],tot,qq[200];
int main()
{
rd(t);
getchar();
while(t--)
{
rd2(n,m);
getchar();
rd(q);
getchar();
for(int i=1; i<=n; i++)
{
scanf("%s%d",s[i],&v[i]);
}
memset(ti,0,sizeof(ti));
for(int i=1; i<=m; i++)
{
scanf("%d%d",&x,&y);
ti[x]=y;
}
tot=0;
int mt=0;
for(int i=1; i<=q; i++)
{
rd(qq[i]);
mt=mt>qq[i]?mt:qq[i];
}
priority_queue<node> que;
node nn;
int k;
for(int i=1; i<=n; i++)
{
nn.k=i;
nn.v=v[i];
que.push(nn);
if(i==n)
{
while(!que.empty())
{
nn=que.top();
que.pop();
ans[++tot]=nn.k;
if(tot>=mt) break;
}
break;
}
for(int j=1; j<=ti[i]; j++)
{
if(que.empty()) break;
nn=que.top();
que.pop();
ans[++tot]=nn.k;
}
if(tot>=mt) break;
}
for(int i=1; i<=q; i++)
{
printf("%s",s[ans[qq[i]]]);
if(i==q) printf("\n");
else printf(" ");
}
}
return 0;
}

Regional Changchun Online--Alisha’s Party的更多相关文章

  1. 2013 Asia Regional Changchun C

    Little Tiger vs. Deep Monkey Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65535/65535 K ( ...

  2. Regional Changchun Online--Elven Postman(裸排序二叉树)

    Elven Postman Time Limit: 1500/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Tot ...

  3. Regional Changchun Online--Travel(最小生成树&& 并查集)

    Travel Time Limit: 1500/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others) Total S ...

  4. Regional Changchun Online--Ponds

    网址:http://acm.hdu.edu.cn/showproblem.php?pid=5438 Ponds Time Limit: 1500/1000 MS (Java/Others)    Me ...

  5. hdu 5444 Elven Postman(二叉树)——2015 ACM/ICPC Asia Regional Changchun Online

    Problem Description Elves are very peculiar creatures. As we all know, they can live for a very long ...

  6. (并查集)Travel -- hdu -- 5441(2015 ACM/ICPC Asia Regional Changchun Online )

    http://acm.hdu.edu.cn/showproblem.php?pid=5441 Travel Time Limit: 1500/1000 MS (Java/Others)    Memo ...

  7. (二叉树)Elven Postman -- HDU -- 54444(2015 ACM/ICPC Asia Regional Changchun Online)

    http://acm.hdu.edu.cn/showproblem.php?pid=5444 Elven Postman Time Limit: 1500/1000 MS (Java/Others)  ...

  8. 2015 ACM/ICPC Asia Regional Changchun Online HDU 5444 Elven Postman【二叉排序树的建树和遍历查找】

    Elven Postman Time Limit: 1500/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)T ...

  9. 2015ACM/ICPC Asia Regional Changchun Online /HDU 5438 图

    Ponds                                   Time Limit: 1500/1000 MS (Java/Others)    Memory Limit: 1310 ...

随机推荐

  1. maven学习笔记(定制普通Java一个项目)

    创建一个新项目: mvn archetype:generate -DgroupId=cn.net.comsys.ut4.simpleweather -DartifactId=simple-weathe ...

  2. Android 检测网络连接状态

    Android连接网络的时候,并不是每次都能连接到网络,因此在程序启动中需要对网络的状态进行判断,如果没有网络则提醒用户进行设置. 首先,要判断网络状态,需要有相应的权限,下面为权限代码(Androi ...

  3. jQuery.KinSlideshow焦点图轮换

    兼容IE6/IE7/IE8/IE9,FireFox,Chrome*,Opera的 jQuery. KinSlideshow幻灯片插件,功能很多 ,基本能满足你在网页上使用幻灯片(焦点图)效果. 演示网 ...

  4. js 日期时间比较

    js时间日期比较 <script type="text/javascript"> //begin > end 返回True function comptime(b ...

  5. Understanding and Managing SMTP Virtual Servers

    Simple Mail Transfer Protocol (SMTP) Service Overview The Simple Mail Transfer Protocol (SMTP) servi ...

  6. android学习笔记45——android的数据存储和IO

    android的数据存储和IO SharedPreferences与Editor简介 SharedPreferences保存的数据主要是类似于配置信息格式的数据,因此其保存的数据主要是简单的类型的ke ...

  7. 如何重装air

    参考这里 很多年没有装过系统了,手贱用xxcleaner清理了下,好吧,我觉得只能重装了,直接贴过程吧 ,开机同时command+R,进入菜单 ,抹掉磁盘 ,重启,等在线更新(看各位运气了,网速好的话 ...

  8. C语言每日一题之No.8

    正式面对自己第二天,突然一种强烈的要放弃的冲动,在害怕什么?害怕很难赶上步伐?害怕这样坚持到底是对还是错?估计是今天那个来了,所以身体激素有变化导致情绪起伏比较大比较神经质吧(☆_☆)~矮油,女人每个 ...

  9. 从1970年1月1日00:00:00 GMT以来此时间对象表示的毫秒数转化为Datetime

    1970年1月1日(00:00:00 GMT)Unix 时间戳(Unix Timestamp)对时间转换 将Long类型转换为DateTime类型 /// <summary> /// 将L ...

  10. Ajax方法执行跳转或者加载操作系统报出这样错误Sys.WebForms.PageRequestManagerParserErrorException:如何让解决

    当你在代码中使用Response.Redirect();  或者Response.Write();难免会遇到Sys.WebForms.PageRequestManagerParserErrorExce ...