#82793 (C++11（廃止可能性あり）) No.43 野球の試合

• 問題: No.43 野球の試合
• ユーザー: satanic
• 提出日時: 2016-03-22 20:16:54
• 言語: C++11（廃止可能性あり） (gcc 13.3.0)
• 結果: WA
• 実行時間: -
• コード長: 2,582 bytes
• コンパイル時間: 638 ms
• コンパイル使用メモリ: 70,792 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-10-01 13:05:37
• 合計ジャッジ時間: 1,122 ms
• ジャッジサーバーID （参考情報）: judge4 / judge1

ファイルパターン	結果
sample	AC * 4
other	AC * 5 WA * 2

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
#include <iostream>
#include <vector>
#include <algorithm>
/*
#define SHOWMTRX(a){printf("---"#a"---\n");for(int i=0;i<n;++i){for(int j=0;j<n;++j){printf("%4d",a[i][j]);}printf("\n");}printf("----\n");}
#define SHOWARRY(a){printf("---"#a"---\n");for(int i=0;i<n;++i){printf("%4d\n",a[i]);}printf("----\n");}
*/
int main() {
    //std::ios::sync_with_stdio(false);
    //std::cin.tie(0);
    int n;
    std::cin >> n;
    std::vector<std::vector<int>> s(n, std::vector<int>(n));
    std::vector<std::vector<int>> evaluation(n, std::vector<int>(n));
    std::vector<int> point(n, 0);
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            char c;
            std::cin >> c;
            switch (c) {
            case '#': s[i][j] = 99; break;
            case 'o': s[i][j] =  1; break;
            case 'x': s[i][j] = -1; break;
            case '-': s[i][j] =  0; break;
            }
        }
    }//SHOWMTRX(s);
    for (int i = 0; i < n; ++i) {
        if (s[0][i] == 0) {
            s[0][i] = 1;
            s[i][0] = -1;
        }
    }//SHOWMTRX(s);
    for (int i = 0; i < n; ++i) {
        int sum = 0;
        for (int j = 0; j < n; ++j) {
            if (s[i][j] == 99) continue;
            sum += s[i][j];
        }
        point[i] = sum;
    }//SHOWARRY(point);
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            if (s[i][j] != 0) evaluation[i][j] = -99;
            else              evaluation[i][j] = point[i];
        }
    }//SHOWMTRX(evaluation);
    for (int i = 0; i < n; ++i) {
        for (int j = i + 1; j < n; ++j) {
            if (evaluation[i][j] == -99) continue;
            int tmp = evaluation[j][i];
            evaluation[j][i] -= evaluation[i][j];
            evaluation[i][j] -= tmp;
            evaluation[i][j] *= -1;
            evaluation[j][i] *= -1;
        }
    }//SHOWMTRX(evaluation);
    bool flag;
    do {
        flag = false;
        int max = -99, maxI, maxJ;
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < n; ++j) {
                if (max < evaluation[i][j]) {
                    max = evaluation[i][j];
                    maxI = i;
                    maxJ = j;
                    flag = true;
                }
            }
        }
        if (flag) {
            evaluation[maxI][maxJ] = -99;
            evaluation[maxJ][maxI] = -99;
            s[maxI][maxJ] = 1;
            s[maxJ][maxI] = -1;
        }
    } while (flag); //SHOWMTRX(s);
    for (int i = 0; i < n; ++i) {
        int sum = 0;
        for (int j = 0; j < n; ++j) {
            if (s[i][j] == 99) continue;
            sum += s[i][j];
        }
        point[i] = sum;
    }//SHOWARRY(point);
    int pointZero = point[0];
    std::sort(point.begin(), point.end());
    std::reverse(point.begin(), point.end());
    std::vector<int> rank;
    for (int i = 0; i < n; ++i) {
        if (std::find(rank.begin(), rank.end(), point[i]) == rank.end()) {
            rank.push_back(point[i]);
        }
    }
    for (int i = 0; i < rank.size(); ++i) {
        if (rank[i] == pointZero) {
            std::cout << i + 1 << "\n";
            break;
        }
    }
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX