#101147 (Java21) No.387 ハンコ

提出ソース
結果

問題	No.387 ハンコ
ユーザー	threepipes_s
提出日時	2016-07-02 04:49:57
言語	Java21 (openjdk 21)
結果	AC
実行時間	1,286 ms / 5,000 ms
コード長	9,595 bytes
コンパイル時間	3,251 ms
コンパイル使用メモリ	94,020 KB
実行使用メモリ	62,236 KB
最終ジャッジ日時	2024-10-12 02:19:16
合計ジャッジ時間	13,572 ms
ジャッジサーバーID （参考情報）	judge4 / judge3
このコードへのチャレンジ
（要ログイン）
テストケース

テストケース表示
入力	結果	実行時間実行使用メモリ
testcase_00	AC	1,217 ms 60,264 KB
testcase_01	AC	1,286 ms 62,236 KB
testcase_02	AC	914 ms 58,036 KB
testcase_03	AC	905 ms 57,892 KB
testcase_04	AC	497 ms 58,008 KB
testcase_05	AC	741 ms 60,948 KB
testcase_06	AC	971 ms 60,376 KB
testcase_07	AC	975 ms 58,508 KB
testcase_08	AC	972 ms 58,692 KB
権限があれば一括ダウンロードができます
ソースコード

raw source code
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.Closeable;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.BitSet;
import java.util.HashMap;
import java.util.List;
import java.util.Random;
import java.util.TreeMap;

public class Main {
	static ContestScanner in;static Writer out;public static void main(String[] args)
	{try{in=new ContestScanner();out=new Writer();Main solve=new Main();solve.solve();
	in.close();out.flush();out.close();}catch(IOException e){e.printStackTrace();}}
	static void dump(int[]a){for(int i=0;i<a.length;i++)out.print(a[i]+" ");out.println();}
	static void dump(int[]a,int n){for(int i=0;i<a.length;i++)out.printf("%"+n+"d ",a[i]);out.println();}
	static void dump(long[]a){for(int i=0;i<a.length;i++)out.print(a[i]+" ");out.println();}
	static void dump(char[]a){for(int i=0;i<a.length;i++)out.print(a[i]);out.println();}
	static long pow(long a,int n){long r=1;while(n>0){if((n&1)==1)r*=a;a*=a;n>>=1;}return r;}
	static String itob(int a,int l){return String.format("%"+l+"s",Integer.toBinaryString(a)).replace(' ','0');}
	static void sort(int[]a){m_sort(a,0,a.length,new int[a.length]);}
	static void sort(int[]a,int l){m_sort(a,0,l,new int[l]);}
	static void sort(int[]a,int l,int[]buf){m_sort(a,0,l,buf);}
	static void sort(int[]a,int s,int l,int[]buf){m_sort(a,s,l,buf);}
	static void m_sort(int[]a,int s,int sz,int[]b)
	{if(sz<7){for(int i=s;i<s+sz;i++)for(int j=i;j>s&&a[j-1]>a[j];j--)swap(a, j, j-1);return;}
	m_sort(a,s,sz/2,b);m_sort(a,s+sz/2,sz-sz/2,b);int idx=s;int l=s,r=s+sz/2;final int le=s+sz/2,re=s+sz;
	while(l<le&&r<re){if(a[l]>a[r])b[idx++]=a[r++];else b[idx++]=a[l++];}
	while(r<re)b[idx++]=a[r++];while(l<le)b[idx++]=a[l++];for(int i=s;i<s+sz;i++)a[i]=b[i];
	} /* qsort(3.5s)<<msort(9.5s)<<<shuffle+qsort(17s)<Arrays.sort(Integer)(20s) */
	static void sort(long[]a){m_sort(a,0,a.length,new long[a.length]);}
	static void sort(long[]a,int l){m_sort(a,0,l,new long[l]);}
	static void sort(long[]a,int l,long[]buf){m_sort(a,0,l,buf);}
	static void sort(long[]a,int s,int l,long[]buf){m_sort(a,s,l,buf);}
	static void m_sort(long[]a,int s,int sz,long[]b)
	{if(sz<7){for(int i=s;i<s+sz;i++)for(int j=i;j>s&&a[j-1]>a[j];j--)swap(a, j, j-1);return;}
	m_sort(a,s,sz/2,b);m_sort(a,s+sz/2,sz-sz/2,b);int idx=s;int l=s,r=s+sz/2;final int le=s+sz/2,re=s+sz;
	while(l<le&&r<re){if(a[l]>a[r])b[idx++]=a[r++];else b[idx++]=a[l++];}
	while(r<re)b[idx++]=a[r++];while(l<le)b[idx++]=a[l++];for(int i=s;i<s+sz;i++)a[i]=b[i];}
	static void swap(long[] a,int i,int j){final long t=a[i];a[i]=a[j];a[j]=t;}
	static void swap(int[] a,int i,int j){final int t=a[i];a[i]=a[j];a[j]=t;}
	static int binarySearchSmallerMax(int[]a,int v)// get maximum index which a[idx]<=v
	{int l=-1,r=a.length-1,s=0;while(l<=r){int m=(l+r)/2;if(a[m]>v)r=m-1;else{l=m+1;s=m;}}return s;}
	static int binarySearchSmallerMax(int[]a,int v,int l,int r)
	{int s=-1;while(l<=r){int m=(l+r)/2;if(a[m]>v)r=m-1;else{l=m+1;s=m;}}return s;}
	void solve() throws NumberFormatException, IOException{
		int n = in.nextInt();
		long[] a = new long[n];
		Bits b = new Bits(n*2-1);
		for(int i=0; i<n; i++) a[i] = (in.nextLong()-1<<32) | i;
		Arrays.sort(a);
		for(int i=0; i<n; i++) if(in.nextInt()==1) b.set(i);
		int idx = 0, cur, pre;
		final long mask = (1L<<32)-1;
		Bits bs = new Bits(n*2-1);
		Bits origin = b.copy();
		Bits ans = new Bits(n*2-1);
		while(idx<n){
			origin.copyTo(b);
			bs.clear();
			pre = 0;
			do{
				cur = (int)(a[idx]&mask);
				b.shiftL(cur-pre);
				bs.or(b);
				pre = cur;
			}while(++idx<n && (a[idx-1]>>32)==(a[idx]>>32));
			ans.xor(bs);
		}
		for(int i=0; i<n*2-1; i++){
			if(ans.get(i)) out.println("ODD");
			else out.println("EVEN");
		}
	}
}

