結果

問題 No.946 箱箱箱
ユーザー EmKjpEmKjp
提出日時 2019-12-11 21:41:53
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 385 ms / 2,000 ms
コード長 5,243 bytes
コンパイル時間 3,167 ms
コンパイル使用メモリ 106,728 KB
実行使用メモリ 40,144 KB
最終ジャッジ日時 2023-09-09 10:21:45
合計ジャッジ時間 20,407 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 58 ms
20,776 KB
testcase_01 AC 57 ms
20,544 KB
testcase_02 AC 58 ms
22,588 KB
testcase_03 AC 368 ms
38,100 KB
testcase_04 AC 373 ms
38,076 KB
testcase_05 AC 57 ms
20,520 KB
testcase_06 AC 373 ms
35,984 KB
testcase_07 AC 371 ms
38,168 KB
testcase_08 AC 385 ms
38,108 KB
testcase_09 AC 292 ms
38,336 KB
testcase_10 AC 359 ms
38,036 KB
testcase_11 AC 58 ms
22,568 KB
testcase_12 AC 293 ms
36,052 KB
testcase_13 AC 383 ms
36,032 KB
testcase_14 AC 380 ms
36,104 KB
testcase_15 AC 359 ms
36,276 KB
testcase_16 AC 351 ms
36,052 KB
testcase_17 AC 366 ms
38,092 KB
testcase_18 AC 379 ms
38,144 KB
testcase_19 AC 347 ms
36,216 KB
testcase_20 AC 58 ms
20,812 KB
testcase_21 AC 316 ms
38,280 KB
testcase_22 AC 373 ms
36,108 KB
testcase_23 AC 378 ms
38,152 KB
testcase_24 AC 305 ms
38,136 KB
testcase_25 AC 324 ms
38,148 KB
testcase_26 AC 367 ms
40,144 KB
testcase_27 AC 360 ms
35,996 KB
testcase_28 AC 366 ms
38,456 KB
testcase_29 AC 374 ms
34,168 KB
testcase_30 AC 372 ms
36,028 KB
testcase_31 AC 379 ms
34,032 KB
testcase_32 AC 354 ms
36,124 KB
testcase_33 AC 367 ms
38,260 KB
testcase_34 AC 373 ms
38,160 KB
testcase_35 AC 367 ms
36,100 KB
testcase_36 AC 384 ms
38,072 KB
testcase_37 AC 372 ms
36,052 KB
testcase_38 AC 323 ms
38,056 KB
testcase_39 AC 369 ms
38,116 KB
testcase_40 AC 312 ms
36,300 KB
testcase_41 AC 375 ms
38,092 KB
testcase_42 AC 365 ms
38,132 KB
testcase_43 AC 373 ms
36,280 KB
testcase_44 AC 328 ms
36,096 KB
testcase_45 AC 373 ms
38,324 KB
testcase_46 AC 372 ms
38,092 KB
testcase_47 AC 57 ms
20,584 KB
testcase_48 AC 58 ms
20,648 KB
testcase_49 AC 57 ms
20,516 KB
testcase_50 AC 57 ms
20,512 KB
testcase_51 AC 57 ms
20,576 KB
testcase_52 AC 57 ms
18,712 KB
testcase_53 AC 57 ms
18,644 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff # 

using System;
using System.Collections;
using System.Collections.Generic;
using System.Globalization;
using System.IO;
using System.Linq;

using E = System.Linq.Enumerable;

internal partial class Solver {
    public void Run() {
        var n = ni();
        var a = ni(n);

        cout.WriteLine(Solve(n, a) ? "Takahashi" : "Takanashi");
    }

