結果

問題 No.946 箱箱箱
ユーザー hiromi_ayasehiromi_ayase
提出日時 2019-12-12 09:54:08
言語 Java19
(openjdk 21)
結果
WA  
実行時間 -
コード長 2,877 bytes
コンパイル時間 5,125 ms
コンパイル使用メモリ 90,948 KB
実行使用メモリ 58,144 KB
最終ジャッジ日時 2023-09-07 01:07:17
合計ジャッジ時間 25,583 ms
ジャッジサーバーID
(参考情報)
judge12 / judge11
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 72 ms
51,540 KB
testcase_01 AC 72 ms
51,220 KB
testcase_02 AC 78 ms
49,620 KB
testcase_03 AC 487 ms
57,408 KB
testcase_04 AC 473 ms
56,968 KB
testcase_05 AC 71 ms
50,896 KB
testcase_06 AC 469 ms
57,492 KB
testcase_07 AC 447 ms
56,968 KB
testcase_08 AC 457 ms
57,356 KB
testcase_09 AC 158 ms
56,604 KB
testcase_10 AC 433 ms
56,476 KB
testcase_11 AC 76 ms
51,888 KB
testcase_12 AC 160 ms
54,224 KB
testcase_13 AC 439 ms
57,244 KB
testcase_14 AC 425 ms
57,544 KB
testcase_15 AC 437 ms
57,488 KB
testcase_16 AC 456 ms
58,144 KB
testcase_17 AC 426 ms
56,936 KB
testcase_18 AC 479 ms
57,660 KB
testcase_19 AC 274 ms
56,920 KB
testcase_20 AC 102 ms
53,904 KB
testcase_21 AC 181 ms
56,400 KB
testcase_22 AC 447 ms
56,872 KB
testcase_23 AC 447 ms
57,156 KB
testcase_24 AC 155 ms
56,004 KB
testcase_25 AC 293 ms
57,188 KB
testcase_26 AC 444 ms
57,192 KB
testcase_27 AC 446 ms
57,032 KB
testcase_28 AC 424 ms
57,040 KB
testcase_29 AC 425 ms
57,304 KB
testcase_30 AC 468 ms
57,400 KB
testcase_31 AC 482 ms
57,088 KB
testcase_32 AC 443 ms
56,868 KB
testcase_33 AC 423 ms
57,968 KB
testcase_34 AC 441 ms
56,804 KB
testcase_35 AC 444 ms
57,156 KB
testcase_36 AC 469 ms
56,916 KB
testcase_37 AC 474 ms
57,124 KB
testcase_38 AC 303 ms
57,012 KB
testcase_39 AC 435 ms
57,732 KB
testcase_40 AC 165 ms
56,304 KB
testcase_41 AC 485 ms
57,172 KB
testcase_42 AC 464 ms
57,056 KB
testcase_43 AC 460 ms
56,972 KB
testcase_44 AC 321 ms
54,924 KB
testcase_45 AC 464 ms
57,448 KB
testcase_46 AC 463 ms
57,616 KB
testcase_47 WA -
testcase_48 WA -
testcase_49 WA -
testcase_50 WA -
testcase_51 AC 70 ms
51,252 KB
testcase_52 WA -
testcase_53 AC 70 ms
51,008 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

import java.util.TreeSet;

public class Main {
  private static void solve() {
    int n = ni();
    int[] a = na(n);

    int[] g = new int[n + 1];
    for (int i = 1; i <= n; i++) {
      TreeSet<Integer> set = new TreeSet<>();
      int x = 0;
      for (int j = 0; j < i; j++) {
        x ^= a[j];
        set.add(x ^ g[i]);
      }
      for (int k = 0; k <= n; k++) {
        if (!set.contains(k)) {
          g[i] = k;
          break;
        }
      }
    }

    System.out.println(g[n] == 0 ? "Takanashi" : "Takahashi");;
  }

  public static void main(String[] args) {
    new Thread(null, new Runnable() {
      @Override
      public void run() {
        long start = System.currentTimeMillis();
        String debug = args.length > 0 ? args[0] : null;
        if (debug != null) {
          try {
            is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
          } catch (Exception e) {
            throw new RuntimeException(e);
          }
        }
        reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
        solve();
        out.flush();
        tr((System.currentTimeMillis() - start) + "ms");
      }
    }, "", 64000000).start();
  }

  private static java.io.InputStream is = System.in;
  private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
  private static java.util.StringTokenizer tokenizer = null;
  private static java.io.BufferedReader reader;

  public static String next() {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      try {
        tokenizer = new java.util.StringTokenizer(reader.readLine());
      } catch (Exception e) {
        throw new RuntimeException(e);
      }
    }
    return tokenizer.nextToken();
  }

  private static double nd() {
    return Double.parseDouble(next());
  }

  private static long nl() {
    return Long.parseLong(next());
  }

  private static int[] na(int n) {
    int[] a = new int[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }

  private static char[] ns() {
    return next().toCharArray();
  }

  private static long[] nal(int n) {
    long[] a = new long[n];
    for (int i = 0; i < n; i++)
      a[i] = nl();
    return a;
  }

  private static int[][] ntable(int n, int m) {
    int[][] table = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[i][j] = ni();
      }
    }
    return table;
  }

  private static int[][] nlist(int n, int m) {
    int[][] table = new int[m][n];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[j][i] = ni();
      }
    }
    return table;
  }

  private static int ni() {
    return Integer.parseInt(next());
  }

  private static void tr(Object... o) {
    if (is != System.in)
      System.out.println(java.util.Arrays.deepToString(o));
  }
}
0