UVa 10194 - Football (aka Soccer)

最新推荐文章于 2019-02-20 08:47:56 发布

cugfjp

最新推荐文章于 2019-02-20 08:47:56 发布

阅读量461

点赞数

分类专栏：算法文章标签： UVa

本文链接：https://blog.csdn.net/cugfjp/article/details/9498267

版权

算法专栏收录该内容

154 篇文章 0 订阅

订阅专栏

/*
 排序，细心点就可以过
*/
#include <cstdio>
#include <cstring>
#include <cctype>
#include <algorithm>
using namespace std;
const int MAXN = 34;
const int TOURNAMENT_NAME = 104;
const int TEAM_NAME = 34;
const int BUFF_SIZE = 1024;
char tname[TOURNAMENT_NAME];
char team[MAXN][TEAM_NAME];
char no_case_team[MAXN][TEAM_NAME];
char buff[BUFF_SIZE];
int idx[MAXN];
int ans[MAXN][8];
int n;

int get_team(char *s)
{
    for(int i=0; i<n; i++) {
        if(!strcmp(team[i], s)) return i;
    }
    printf("team name error!");
    return 0;
}

bool cmp(int a, int b)
{
    if(ans[a][0] != ans[b][0]) return ans[a][0] > 

ans[b][0];
    if(ans[a][2] != ans[b][2]) return ans[a][2] > 

ans[b][2];
    if(ans[a][5] != ans[b][5]) return ans[a][5] > 

ans[b][5];
    if(ans[a][6] != ans[b][6]) return ans[a][6] > 

ans[b][6];
    if(ans[a][1] != ans[b][1]) return ans[a][1] < 

ans[b][1];
    else return strcmp(no_case_team[a], 

no_case_team[b]) < 0;
}

int main() {
    #ifndef ONLINE_JUDGE
    freopen("in.txt", "r", stdin);
    #endif
    int T, G;
    scanf("%d\n", &T);
    while(T--) {
        gets(tname);
        scanf("%d\n", &n);
        for(int i=0; i<n; i++) {
            gets(team[i]);
            idx[i] = i;
            int len = strlen(team[i]);
            for(int j=0; j<len; j++) {
                no_case_team[i][j] = tolower

(team[i][j]);
            }
        }
        scanf("%d\n", &G);
        memset(ans, 0, sizeof(ans));
        int ta, tb, ga, gb;
        char *p;
        while(G--) {
            gets(buff);
            p = strchr(buff, '#');
            *p++ = 0;
            ta = get_team(buff);
            sscanf(p, "%d", &ga);
            while(*p++ != '@');
            sscanf(p, "%d", &gb);
            while(*p++ != '#');
            tb = get_team(p);

            ans[ta][6] += ga;   ans[tb][6] += gb;
            ans[ta][7] += gb;   ans[tb][7] += ga;
            if(ga > gb) {
                ans[ta][2]++;
                ans[tb][4]++;
            } else if(gb > ga) {
                ans[ta][4]++;
                ans[tb][2]++;
            } else {
                ans[ta][3]++;
                ans[tb][3]++;
            }
        }
        for(int i=0; i<n; i++) {
            ans[i][0] = 3*ans[i][2] + ans[i][3];
            ans[i][1] = ans[i][2] + ans[i][3] + 

ans[i][4];
            ans[i][5] = ans[i][6] - ans[i][7];
        }
        sort(idx, idx+n, cmp);
        puts(tname);
        for(int i=0; i<n; i++) {
            int j = idx[i];
            int *r = ans[j];
            printf("%d) %s %dp, %dg (%d-%d-%d), 

%dgd (%d-%d)\n",
                   i+1, team[j], r[0], r[1], r

[2], r[3], r[4], r[5], r[6], r[7]);
        }
        if(T) printf("\n");
    }
    return 0;
}