結果

問題 No.946 箱箱箱
ユーザー uwiuwi
提出日時 2019-12-09 00:56:00
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 3,481 bytes
コンパイル時間 3,997 ms
コンパイル使用メモリ 92,588 KB
実行使用メモリ 51,220 KB
最終ジャッジ日時 2024-06-10 23:03:45
合計ジャッジ時間 8,053 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 54 ms
50,336 KB
testcase_01 WA -
testcase_02 AC 54 ms
50,176 KB
testcase_03 WA -
testcase_04 AC 71 ms
51,084 KB
testcase_05 WA -
testcase_06 AC 73 ms
51,112 KB
testcase_07 AC 52 ms
50,336 KB
testcase_08 AC 53 ms
50,316 KB
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 AC 54 ms
50,300 KB
testcase_13 AC 55 ms
50,444 KB
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 AC 54 ms
50,332 KB
testcase_20 AC 52 ms
50,028 KB
testcase_21 AC 54 ms
50,232 KB
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 AC 52 ms
50,296 KB
testcase_26 WA -
testcase_27 AC 53 ms
50,252 KB
testcase_28 WA -
testcase_29 WA -
testcase_30 AC 52 ms
50,244 KB
testcase_31 WA -
testcase_32 AC 53 ms
49,880 KB
testcase_33 WA -
testcase_34 WA -
testcase_35 WA -
testcase_36 AC 70 ms
51,220 KB
testcase_37 AC 75 ms
51,036 KB
testcase_38 AC 57 ms
50,020 KB
testcase_39 AC 56 ms
50,448 KB
testcase_40 AC 55 ms
50,108 KB
testcase_41 WA -
testcase_42 AC 54 ms
49,832 KB
testcase_43 AC 74 ms
50,904 KB
testcase_44 AC 58 ms
50,264 KB
testcase_45 AC 75 ms
50,928 KB
testcase_46 AC 74 ms
51,220 KB
testcase_47 AC 53 ms
49,876 KB
testcase_48 AC 53 ms
50,236 KB
testcase_49 AC 53 ms
50,268 KB
testcase_50 AC 54 ms
50,540 KB
testcase_51 WA -
testcase_52 AC 54 ms
50,340 KB
testcase_53 WA -
権限があれば一括ダウンロードができます

ソースコード

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.InputMismatchException;

public class D9_2 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		int[] a = na(n);
		int[] cum = new int[n+1];
		for(int i = 0;i < n;i++){
			cum[i+1] ^= a[i];
		}
		for(int i = 0;i <= n;i++){
			for(int j = i+1;j <= n;j++){
				if(cum[i] == cum[j]){
					out.println("Takahashi");
					return;
				}
			}
		}
		out.println("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