結果

問題 No.670 log は定数
ユーザー uwiuwi
提出日時 2018-03-23 22:57:10
言語 Java21
(openjdk 21)
結果
AC  
実行時間 871 ms / 4,000 ms
コード長 4,375 bytes
コンパイル時間 4,476 ms
コンパイル使用メモリ 83,604 KB
実行使用メモリ 55,140 KB
最終ジャッジ日時 2024-06-24 22:35:09
合計ジャッジ時間 13,417 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 844 ms
54,768 KB
testcase_01 AC 847 ms
54,184 KB
testcase_02 AC 809 ms
54,352 KB
testcase_03 AC 864 ms
55,140 KB
testcase_04 AC 812 ms
54,268 KB
testcase_05 AC 850 ms
54,204 KB
testcase_06 AC 815 ms
54,444 KB
testcase_07 AC 859 ms
54,292 KB
testcase_08 AC 825 ms
54,300 KB
testcase_09 AC 871 ms
54,564 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest180323;
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 E2 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
     long seed;
     int next() {
    	 seed ^= seed<<13;
    	 seed ^= seed>>>7;
    	 seed ^= seed<<17;
        return (int)(seed >>> 33);
    }
	
	void solve()
	{
		int n = ni(), Q = ni();
		seed = ni();
		for(int i = 0;i < 10000;i++)next();
		
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = next();
		
		a = radixSort(a);
		int B = 12;
		int[] u = new int[(1<<31-B)+1];
		for(int i = 0;i < n;i++){
			u[(a[i]>>>B)+1]++;
		}
		for(int i = 1;i <= 1<<31-B;i++){
			u[i] += u[i-1];
		}
		
		long sm = 0;
		for(int i = 0;i < Q;i++){
			int x = next();
			int low = u[x>>>B]-1, high = u[(x>>>B)+1];
			while(high-low > 1){
				int h = high+low>>>1;
				if(a[h] >= x){
					high = h;
				}else{
					low = h;
				}
			}
			sm ^= (long)high * i;
		}
		out.println(sm);
	}
	
	public static int[] radixSort(int[] f){ return radixSort(f, f.length); }
	public static int[] radixSort(int[] f, int n)
	{
		int[] to = new int[n];
		{
			int[] b = new int[65537];
			for(int i = 0;i < n;i++)b[1+(f[i]&0xffff)]++;
			for(int i = 1;i <= 65536;i++)b[i]+=b[i-1];
			for(int i = 0;i < n;i++)to[b[f[i]&0xffff]++] = f[i];
			int[] d = f; f = to;to = d;
		}
		{
			int[] b = new int[65537];
			for(int i = 0;i < n;i++)b[1+(f[i]>>>16)]++;
			for(int i = 1;i <= 65536;i++)b[i]+=b[i-1];
			for(int i = 0;i < n;i++)to[b[f[i]>>>16]++] = f[i];
			int[] d = f; f = to;to = d;
		}
		return f;
	}


	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 E2().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