#1071 (C#(csc)) No.43 野球の試合

• 問題: No.43 野球の試合
• ユーザー: nanophoto12
• 提出日時: 2014-10-29 00:15:57
• 言語: C#(csc) (csc 3.9.0)
• 結果: WA
• 実行時間: -
• コード長: 3,226 bytes
• コンパイル時間: 1,030 ms
• コンパイル使用メモリ: 107,520 KB
• 実行使用メモリ: 17,920 KB
• 最終ジャッジ日時: 2024-12-30 13:27:52
• 合計ジャッジ時間: 2,034 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

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

コンパイルメッセージ

Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

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
using System;
using System.Globalization;
class Program
{
    public static void Main(string[] args)
    {
        var n = int.Parse(Console.ReadLine());
        string[] texts = new string[n];
        for (int i = 0; i < n; i++)
        {
            texts[i] = Console.ReadLine();
        }
        char[,] grid = new char[n,n];
        for (int i = 0; i < n; i++)
        {
            for (int k = 0; k < n; k++)
            {
                grid[i, k] = texts[i][k];
            }
        }
        int[] winCounts = new int[n];
        for (int i = 1; i < n; i++)
        {
            if (grid[0,i] == 'o')
            {
                winCounts[0]++;
            }
            else if (grid[0,i] == '-')
            {
                winCounts[0]++;
                grid[0, i] = 'o';
                grid[i, 0] = 'x';
            }
        }
        for (int y = 1; y < n; y++)
        {
            for (int x = 0; x < n; x++)
            {
                if (grid[y, x] == 'o')
                {
                    winCounts[y]++;
                }
            }
        }
        var max = Dfs(grid, 0, 1, winCounts, n);
        Console.WriteLine(max.ToString(CultureInfo.InvariantCulture));
    }
    private static int Dfs(char[,] grid, int x, int y, int[] winCounts, int n)
    {
        if (x == n - 1 && y == n - 1)
        {
            var values = new Tuple<int, int>[n];
            for (int i = 0; i < n; i++)
            {
                values[i] = new Tuple<int, int>(i, winCounts[i]);
            }
            Array.Sort(values, (tuple, tuple1) => tuple1.Item2.CompareTo(tuple.Item1));
            int rank = 0;
            int previous = int.MaxValue;
            for (int i = 0; i < n; i++)
            {
                if (previous > values[i].Item2)
                {
                    rank++;
                }
                if (values[i].Item1 == 0)
                {
                    return rank;
                }
                previous = values[i].Item2;
            }
            throw new Exception();
        }
        if (x == y)
        {
            return Dfs(grid, x + 1, y, winCounts, n);
        }
        if (grid[y, x] != '-')
        {
            if (x == n - 1)
            {
                return Dfs(grid, 0, y + 1, winCounts, n);
            }
            return Dfs(grid, x + 1, y, winCounts, n);
        }
        int first = 0;
        winCounts[y]++;
        grid[y, x] = 'o';
        grid[x, y] = 'x';
        if (x == n - 1)
        {
            first = Dfs(grid, 0, y + 1, winCounts, n);
        }
        else
        {
            first = Dfs(grid, x + 1, y, winCounts, n);
        }
        winCounts[y]--;
        winCounts[x]++;
        grid[y, x] = 'x';
        grid[x, y] = 'o';
        var second = 0;
        if (x == n - 1)
        {
            second = Dfs(grid, 0, y + 1, winCounts, n);
        }
        else
        {
            second = Dfs(grid, x + 1, y, winCounts, n);
        }
        winCounts[x]--;
        grid[y, x] = '-';
        grid[x, y] = '-';
        return Math.Min(first, second);
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX