zoukankan      html  css  js  c++  java
  • HDU 5131.Song Jiang's rank list (2014ACM/ICPC亚洲区广州站-重现赛)

    Song Jiang's rank list

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


    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
     
     
     
    代码:
     1 #include<iostream>
     2 #include<cstdio>
     3 #include<algorithm>
     4 #include<cstring>
     5 #include<cstdlib>
     6 #include<string.h>
     7 #include<set>
     8 #include<vector>
     9 #include<queue>
    10 #include<stack>
    11 #include<map>
    12 #include<cmath>
    13 using namespace std;
    14 typedef long long ll;
    15 const int INF=0x3f3f3f3f;
    16 const int N=1e5+10;
    17 int flag[N];
    18 struct node{
    19     string s;
    20     int p;
    21 }a[N];
    22 bool cmp(node a,node b){
    23     if(a.p==b.p)return a.s<b.s;
    24     else return a.p>b.p;
    25 }
    26 int main(){
    27     int n,m;
    28     while(cin>>n){
    29             if(n==0)break;
    30         memset(flag,0,sizeof(flag));
    31         for(int i=1;i<=n;i++){
    32             cin>>a[i].s>>a[i].p;
    33             flag[a[i].p]++;
    34         }
    35         sort(a+1,a+1+n,cmp);
    36         for(int i=1;i<=n;i++)
    37             cout<<a[i].s<<" "<<a[i].p<<endl;
    38         cin>>m;
    39         while(m--){
    40             string x;
    41             cin>>x;
    42             for(int i=1;i<=n;i++){
    43                 if(x==a[i].s){
    44                     if(flag[a[i].p]==1)cout<<i<<endl;
    45                     else{
    46                         int cnt=0;
    47                         for(int j=1;j<=n;j++){
    48                             if(a[j].p==a[i].p&&a[j].s!=a[i].s)
    49                                 cnt++;
    50                             if(a[j].s==a[i].s)break;
    51                         }
    52                         if(cnt==0)cout<<i;
    53                         else cout<<i-cnt;
    54                         if(cnt+1>1)cout<<" "<<cnt+1<<endl;
    55                         else cout<<endl;
    56                     }
    57                 }
    58             }
    59         }
    60     }
    61     return 0;
    62 }

    打这一套题,就会写一个,菜哭。

  • 相关阅读:
    QT visual stuido 集成插件不能打开ui文件的解决方法(去掉xml的UTF8标记)
    就异地协作办公来说, 360的体验完爆他们——360书生企业云盘 来了
    MVC 4
    Mvc的多层架构
    代码生成器
    js理解
    我(webabcd)的文章索引
    多个视图结果显示于一个共用预览视图内
    .NET源码
    Using Ninject in a Web Application
  • 原文地址:https://www.cnblogs.com/ZERO-/p/8053109.html
Copyright © 2011-2022 走看看