Codeforces Round #346 (Div. 2) B
来源:互联网 发布:centos ntp 时间同步 编辑:程序博客网 时间:2024/05/02 02:03
Very soon Berland will hold a School Team Programming Olympiad. From each of the m Berland regions a team of two people is invited to participate in the olympiad. The qualifying contest to form teams was held and it was attended by n Berland students. There were at least two schoolboys participating from each of the m regions of Berland. The result of each of the participants of the qualifying competition is an integer score from 0 to 800 inclusive.
The team of each region is formed from two such members of the qualifying competition of the region, that none of them can be replaced by a schoolboy of the same region, not included in the team and who received a greater number of points. There may be a situation where a team of some region can not be formed uniquely, that is, there is more than one school team that meets the properties described above. In this case, the region needs to undertake an additional contest. The two teams in the region are considered to be different if there is at least one schoolboy who is included in one team and is not included in the other team. It is guaranteed that for each region at least two its representatives participated in the qualifying contest.
Your task is, given the results of the qualifying competition, to identify the team from each region, or to announce that in this region its formation requires additional contests.
The first line of the input contains two integers n and m (2 ≤ n ≤ 100 000, 1 ≤ m ≤ 10 000, n ≥ 2m) — the number of participants of the qualifying contest and the number of regions in Berland.
Next n lines contain the description of the participants of the qualifying contest in the following format: Surname (a string of length from 1to 10 characters and consisting of large and small English letters), region number (integer from 1 to m) and the number of points scored by the participant (integer from 0 to 800, inclusive).
It is guaranteed that all surnames of all the participants are distinct and at least two people participated from each of the m regions. The surnames that only differ in letter cases, should be considered distinct.
Print m lines. On the i-th line print the team of the i-th region — the surnames of the two team members in an arbitrary order, or a single character "?" (without the quotes) if you need to spend further qualifying contests in the region.
5 2Ivanov 1 763Andreev 2 800Petrov 1 595Sidorov 1 790Semenov 2 503
Sidorov IvanovAndreev Semenov
5 2Ivanov 1 800Andreev 2 763Petrov 1 800Sidorov 1 800Semenov 2 503
?Andreev Semenov
In the first sample region teams are uniquely determined.
In the second sample the team from region 2 is uniquely determined and the team from region 1 can have three teams: "Petrov"-"Sidorov", "Ivanov"-"Sidorov", "Ivanov" -"Petrov", so it is impossible to determine a team uniquely.
题意:给出各个队员的成绩,要求你输出每个队分手最高的两个人的名字,如果存在三个人的分数都为最高,则输出'?';反之输出这两个人的名字。
思路:cmp排序再判断一下就好。
代码:
#include<cstdio> #include<cstring>#include <algorithm>#include <cmath>using namespace std; #define maxn 100007#define inf 0x3f3f3f3ftypedef long long ll;struct node{char s[15];int x,y;}p[maxn];bool cmp(node x, node y){if(x.x == y.x){return x.y>y.y;}return x.x<y.x;}int main() { #ifdef CDZSC_Junefreopen("t.txt", "r", stdin); //freopen("E:\\w.txt", "w", stdout); #endif int n,m,sum;while(~scanf("%d%d",&n,&m)){for(int i = 0; i<n; i++){scanf("%s %d %d",&p[i].s,&p[i].x,&p[i].y);}sort(p,p+n,cmp);sum = 1;int vis;for(int i = 1; i<n; i++){vis = 1;while(p[i].x == p[i-1].x){if(vis){sum++;if(sum == 2){if(i+1 < n &&p[i].x == p[i+1].x && p[i+1].y == p[i].y){puts("?");}else{printf("%s %s\n",p[i-1].s,p[i].s);}sum = 1;vis = 0;}}i++;if(i>=n)break;}}}return 0; }
- Codeforces Round #346 (Div. 2) B
- Codeforces Round #346 (Div. 2)-B. Qualifying Contest(排序)
- Codeforces Round #346 (Div. 2)(B)排序,模拟
- Codeforces Round #346 (Div. 2)--B. Qualifying Contest
- Codeforces Round #346 (Div. 2) A B C D E
- Codeforces Round #346 (Div. 2) A.B.C.D.E
- Codeforces Round #346 (Div. 2) B. Qualifying Contest
- Codeforces Round #346 (Div. 2) - B Qualifying Contest
- Codeforces Round #346 (Div. 2) B. Qualifying Contest
- Codeforces Round #346 (Div. 2) B - Qualifying Contest 优先队列
- Codeforces Round #131 (Div. 2) A B
- Codeforces Round #134 (Div. 2)B. Airport
- Codeforces Round #170 (Div. 2) problem B
- Codeforces Round #173 (Div. 2) Problem B
- Codeforces Round #181 (Div. 2) B. Coach
- Codeforces Round #185 (Div. 2)--A,B
- Codeforces Round #171 (Div. 2) B
- Codeforces Round #169 (Div. 2) B题
- iOS系统GCD学习(5):信号量机制
- 关于xcode——主从关系模版程序
- PHP生成随机密码的4种方法及性能对比
- 【日常考试】中山市2016年小学生信息学竞赛试(shui)题
- An AnnotationConfiguration instance is required to use.....异常
- Codeforces Round #346 (Div. 2) B
- #学习笔记#(56)angular ui-router使用姿势
- iOS多线程开发(四)---线程同步
- Android中shape标签里的size子标签的android:width和android:height的使用
- coffeescript学习笔记二
- iOS中instancetype和id之间的区别
- node.js学习笔记(7)--Node.js与MongoDB简单交互
- SQL:不存在则insert存在则update
- phpcms中当在后台发布文章提示文件不可写,后台生成不了静态页时