HDU 5131 Song Jiang's rank list 2014ICPC广州站现场赛

Song Jiang's rank list

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 512000/512000 K (Java/Others)
Total Submission(s): 757    Accepted Submission(s): 386

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
  
  

 

题意：输入N个名字，每个名字都附有一个全权值，输出先按权值降序排列，如果权值相同按字典序升序排列，给出Q个询问，对于每个名字，输出其名字，如果排名相同就输出排名以及在本排名中的排名，本排名排第一时不用输出排名内排名。

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <cctype>
#include <numeric>
#include <iomanip>
#include <bitset>
#include <sstream>
#include <fstream>
#define debug "output for debug\n"
#define pi (acos(-1.0))
#define eps (1e-8)
#define inf 0x3f3f3f3f
#define ll long long int
#define lson l , m , rt << 1
#define rson m + 1 , r , rt << 1 | 1
using namespace std;
const int mod = 1000000007;
const int Max = 100005;
int n,m,k,q;
struct node
{
    string s;
    int id,val;
    int num;

}a[2005];
char b[2005][2005];
bool cmp(node u,node v)
{
    if(u.val==v.val)
        return u.s<v.s;
    return u.val>v.val;
}
int main()
{
    while(scanf("%d",&n)&&n)
    {
        for(int i=1;i<=n;i++)
        {
            a[i].s="";
        }
        for(int i=1;i<=n;i++)
        {
            cin>>a[i].s;
            scanf("%d",&a[i].val);
            a[i].num=0;
        }
        sort(a+1,a+n+1,cmp);
        for(int i=1;i<=n;i++){
            a[i].id=i;
            a[i].num++;
        }
        for(int i=2;i<=n;i++)
        {
            if(a[i].val==a[i-1].val){
                a[i].id=a[i-1].id;
                a[i].num+=a[i-1].num;
            }
        }
        scanf("%d",&q);
        string ss[2005];

        for(int i=1;i<=q;i++)
        {
            cin>>ss[i];
        }
        for(int i=1;i<=n;i++)
        {
            cout<<a[i].s<<" "<<a[i].val<<endl;
        }
        for(int i=1;i<=q;i++){
            for(int j=1;j<=n;j++)
            {
                if(ss[i]==a[j].s)
                {
                    if(a[j].num!=1)
                        printf("%d %d\n",a[j].id,a[j].num);
                    else
                        printf("%d\n",a[j].id);
                }
            }
        }
    }
    return 0;
}

题目链接： 点击打开链接