首页 > 代码库 > Song Jiang's rank list
Song Jiang's rank list
Song Jiang‘s rank list
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)
Total Submission(s): 14 Accepted Submission(s): 8
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.
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
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.
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
5WuSong 12LuZhishen 12SongJiang 13LuJunyi 1HuaRong 155WuSongLuJunyiLuZhishenHuaRongSongJiang0
Sample Output
HuaRong 15SongJiang 13LuZhishen 12WuSong 12LuJunyi 13 25312
·这题太坑了，，，不知道排序函数为什么错了。
后来改成：
if( strcmp(x.name1,y.name1) < 0) return 1;
else return 0;
才过，不知道原因，但以后还是多注意吧。
AC Code：
1 #include <iostream> 2 #include <stdio.h> 3 #include <algorithm> 4 #include <cstring> 5 #include <string.h> 6 #include <math.h> 7 #include <queue> 8 #include <stack> 9 #include <stdlib.h>10 #include <map>11 using namespace std;12 #define LL long long 13 #define sf(a) scanf("%d",&(a));14 15 16 #define N 32017 18 struct LNode{19 char name[55];20 char name1[55];21 int num;22 }f[N];23 24 int cmd(const struct LNode x,const struct LNode y){25 if(x.num == y.num)26 if( strcmp(x.name1,y.name1) < 0) return 1;27 else return 0;28 else return x.num > y.num; //从小到大顺序排列29 }30 void print(int n){31 for(int i=0;i<n;i++){32 printf("%s %d\n",f[i].name,f[i].num);33 }34 }35 int main()36 {37 int n,m;38 while(scanf("%d",&n)&& n){39 for(int i=0;i<n;i++){40 scanf("%s %d",f[i].name,&f[i].num);41 for(int j=0;j<=strlen(f[i].name);j++)42 if(f[i].name[j]>=‘A‘ && f[i].name[j]<=‘Z‘) f[i].name1[j] = f[i].name[j] + 32;43 else f[i].name1[j] = f[i].name[j];44 }45 sort(f,f+n,cmd);46 scanf("%d",&m);47 print(n);48 for(int i=0;i<m;i++){49 char name[55];50 scanf("%s",name);51 //for(int i=0;i<strlen(name);i++) if(name[i]>=‘A‘ && name[i]<=‘Z‘) name[i] = name[i] + 32;52 for(int j=0;j<n;j++){53 if(strcmp(name,f[j].name)==0){54 55 if(j>0 && f[j-1].num==f[j].num){56 int t=1;57 for(int k=j-1;k>=0;k--){58 if(f[k].num == f[j].num) t++;59 }60 printf("%d %d",j-t+2,t);61 62 }else{63 printf("%d",j+1);64 }65 printf("\n");66 }67 }68 }69 }70 return 0;71 }
Song Jiang's rank list
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。