class Bits{
	public static final long MAX_BIT = 1L<<64;
	public static final long MASK = 0xffffffffffffffffL;
	long[] bits;
	final int size;
	final int W = 64;
	final int WB = 6;
	final int WBM = (1<<6)-1;
	// アクセスしうる最大サイズを確保すること
	public Bits(int n){
		size = (n+W-1)/W;
		bits = new long[size];
	}
	
	public Bits(long[] bit){
		size = bit.length;
		bits = bit;
	}
	
	public void and(Bits b){
		for(int i=0; i<size; i++) bits[i] &= b.bits[i];
	}
	
	public void or(Bits b){
		for(int i=0; i<size; i++) bits[i] |= b.bits[i];
	}
	
	public void xor(Bits b){
		for(int i=0; i<size; i++) bits[i] ^= b.bits[i];
	}
	
	public void not(){
		for(int i=0; i<size; i++) bits[i] = ~bits[i];
	}
	
	public void set(int idx){
		bits[idx>>>WB] |= 1L<<(idx & WBM);
	}
	
	public boolean get(int idx){
		return (bits[idx>>>WB] & 1L<<(idx & WBM))!=0;
	}
	
	public void clear(int idx){
		bits[idx>>>WB] &= ~(1L<<(idx & WBM));
	}
	
	public void clear(){
		Arrays.fill(bits, 0);
	}
	
	public int cardinality(){
		int ans = 0;
		for(int i=0; i<size; i++)
			ans += Long.bitCount(bits[i]);
		return ans;
	}
	
	public void shiftL(){
		for(int i=size-1; i>0; i--){
			bits[i] <<= 1;
			bits[i] |= bits[i-1]>>>W-1;
		}
		bits[0] <<= 1;
	}
	
	public void shiftL(int d){
		final int move = d>>WB;
		final int inner = d & WBM;
		for(int i=size-1; i>move; i--){
			if(inner>0){
				bits[i-move] <<= inner;
				bits[i-move] |= bits[i-move-1]>>>W-inner;
			}
			bits[i] = bits[i-move];
		}
		bits[move] = bits[0] << inner;
		for(int i=move-1; i>=0; i--){
			bits[i] = 0;
		}
	}
	
	public void shiftR(){
		for(int i=0; i<size-1; i++){
			bits[i] >>>= 1;
			bits[i] |= bits[i+1]<<W-1;
		}
		bits[size-1] >>>= 1;
	}
	
	public void shiftR(int d){
		final int move = d>>WB;
		final int inner = d & WBM;
		for(int i=0; i<size-move-1; i++){
			if(inner>0){
				bits[i+move] >>>= inner;
				bits[i+move] |= bits[i+move+1]<<W-inner;
			}
			bits[i] = bits[i+move];
		}
		bits[size-move-1] = bits[size-1]>>> inner;
		for(int i=size-move; i<size; i++){
			bits[i] = 0;
		}
	}
	
