#12624 (Java) No.43 野球の試合

• 問題: No.43 野球の試合
• ユーザー: ぴろず
• 提出日時: 2015-02-15 17:25:54
• 言語: Java (openjdk 23)
• 結果: AC
• 実行時間: 258 ms / 5,000 ms
• コード長: 2,882 bytes
• コンパイル時間: 2,864 ms
• コンパイル使用メモリ: 90,956 KB
• 実行使用メモリ: 59,708 KB
• 最終ジャッジ日時: 2024-06-23 20:21:27
• 合計ジャッジ時間: 4,835 ms
• ジャッジサーバーID （参考情報）: judge2 / judge3

ファイルパターン	結果
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
126
127
128
129
package no043;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.Scanner;
import java.util.TreeSet;
public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        char[][] map = new char[n][];
        char[][] map2 = new char[n][n];
        for(int i=0;i<n;i++) {
            map[i] = sc.next().toCharArray();
        }
        int m = n * (n - 1) / 2;
        int[] wins = new int[n];
        int ans = 999;
        LOOP: for(int i=0;i<1<<m;i++) {
            int ni = 0;
            int nj = 1;
            for(int j=0;j<m;j++) {
                map2[ni][nj] = ((i>>j) & 1) == 0 ? 'x' : 'o' ;
                if (nj == n-1) {
                    ni++;
                    nj = ni + 1;
                }else{
                    nj++;
                }
            }
            //矛盾のチェック
            for(int i2=0;i2<n;i2++) {
                for(int j2=i2+1;j2<n;j2++) {
                    if (map[i2][j2] != '-' && map[i2][j2] != map2[i2][j2]) {
                        continue LOOP;
                    }
                }
            }
            //完全な順位表の作成
            for(int i2=0;i2<n;i2++) {
                for(int j2=0;j2<=i2;j2++) {
                    if (i2 == j2) {
                        map2[i2][j2] = '#';
                    }else{
                        map2[i2][j2] = map2[j2][i2] == 'o' ? 'x' : 'o';
                    }
                }
            }
            //集計
            Arrays.fill(wins, 0);
            TreeSet<Integer> ts = new TreeSet<>(Collections.reverseOrder());
            for(int i2=0;i2<n;i2++) {
                for(int j2=0;j2<n;j2++) {
                    if (map2[i2][j2] == 'o') {
                        wins[i2]++;
                    }
                }
                ts.add(wins[i2]);
            }
            int rank = 1;
            for(Integer x:ts) {
                if (x == wins[0]) {
                    break;
                }
                rank++;
            }
            ans = Math.min(ans,rank);
        }
        System.out.println(ans);
    }
}
class Pair<A extends Comparable<A>,B extends Comparable<B>> implements Comparable<Pair<A,B>>{
    A a;
    B b;
    public Pair(A a,B b) {
        this.a = a;
        this.b = b;
    }
    public int compareTo(Pair<A, B> o) {
        int comp = a.compareTo(o.a);
        if (comp != 0) {
            return comp;
        }
        return b.compareTo(o.b);
    }
    public boolean equals(Object o) {
        if (o instanceof Pair) {
            @SuppressWarnings("rawtypes")
            Pair p = (Pair) o;
            return a.equals(p.a) && b.equals(p.b);
        }
        return super.equals(o);
    }
    public int hashCode() {
        return a.hashCode() + b.hashCode();
    }
    public String toString() {
        return "[" + a + "," + b + "]";
    }
    public static <C extends Comparable<C>,D extends Comparable<D>> Comparator<Pair<C,D>> CompareA() {
        Comparator<Pair<C,D>> comp = new Comparator<Pair<C,D>>() {
            public int compare(Pair<C, D> o1, Pair<C, D> o2) {
                int comp = o1.a.compareTo(o2.a);
                if (comp != 0) {
                    return comp;
                }
                return o1.b.compareTo(o2.b);
            }
        };
        return comp;
    };
    public static <C extends Comparable<C>,D extends Comparable<D>> Comparator<Pair<C,D>> CompareB() {
        Comparator<Pair<C,D>> comp = new Comparator<Pair<C,D>>() {
            public int compare(Pair<C, D> o1, Pair<C, D> o2) {
                int comp = o1.b.compareTo(o2.b);
                if (comp != 0) {
                    return comp;
                }
                return o1.a.compareTo(o2.a);
            }
        };
        return comp;
    };
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX