2014ACM/ICPC 广州赛区E题 (水~)
2014-12-03 16:51
239 查看
Song Jiang's rank list
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0
Problem Description
《Shui Hu Zhuan》,also 《Water Margin》was written by Shi Nai'an -- an writer of Yuan and Ming dynasty. 《Shui Hu Zhuan》is one of the Four Great Classical Novels of Chinese literature. It tells a story about 108 outlaws. They came from different backgrounds (including scholars, fishermen, imperial drill instructors etc.), and all of them eventually came to occupy Mout Liang(or Liangshan Marsh) and elected Song Jiang as their leader. In order to encourage his military officers, Song Jiang always made a rank list after every battle. In the rank list, all 108 outlaws were ranked by the number of enemies he/she killed in the battle. The more enemies one killed, one's rank is higher. If two outlaws killed the same number of enemies, the one whose name is smaller in alphabet order had higher rank. Now please help Song Jiang to make the rank list and answer some queries based on the rank list.
Input
There are no more than 20 test cases. For each test case: The first line is an integer N (0<N<200), indicating that there are N outlaws. Then N lines follow. Each line contains a string S and an integer K(0<K<300), meaning an outlaw's name and the number of enemies he/she had killed. A name consists only letters, and its length is between 1 and 50(inclusive). Every name is unique. The next line is an integer M (0<M<200) ,indicating that there are M queries. Then M queries follow. Each query is a line containing an outlaw's name. The input ends with n = 0
Output
For each test case, print the rank list first. For this part in the output ,each line contains an outlaw's name and the number of enemies he killed. Then, for each name in the query of the input, print the outlaw's rank. Each outlaw had a major rank and a minor rank. One's major rank is one plus the number of outlaws who killed more enemies than him/her did.One's minor rank is one plus the number of outlaws who killed the same number of enemies as he/she did but whose name is smaller in alphabet order than his/hers. For each query, if the minor rank is 1, then print the major rank only. Or else Print the major rank, blank , and then the minor rank. It's guaranteed that each query has an answer for it.
Sample Input
5 WuSong 12 LuZhishen 12 SongJiang 13 LuJunyi 1 HuaRong 15 5 WuSong LuJunyi LuZhishen HuaRong SongJiang 0
Sample Output
HuaRong 15 SongJiang 13 LuZhishen 12 WuSong 12 LuJunyi 1 3 2 5 3 1 2
简单题。。
不多说了(泪啊)
要注意排序函数不能用strcmp,我记得以前用可以,,估计我记错了,诶
AC代码:
#include <cstdio> #include <cstring> #include <iostream> #include <algorithm> #include <cstdlib> #include <cmath> #include <stack> #include <queue> #define LL long long #define max3(a,b,c) max(a,max(b,c)) #define min3(a,b,c) min(a,min(b,c)) using namespace std; struct node { char name[105]; int num; int major, minor; }out[210]; bool cmp(node a, node b) { if(a.num!=b.num)return a.num>b.num; else for(int i=0; ;) { if(a.name[i]!=b.name[i])return a.name[i]<b.name[i]; else i++; } } int main() { int n, m; while(scanf("%d", &n), n) { for(int i=0; i<n; i++) { scanf("%s %d", out[i].name, &out[i].num); out[i].major=1; out[i].minor=1; } sort(out, out+n, cmp); for(int i=0; i<n; i++) { printf("%s %d\n", out[i].name, out[i].num); } int rank = 1; for(int i=1; i<n; i++) { rank++; if(out[i].num==out[i-1].num) { out[i].major = out[i-1].major; out[i].minor = out[i-1].minor+1; } else out[i].major = rank; } scanf("%d", &m); for(int i=0; i<m; i++) { char b[105]; scanf("%s", b); for(int j=0; j<n; j++) { if(strcmp(b, out[j].name)==0) { if(out[j].minor==1) printf("%d\n", out[j].major); else printf("%d %d\n", out[j].major, out[j].minor); break; } } } } return 0; }
相关文章推荐
- 2014ACM/ICPC广州赛区I题(dfs+剪枝)(hdu5135)
- HDU5024 2014 ACM-ICPC亚洲区域赛广州赛区网络赛C题 Wang Xifeng's Little Plot
- 2014 ACM/ICPC 广州赛区网络赛解题报告汇总
- 2014 ACM/ICPC 鞍山赛区现场赛 D&I 解题报告
- 2014 39th ACM-ICPC 北京赛区 总结
- 2014 ACM/ICPC 西安赛区网络赛解题报告汇总
- 2014ACM/ICPC亚洲区鞍山赛区现场赛 题解
- 2014ACM/ICPC亚洲区鞍山赛区现场赛D Galaxy(hdu 5073)
- ZOJ3822 ACM-ICPC 2014 亚洲区域赛牡丹江赛区现场赛D题Domination 概率DP(两种解法)
- 2014 ACM/ICPC 北京赛区网络赛解题报告汇总
- 2014ACM/ICPC亚洲区鞍山赛区现场赛I (hdu 5078)
- hdu 5023 && poj 2777(线段染色)2014 ACM/ICPC Asia Regional 广州 Online
- 2014 ACM/ICPC 上海赛区网络赛解题报告汇总
- 2014 39th ACM-ICPC 西安赛区 总结
- 【解题报告】2014ACM/ICPC亚洲区广州站
- 2014ACM/ICPC亚洲区鞍山赛区现场赛题解报告
- 2014 ACM/ICPC 北京赛区现场赛总结!!
- HDU 5115 Dire Wolf(2014ACM/ICPC北京赛区现场赛D)
- 2014 ACM/ICPC 西安赛区 F -- color
- 2014ACM/ICPC亚洲区鞍山赛区现场赛——题目重现