Queue CodeForces
来源:互联网 发布:淘宝达人资历怎么写 编辑:程序博客网 时间:2024/06/03 06:55
In the Main Berland Bank n people stand in a queue at the cashier, everyone knows his/her height hi, and the heights of the other people in the queue. Each of them keeps in mind number ai — how many people who are taller than him/her and stand in queue in front of him.
After a while the cashier has a lunch break and the people in the queue seat on the chairs in the waiting room in a random order.
When the lunch break was over, it turned out that nobody can remember the exact order of the people in the queue, but everyone remembers his number ai.
Your task is to restore the order in which the people stood in the queue if it is possible. There may be several acceptable orders, but you need to find any of them. Also, you need to print a possible set of numbers hi — the heights of people in the queue, so that the numbers aiare correct.
The first input line contains integer n — the number of people in the queue (1 ≤ n ≤ 3000). Then n lines contain descriptions of the people as "namei ai" (one description on one line), where namei is a non-empty string consisting of lowercase Latin letters whose length does not exceed 10 characters (the i-th person's name), ai is an integer (0 ≤ ai ≤ n - 1), that represents the number of people who are higher and stand in the queue in front of person i. It is guaranteed that all names are different.
If there's no acceptable order of the people in the queue, print the single line containing "-1" without the quotes. Otherwise, print in n lines the people as "namei hi", where hi is the integer from 1 to 109 (inclusive), the possible height of a man whose name is namei. Print the people in the order in which they stand in the queue, starting from the head of the queue and moving to its tail. Numbers hi are not necessarily unique.
4a 0b 2c 0d 0
a 150c 170d 180b 160
4vasya 0petya 1manya 3dunay 3
-1
题意:告诉n个人每个人的前面有多少人比他高,要求求出所有人的可能高度
分析:这个就是一个脑洞题,想明白之后非常的简单。首先,假设h[i]表示第i个人前面比他高的人的数量,所以前面比他矮或等于他的人的数量不就是i-1-h[i]么,所以如果i-1-h[i]小于0,那么不就不存在这个人的身高了,那么不就出问题了?之后,我们就假设这个人的身高就是i-h[i]并且,所有人的身高不相等,那么我们只要每次求出来这个人的身高之后再去把前面大于等于这个人的身高加一就好了,因为所有人的身高都不相等了,小于这个人的身高的人数我们固定它,那么剩下的不就都是大于这个人的身高了么?
代码:
#include<iostream>#include<cstdio>#include<algorithm>using namespace std;const int maxed=3000+10;struct Node{ string str; int val,h;}node[maxed];int n;int main(){ bool cmp(Node,Node); scanf("%d",&n); for(int i=1;i<=n;i++) cin>>node[i].str>>node[i].val; sort(node+1,node+1+n,cmp); for(int i=1;i<=n;i++){ if(i-1-node[i].val<0) return printf("-1")*0; node[i].h=i-node[i].val; for(int j=1;j<i;j++) if(node[j].h>=node[i].h) node[j].h++; } for(int i=1;i<=n;i++) cout<<node[i].str<<" "<<node[i].h<<endl;}bool cmp(Node n1,Node n2){ return n1.val<n2.val;}
- Queue CodeForces
- Queue CodeForces
- codeforces 353D.Queue
- CodeForces 490B Queue
- CodeForces 303D Queue
- 【CODEFORCES】 B. Queue
- Codeforces-545D. Queue
- codeforces C. Queue
- codeforces 545D. Queue
- Codeforces-545D-Queue
- Codeforces 91B-Queue
- CodeForces 141C Queue
- codeforces C. Queue (思维)
- codeforces 91b Queue
- codeforces 545D Queue
- codeforces 38G Queue splay
- Codeforces 490B - Queue (模拟)
- Codeforces 490B Queue(水)
- C/C++编译的程序占用的内存
- Linux 使用su
- sourceInsight彻底重装
- Marvell交换机开发资料收集
- 自定义属性引入layout获取不到resourceId的问题
- Queue CodeForces
- Android 双击退出
- eclipse Theme.AppCompat 问题
- Mac操作系统下MySQL密码忘记后重置密码的方法
- Android创建一个前台服务
- Laravel+OSS使用笔记
- oracle索引详解
- win32 3步打包和释放资源
- VM222:2 pages/two/two.json 未找到入口 pages/two/two.json 文件,或者文件读取失败,请检查后重新编译。