結果
問題 | No.946 箱箱箱 |
ユーザー | uwi |
提出日時 | 2019-12-09 02:36:05 |
言語 | Java19 (openjdk 21) |
結果 |
AC
|
実行時間 | 269 ms / 2,000 ms |
コード長 | 3,616 bytes |
コンパイル時間 | 4,026 ms |
コンパイル使用メモリ | 86,836 KB |
実行使用メモリ | 56,468 KB |
最終ジャッジ日時 | 2023-09-09 09:57:16 |
合計ジャッジ時間 | 16,907 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 41 ms
49,316 KB |
testcase_01 | AC | 41 ms
49,296 KB |
testcase_02 | AC | 42 ms
49,448 KB |
testcase_03 | AC | 240 ms
55,184 KB |
testcase_04 | AC | 245 ms
54,836 KB |
testcase_05 | AC | 42 ms
49,296 KB |
testcase_06 | AC | 243 ms
55,144 KB |
testcase_07 | AC | 235 ms
55,060 KB |
testcase_08 | AC | 238 ms
55,132 KB |
testcase_09 | AC | 210 ms
55,392 KB |
testcase_10 | AC | 247 ms
55,168 KB |
testcase_11 | AC | 44 ms
47,960 KB |
testcase_12 | AC | 211 ms
55,448 KB |
testcase_13 | AC | 239 ms
55,480 KB |
testcase_14 | AC | 241 ms
55,508 KB |
testcase_15 | AC | 238 ms
55,016 KB |
testcase_16 | AC | 241 ms
55,304 KB |
testcase_17 | AC | 242 ms
55,072 KB |
testcase_18 | AC | 244 ms
55,188 KB |
testcase_19 | AC | 269 ms
56,468 KB |
testcase_20 | AC | 48 ms
47,860 KB |
testcase_21 | AC | 225 ms
56,076 KB |
testcase_22 | AC | 252 ms
55,440 KB |
testcase_23 | AC | 242 ms
55,204 KB |
testcase_24 | AC | 212 ms
56,004 KB |
testcase_25 | AC | 244 ms
55,944 KB |
testcase_26 | AC | 239 ms
55,400 KB |
testcase_27 | AC | 236 ms
55,296 KB |
testcase_28 | AC | 234 ms
55,224 KB |
testcase_29 | AC | 243 ms
55,440 KB |
testcase_30 | AC | 238 ms
55,104 KB |
testcase_31 | AC | 252 ms
55,060 KB |
testcase_32 | AC | 230 ms
54,916 KB |
testcase_33 | AC | 256 ms
55,232 KB |
testcase_34 | AC | 236 ms
55,076 KB |
testcase_35 | AC | 237 ms
55,240 KB |
testcase_36 | AC | 269 ms
55,232 KB |
testcase_37 | AC | 242 ms
54,980 KB |
testcase_38 | AC | 244 ms
55,404 KB |
testcase_39 | AC | 258 ms
55,508 KB |
testcase_40 | AC | 215 ms
56,024 KB |
testcase_41 | AC | 226 ms
55,108 KB |
testcase_42 | AC | 246 ms
55,420 KB |
testcase_43 | AC | 246 ms
55,080 KB |
testcase_44 | AC | 261 ms
56,356 KB |
testcase_45 | AC | 245 ms
55,028 KB |
testcase_46 | AC | 246 ms
54,920 KB |
testcase_47 | AC | 41 ms
47,336 KB |
testcase_48 | AC | 41 ms
49,524 KB |
testcase_49 | AC | 41 ms
49,404 KB |
testcase_50 | AC | 41 ms
49,340 KB |
testcase_51 | AC | 40 ms
49,308 KB |
testcase_52 | AC | 41 ms
49,372 KB |
testcase_53 | AC | 43 ms
49,344 KB |
ソースコード
package adv2019; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.HashSet; import java.util.InputMismatchException; import java.util.Set; public class D9_2 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(); int[] a = na(n); int[] dp = new int[n+1]; for(int i = 0;i <= n;i++){ int v = 0; Set<Integer> set = new HashSet<>(); for(int k = 1;k <= i;k++){ v ^= a[n-1-i+k]; set.add(v ^ dp[i-k]); } for(int j = 0;;j++){ if(!set.contains(j)){ dp[i] = j; break; } } } out.println(dp[n] != 0 ? "Takahashi" : "Takanashi"); } public static void tf(boolean[]... b) { for(boolean[] r : b) { for(boolean x : r)System.out.print(x?'#':'.'); System.out.println(); } System.out.println(); } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new D9_2().run(); } private byte[] inbuf = new byte[1024]; public int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }