結果

問題 No.670 log は定数
ユーザー ziitaziita
提出日時 2018-03-24 16:10:01
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,777 ms / 4,000 ms
コード長 4,484 bytes
コンパイル時間 2,886 ms
コンパイル使用メモリ 84,500 KB
実行使用メモリ 41,900 KB
最終ジャッジ日時 2024-06-25 03:10:24
合計ジャッジ時間 21,831 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,588 ms
41,900 KB
testcase_01 AC 1,751 ms
41,224 KB
testcase_02 AC 1,611 ms
41,612 KB
testcase_03 AC 1,777 ms
41,900 KB
testcase_04 AC 1,700 ms
41,084 KB
testcase_05 AC 1,734 ms
41,436 KB
testcase_06 AC 1,694 ms
41,884 KB
testcase_07 AC 1,662 ms
41,872 KB
testcase_08 AC 1,662 ms
41,552 KB
testcase_09 AC 1,730 ms
41,248 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;
import java.math.*;
// import java.awt.Point;
 
public class Main {
    InputStream is;
    PrintWriter out;
    String INPUT = "";
 
    long mod = 1_000_000_007;
    long inf = Long.MAX_VALUE;

    long seed;
    int next() {
        seed = seed ^ (seed << 13);
        seed = seed ^ (seed >>> 7);
        seed = seed ^ (seed << 17);
        return (int)(seed >>> 33);
    }
    void solve(){
        int n = ni();
        int q = ni();
        seed = nl();
        for (int i = 0; i < 10000; i++) next();

        int[] a = new int[n];
        for (int i = 0; i < n; i++) a[i] = next();

        Arrays.sort(a);

        int grid_number = 30000;
        int grid_size = (int) ((1l<<31)/grid_number + 1);

        int[] idx = new int[grid_number+1];
        int lower_number = 0;
        for(int i = 0; i <= grid_number; i++){
            idx[i] = lower_number;
            while(lower_number<n && (a[lower_number]/grid_size) == i) lower_number++;
        }

        long sm = 0;
        for(int i = 0; i < q; i++){
            int x = next();
            int grid = x/grid_size;
            int left = idx[grid]-1;
            int right = idx[grid+1];
            while(right-left>1){
                int mid = (left+right)>>1;
                if(a[mid]<x) left = mid;
                else right = mid;
            }
            sm ^= (long) right * i;
        }
        out.println(sm);
    }

    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 Main().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) && 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