UVA Football (aka Soccer)

题目如下：

Problem A: Football (aka Soccer)

The Problem

Football the most popular sport in the world (americans insist to call it "Soccer", but we will call it "Football"). As everyone knows, Brasil is the country that have most World Cup titles (four of them: 1958, 1962, 1970 and 1994). As our national tournament have many teams (and even regional tournaments have many teams also) it's a very hard task to keep track of standings with so many teams and games played!

So, your task is quite simple: write a program that receives the tournament name, team names and games played and outputs the tournament standings so far.

A team wins a game if it scores more goals than its oponent. Obviously, a team loses a game if it scores less goals. When both teams score the same number of goals, we call it a tie. A team earns 3 points for each win, 1 point for each tie and 0 point for each loss.

Teams are ranked according to these rules (in this order):

    Most points earned.
    Most wins.
    Most goal difference (i.e. goals scored - goals against)
    Most goals scored.
    Less games played.
    Lexicographic order.

The Input

The first line of input will be an integer N in a line alone (0 < N < 1000). Then, will follow N tournament descriptions. Each one begins with the tournament name, on a single line. Tournament names can have any letter, digits, spaces etc. Tournament names will have length of at most 100. Then, in the next line, there will be a number T (1 < T <= 30), which stands for the number of teams participating on this tournament. Then will follow T lines, each one containing one team name. Team names may have any character that have ASCII code greater than or equal to 32 (space), except for '#' and '@' characters, which will never appear in team names. No team name will have more than 30 characters.

Following to team names, there will be a non-negative integer G on a single line which stands for the number of games already played on this tournament. G will be no greater than 1000. Then, G lines will follow with the results of games played. They will follow this format:

team_name_1#goals1@goals2#team_name_2

For instance, the following line:

Team A#3@1#Team B

Means that in a game between Team A and Team B, Team A scored 3 goals and Team B scored 1. All goals will be non-negative integers less than 20. You may assume that there will not be inexistent team names (i.e. all team names that appear on game results will have apperead on the team names section) and that no team will play against itself.
The Output

For each tournament, you must output the tournament name in a single line. In the next T lines you must output the standings, according to the rules above. Notice that should the tie-breaker be the lexographic order, it must be done case insenstive. The output format for each line is shown bellow:

[a]) Team_name [b]p, [c]g ([d]-[e]-[f]), [g]gd ([h]-[i])

Where:

    [a] = team rank
    [b] = total points earned
    [c] = games played
    [d] = wins
    [e] = ties
    [f] = losses
    [g] = goal difference
    [h] = goals scored
    [i] = goals against

There must be a single blank space between fields and a single blank line between output sets. See the sample output for examples.
Sample Input

2
World Cup 1998 - Group A
4
Brazil
Norway
Morocco
Scotland
6
Brazil#2@1#Scotland
Norway#2@2#Morocco
Scotland#1@1#Norway
Brazil#3@0#Morocco
Morocco#3@0#Scotland
Brazil#1@2#Norway
Some strange tournament
5
Team A
Team B
Team C
Team D
Team E
5
Team A#1@1#Team B
Team A#2@2#Team C
Team A#0@0#Team D
Team E#2@1#Team C
Team E#1@2#Team D

Sample Output

World Cup 1998 - Group A
1) Brazil 6p, 3g (2-0-1), 3gd (6-3)
2) Norway 5p, 3g (1-2-0), 1gd (5-4)
3) Morocco 4p, 3g (1-1-1), 0gd (5-5)
4) Scotland 1p, 3g (0-1-2), -4gd (2-6)

Some strange tournament
1) Team D 4p, 2g (1-1-0), 1gd (2-1)
2) Team E 3p, 2g (1-0-1), 0gd (3-3)
3) Team A 3p, 3g (0-3-0), 0gd (3-3)
4) Team B 1p, 1g (0-1-0), 0gd (1-1)
5) Team C 1p, 2g (0-1-1), -1gd (3-4)

这道题我用面向对象编的，把队伍和它的各种操作封装起来，有一些细节导致WA了几次，比如输出最后不能有空行，按字典序排序时不分大小写，还把题看错了。。。不过看懂题后算法其实挺简单，按照步骤搜索排序即可。

AC的代码如下：

#include 
   
   
    
    
#include
    
    
     
     
#include
     
     
      
      
using namespace std;
class team
{
    string name;
    int point;
    int score;
    int against;
    int game;
    int wins;
    int ties;
    int loss;
    int gd;
    int ranks;
public:
    team()
    {
        point=0;
        score=0;
        against=0;
        game=0;
        wins=0;
        ties=0;
        loss=0;
        gd=0;
    }
    void setname()
    {
        string s;
        getline(cin,s);
        name=s;
    }
    bool isteam(string s)
    {
        if(name==s)
            return true;
        else return false;
    }
    void setnumber(int a,int b,int p)
    {
        score+=a;
        against+=b;
        point+=p;
        game++;
        gd=score-against;
    }
    void setwins()
    {
        wins++;
    }
    void setties()
    {
        ties++;
    }
    void setloss()
    {
        loss++;
    }
    void show()
    {
        cout<
      
      
       
       <<") "<
       
       
         <<" "< 
        
          <<"p, "< 
         
           <<"g ("< 
          
            <<"-"< 
           
             <<"-"< 
            
              <<"), "< 
             
               <<"gd ("< 
              
                <<"-"< 
               
                 <<")"< 
                
                  t2.point) return; else if(t1.point 
                 
                   t2.wins) return; else if(t1.gd 
                  
                    t2.gd) return ; else if(t1.score 
                   
                     t2.score) return ; else if(t1.game 
                    
                      t2.game) return ; else if(t1.name 
                     
                       >N; getchar(); int i; for(i=0; i<=N-1; i++) { string tour; getline(cin,tour); int t; cin>>t; getchar(); team T[30]; int j; for(j=0; j<=t-1; j++) { T[j].setname(); } int g; cin>>g; getchar(); for(j=0; j<=g-1; j++) { string result,result1,result2; cin>>result; int a,b; int k; for(k=0; result[k]!='#'; k++) result1[k]=result[k]; k++; a=result[k]-'0'; k=k+2; b=result[k]-'0'; k=k+2; int m; for(m=k; m<=result.size()-1; m++) result2[m-k]=result[m]; for(m=0; m<=t-1; m++) if(T[m].isteam(result1)) { k=m; } int p; for(m=0; m<=t-1; m++) if(T[m].isteam(result2)) { p=m; } if(a>b) { T[k].setnumber(a,b,3); T[p].setnumber(b,a,0); T[k].setwins(); T[p].setloss(); } else if(a