結果

問題 No.387 ハンコ
ユーザー uwiuwi
提出日時 2016-07-02 00:14:45
言語 Java21
(openjdk 21)
結果
AC  
実行時間 3,012 ms / 5,000 ms
コード長 4,041 bytes
コンパイル時間 4,016 ms
コンパイル使用メモリ 86,520 KB
実行使用メモリ 60,204 KB
最終ジャッジ日時 2024-04-20 06:25:29
合計ジャッジ時間 18,821 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2,865 ms
60,112 KB
testcase_01 AC 3,012 ms
60,204 KB
testcase_02 AC 416 ms
59,920 KB
testcase_03 AC 395 ms
59,752 KB
testcase_04 AC 519 ms
57,336 KB
testcase_05 AC 1,240 ms
60,144 KB
testcase_06 AC 2,098 ms
60,148 KB
testcase_07 AC 385 ms
60,096 KB
testcase_08 AC 391 ms
59,952 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest;

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 N387_2 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		int[] a = na(n);
		int[] b = na(n);
		int[][] g = makeBuckets(a, 100001);
		long[][] stamp = new long[64][(n>>>6)+2];
		for(int i = 0;i < 64;i++){
			for(int j = 0;j < n;j++){
				int k = j+i;
				stamp[i][k>>>6] |= (long)b[j]<<k;
			}
		}
		long[][] canvas = new long[17][(2*n>>>6)+10];
		long[] temp = new long[(2*n>>>6)+10];
		for(int[] row : g){
			if(row.length > 0){
				Arrays.fill(temp, 0);
				for(int x : row){
					int lo = x&63;
					int hi = x>>>6;
					for(int j = 0;j < (n>>>6)+2 && j+hi < temp.length;j++){
						temp[j+hi] |= stamp[lo][j];
					}
				}
				add(canvas, temp);
			}
		}
		for(int i = 0;i < 2*n-1;i++){
			out.println(canvas[0][i>>>6]<<~i<0 ? "ODD" : "EVEN");
		}
	}
	
	public static void add(long[][] m, long[] a)
	{
		for(int i = 0;i < a.length;i++){
			long p = a[i];
			for(int d = 0;d < m.length && p != 0;d++){
				long carry = m[d][i] & p;
				m[d][i] ^= p;
				p = carry;
			}
		}
	}
	
	public static int[][] makeBuckets(int[] a, int sup)
	{
		int n = a.length;
		int[][] bucket = new int[sup+1][];
		int[] bp = new int[sup+1];
		for(int i = 0;i < n;i++)bp[a[i]]++;
		for(int i = 0;i <= sup;i++)bucket[i] = new int[bp[i]];
		for(int i = n-1;i >= 0;i--)bucket[a[i]][--bp[a[i]]] = i;
		return bucket;
	}

	
	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");
	}
	
	public static void main(String[] args) throws Exception { new N387_2().run(); }
	
	private byte[] inbuf = new byte[1024];
	private 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 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[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private int ni()
	{
		int num = 0, 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 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