    static private bool Solve(int n, int[] a) {
        var grundy = new int[n];
        for (int i = n - 1; i >= 0; i--) {
            // [i,n) だけの未開封の箱がある場合の grundy 数を求める
            var g = new List<int>();
            var xor = 0;
            for (int j = i; j < n; j++) {
                xor ^= a[j]; // open
                if (j + 1 < n) {
                    g.Add(xor ^ grundy[j + 1]);
                } else {
                    g.Add(xor);
                }
            }
            grundy[i] = Mex(g);
        }
        return grundy[0] > 0;
    }

    private static int Mex(List<int> g) {
        g.Sort();
        int index = 0;
        foreach (int x in g) {
            if (x > index) {
                break;
            }

            if (x == index) {
                index++;
            }
        }
        return index;
    }
}

// PREWRITEN CODE BEGINS FROM HERE
internal partial class Solver : Scanner {
    public static void Main(string[] args) {
#if LOCAL
        byte[] inputBuffer = new byte[1000000];
        var inputStream = Console.OpenStandardInput(inputBuffer.Length);
        using (var reader = new StreamReader(inputStream, Console.InputEncoding, false, inputBuffer.Length)) {
            Console.SetIn(reader);
            new Solver(Console.In, Console.Out).Run();
        }
#else
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver(Console.In, Console.Out).Run();
        Console.Out.Flush();
#endif
    }

#pragma warning disable IDE0052
    private readonly TextReader cin;
    private readonly TextWriter cout;
#pragma warning restore IDE0052

    public Solver(TextReader reader, TextWriter writer)
        : base(reader) {
        cin = reader;
        cout = writer;
    }
    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer) {
    }

#pragma warning disable IDE1006
#pragma warning disable IDE0051
    private int ni() { return NextInt(); }
    private int[] ni(int n) { return NextIntArray(n); }
    private long nl() { return NextLong(); }
    private long[] nl(int n) { return NextLongArray(n); }
    private double nd() { return NextDouble(); }
    private double[] nd(int n) { return NextDoubleArray(n); }
    private string ns() { return Next(); }
    private string[] ns(int n) { return NextArray(n); }
#pragma warning restore IDE1006
#pragma warning restore IDE0051
}

internal static class LinqPadExtension {
    public static T Dump<T>(this T obj) {
#if LOCAL
        return LINQPad.Extensions.Dump(obj);
#else
        return obj;
#endif
    }
}

public class Scanner {
    private readonly TextReader Reader;
    private readonly Queue<string> TokenQueue = new Queue<string>();
    private readonly CultureInfo ci = CultureInfo.InvariantCulture;

    public Scanner()
        : this(Console.In) {
    }

    public Scanner(TextReader reader) {
        Reader = reader;
    }

    public int NextInt() { return int.Parse(Next(), ci); }
    public long NextLong() { return long.Parse(Next(), ci); }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size) {
        string[] array = new string[size];
        for (int i = 0; i < size; i++) {
            array[i] = Next();
        }

        return array;
    }
    public int[] NextIntArray(int size) {
        int[] array = new int[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextInt();
        }

        return array;
    }

    public long[] NextLongArray(int size) {
        long[] array = new long[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextLong();
        }

        return array;
    }

    public double[] NextDoubleArray(int size) {
        double[] array = new double[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextDouble();
        }

        return array;
    }

    public string Next() {
        if (TokenQueue.Count == 0) {
            if (!StockTokens()) {
                throw new InvalidOperationException();
            }
        }
        return TokenQueue.Dequeue();
    }

    public bool HasNext() {
        if (TokenQueue.Count > 0) {
            return true;
        }

        return StockTokens();
    }

    private static readonly char[] _separator = new[] { ' ', '\t' };
    private bool StockTokens() {
        while (true) {
            string line = Reader.ReadLine();
            if (line == null) {
                return false;
            }

            string[] tokens = line.Split(_separator, StringSplitOptions.RemoveEmptyEntries);
            if (tokens.Length == 0) {
                continue;
            }

            foreach (string token in tokens) {
                TokenQueue.Enqueue(token);
            }

            return true;
        }
    }
}
0