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

• 問題: No.43 野球の試合
• ユーザー: tea_pt
• 提出日時: 2015-06-20 14:49:36
• 言語: C++11（廃止可能性あり） (gcc 13.3.0)
• 結果: AC
• 実行時間: 7 ms / 5,000 ms
• コード長: 1,816 bytes
• コンパイル時間: 660 ms
• コンパイル使用メモリ: 90,964 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-07-07 15:12:51
• 合計ジャッジ時間: 1,106 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

ファイルパターン	結果
sample	AC * 4
other	AC * 7

ソースコード

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
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
#define _CRT_SECURE_NO_WARNINGS
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#include <stack>
#include <array>
#include <fstream>
#define REP(i,n) for(int (i) = 0;(i) < (n) ; ++(i))
#define REPA(a,i,n) for(int (i) = (a) ; (i) < (n) ; ++(i))
#if defined(_MSC_VER)||__cplusplus > 199711L
#define AUTO(r,v) auto r = (v)
#else
#define AUTO(r,v) typeof(v) r = (v)
#endif
#define ALL(c) (c).begin() , (c).end()
#define EACH(it,c) for(AUTO(it,(c).begin());it != (c).end();++it)
#define LL long  
#define int LL
#define INF  99999999
#define DEV 1000000007
#define QUICK_CIN ios::sync_with_stdio(false); cin.tie(0);
using namespace std;
string t[7];
int n;
struct P{
    int x, y;
};
vector<P> aa;
int check()
{
    int win[7] = { 0 };
    REP(i, n){
        REP(j,n)
        if (t[i][j] == 'o'){
            win[i]++;
        }
    }
    int a = win[0];
    sort(win, win + n,greater<int>());
    int aaa = win[0];
    int it = 1;
    REP(i, n){
        if (aaa != win[i]){
            aaa = win[i];
            it++;
        }
        if (a == win[i]){
            break;
        }
    }
    return it;
}
int solve()
{
    if (!aa.size()){
        return check();
    }
    int kk;
    auto x = aa.back();
    aa.pop_back();
    t[x.x][x.y] = 'o';
    t[x.y][x.x] = 'x';
    kk = solve();
    t[x.x][x.y] = 'x';
    t[x.y][x.x] = 'o';
    kk = min(kk,solve());
    aa.push_back(x);
    return kk;
}
signed main()
{
    QUICK_CIN;
    //ifstream cin("debug.txt");
    //ofstream cout("result.txt");
    cin >> n;
    REP(i, n){
        cin >> t[i];
    }
    REP(i, n){
        t[i][i] = '#';
    }
    REP(i, n){
        REPA(i, j, n){
            if (t[i][j] == '-'){
                aa.push_back({ i, j });
            }
        }
    }
    cout << solve() << endl;
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX