結果

問題 No.946 箱箱箱
ユーザー uwiuwi
提出日時 2019-12-09 02:36:05
言語 Java21
(openjdk 21)
結果
AC  
実行時間 266 ms / 2,000 ms
コード長 3,616 bytes
コンパイル時間 4,238 ms
コンパイル使用メモリ 81,084 KB
実行使用メモリ 56,168 KB
最終ジャッジ日時 2024-06-27 03:06:03
合計ジャッジ時間 15,880 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 54 ms
50,256 KB
testcase_01 AC 54 ms
50,196 KB
testcase_02 AC 55 ms
50,128 KB
testcase_03 AC 239 ms
55,388 KB
testcase_04 AC 254 ms
55,208 KB
testcase_05 AC 54 ms
50,180 KB
testcase_06 AC 240 ms
55,044 KB
testcase_07 AC 230 ms
55,140 KB
testcase_08 AC 235 ms
55,456 KB
testcase_09 AC 206 ms
55,556 KB
testcase_10 AC 235 ms
55,428 KB
testcase_11 AC 54 ms
50,216 KB
testcase_12 AC 220 ms
55,616 KB
testcase_13 AC 232 ms
55,532 KB
testcase_14 AC 244 ms
55,456 KB
testcase_15 AC 241 ms
55,416 KB
testcase_16 AC 242 ms
55,536 KB
testcase_17 AC 231 ms
55,280 KB
testcase_18 AC 243 ms
55,240 KB
testcase_19 AC 247 ms
55,924 KB
testcase_20 AC 57 ms
50,004 KB
testcase_21 AC 219 ms
55,908 KB
testcase_22 AC 249 ms
55,216 KB
testcase_23 AC 240 ms
55,456 KB
testcase_24 AC 228 ms
55,800 KB
testcase_25 AC 252 ms
55,860 KB
testcase_26 AC 234 ms
55,436 KB
testcase_27 AC 234 ms
55,312 KB
testcase_28 AC 241 ms
55,336 KB
testcase_29 AC 238 ms
55,220 KB
testcase_30 AC 243 ms
55,352 KB
testcase_31 AC 231 ms
55,352 KB
testcase_32 AC 235 ms
55,396 KB
testcase_33 AC 228 ms
55,188 KB
testcase_34 AC 229 ms
55,396 KB
testcase_35 AC 250 ms
55,220 KB
testcase_36 AC 253 ms
55,048 KB
testcase_37 AC 237 ms
54,924 KB
testcase_38 AC 245 ms
56,076 KB
testcase_39 AC 252 ms
55,220 KB
testcase_40 AC 266 ms
55,956 KB
testcase_41 AC 227 ms
55,112 KB
testcase_42 AC 244 ms
55,464 KB
testcase_43 AC 246 ms
55,260 KB
testcase_44 AC 236 ms
56,168 KB
testcase_45 AC 254 ms
54,968 KB
testcase_46 AC 242 ms
55,324 KB
testcase_47 AC 53 ms
50,200 KB
testcase_48 AC 53 ms
50,272 KB
testcase_49 AC 53 ms
50,500 KB
testcase_50 AC 55 ms
49,868 KB
testcase_51 AC 53 ms
50,168 KB
testcase_52 AC 52 ms
50,220 KB
testcase_53 AC 53 ms
50,240 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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)); }
}
0