	public Bits copy(){
		return new Bits(bits.clone());
	}
	
	public void copyTo(Bits b){
		// sizeof(bits) and sizeof(b.bits) must be same
		for(int i=0; i<size; i++) b.bits[i] = bits[i];
	}
	
	public String dump(){
		return String.format("%64s%64s"
				, Long.toBinaryString(bits[1])
				, Long.toBinaryString(bits[0]))
				.replaceAll(" ", "0");
	}
	
	public String toString() {
		StringBuilder sb = new StringBuilder();
		for(int i=0; i<size; i++){
			if(bits[i]==0) continue;
			for(int j=0; j<W; j++){
				if((bits[i]&1L<<j)!=0) sb.append(i*W+j).append(" ");
			}
		}
		return sb.toString();
	}
}


class MultiSet<T> extends HashMap<T, Integer>{
	@Override public Integer get(Object key){return containsKey(key)?super.get(key):0;}
	public void add(T key,int v){put(key,get(key)+v);}
	public void add(T key){put(key,get(key)+1);}
	public void sub(T key){final int v=get(key);if(v==1)remove(key);else put(key,v-1);}
	public MultiSet<T> merge(MultiSet<T> set)
	{MultiSet<T>s,l;if(this.size()<set.size()){s=this;l=set;}else{s=set;l=this;}
	for(Entry<T,Integer>e:s.entrySet())l.add(e.getKey(),e.getValue());return l;}
}
class OrderedMultiSet<T> extends TreeMap<T, Integer>{
	@Override public Integer get(Object key){return containsKey(key)?super.get(key):0;}
	public void add(T key,int v){put(key,get(key)+v);}
	public void add(T key){put(key,get(key)+1);}
	public void sub(T key){final int v=get(key);if(v==1)remove(key);else put(key,v-1);}
	public OrderedMultiSet<T> merge(OrderedMultiSet<T> set)
	{OrderedMultiSet<T>s,l;if(this.size()<set.size()){s=this;l=set;}else{s=set;l=this;}
	while(!s.isEmpty()){l.add(s.firstEntry().getKey(),s.pollFirstEntry().getValue());}return l;}
}
class Pair implements Comparable<Pair>{
	int a,b;final int hash;Pair(int a,int b){this.a=a;this.b=b;hash=(a<<16|a>>16)^b;}
	public boolean equals(Object obj){Pair o=(Pair)(obj);return a==o.a&&b==o.b;}
	public int hashCode(){return hash;}
	public int compareTo(Pair o){if(a!=o.a)return a<o.a?-1:1;else if(b!=o.b)return b<o.b?-1:1;return 0;}
}
class Timer{
	long time;public void set(){time=System.currentTimeMillis();}
	public long stop(){return time=System.currentTimeMillis()-time;}
	public void print(){System.out.println("Time: "+(System.currentTimeMillis()-time)+"ms");}
	@Override public String toString(){return"Time: "+time+"ms";}
}
class Writer extends PrintWriter{
	public Writer(String filename)throws IOException
	{super(new BufferedWriter(new FileWriter(filename)));}
	public Writer()throws IOException{super(System.out);}
}
class ContestScanner implements Closeable{
	private BufferedReader in;private int c=-2;
	public ContestScanner()throws IOException 
	{in=new BufferedReader(new InputStreamReader(System.in));}
	public ContestScanner(String filename)throws IOException
	{in=new BufferedReader(new InputStreamReader(new FileInputStream(filename)));}
	public String nextToken()throws IOException {
		StringBuilder sb=new StringBuilder();
		while((c=in.read())!=-1&&Character.isWhitespace(c));
		while(c!=-1&&!Character.isWhitespace(c)){sb.append((char)c);c=in.read();}
		return sb.toString();
	}
	public String readLine()throws IOException{
		StringBuilder sb=new StringBuilder();if(c==-2)c=in.read();
		while(c!=-1&&c!='\n'&&c!='\r'){sb.append((char)c);c=in.read();}
		return sb.toString();
	}
	public long nextLong()throws IOException,NumberFormatException
	{return Long.parseLong(nextToken());}
	public int nextInt()throws NumberFormatException,IOException
	{return(int)nextLong();}
	public double nextDouble()throws NumberFormatException,IOException 
	{return Double.parseDouble(nextToken());}
	public void close() throws IOException {in.close();}
}
yukicoder

結果

テストケース

ソースコード
