結果

問題 No.1091 Range Xor Query
ユーザー OlandOland
提出日時 2020-06-26 20:31:16
言語 Java21
(openjdk 21)
結果
AC  
実行時間 412 ms / 2,000 ms
コード長 6,878 bytes
コンパイル時間 4,274 ms
コンパイル使用メモリ 79,072 KB
実行使用メモリ 50,288 KB
最終ジャッジ日時 2024-07-04 17:43:37
合計ジャッジ時間 15,540 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 46 ms
37,068 KB
testcase_01 AC 46 ms
37,052 KB
testcase_02 AC 46 ms
37,208 KB
testcase_03 AC 182 ms
42,252 KB
testcase_04 AC 296 ms
47,772 KB
testcase_05 AC 335 ms
49,040 KB
testcase_06 AC 109 ms
39,980 KB
testcase_07 AC 361 ms
49,504 KB
testcase_08 AC 380 ms
49,248 KB
testcase_09 AC 244 ms
46,612 KB
testcase_10 AC 336 ms
49,072 KB
testcase_11 AC 373 ms
49,444 KB
testcase_12 AC 317 ms
48,840 KB
testcase_13 AC 412 ms
49,632 KB
testcase_14 AC 348 ms
49,068 KB
testcase_15 AC 368 ms
49,444 KB
testcase_16 AC 304 ms
47,608 KB
testcase_17 AC 395 ms
49,608 KB
testcase_18 AC 145 ms
41,616 KB
testcase_19 AC 197 ms
43,904 KB
testcase_20 AC 406 ms
50,288 KB
testcase_21 AC 232 ms
44,220 KB
testcase_22 AC 386 ms
49,348 KB
testcase_23 AC 364 ms
49,172 KB
testcase_24 AC 384 ms
49,792 KB
testcase_25 AC 406 ms
49,468 KB
testcase_26 AC 376 ms
49,544 KB
testcase_27 AC 399 ms
50,068 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.math.BigDecimal;
import java.util.*;

@SuppressWarnings("unused")
public class Main {
    FastScanner in;
    PrintWriter out;
    final static int MOD = (int)1e9+7;
    
    void solve(){
        int N = in.nextInt(), Q = in.nextInt();
        int[] a = new int[N+2];
        for(int i = 1; i <= N; i++) a[i] = in.nextInt();
        
        int[] L = new int[N+2], R = new int[N+2];
        for(int i = 1; i <= N; i++) L[i] = L[i-1] ^ a[i];
        for(int i = N; i >= 1; i--) R[i] = R[i+1] ^ a[i];
    
        for(int i = 0; i < Q; i++){
            int l = in.nextInt(), r = in.nextInt();
            int ans = L[N] ^ L[l-1] ^ R[r+1];
            out.println(ans);
        }
    }
    
    public static void main(String[] args) {
        new Main().m();
    }
    
    private void m() {
        in = new FastScanner(System.in);
        out = new PrintWriter(System.out);
        /*
        try {
            String path = "input.txt";
            out = new PrintWriter(new BufferedWriter(new FileWriter(new File(path))));
        }catch (IOException e){
            e.printStackTrace();
        }
        */
        solve();
        out.flush();
        in.close();
        out.close();
    }
    
    static class FastScanner {
        private Reader input;
        
        public FastScanner() {this(System.in);}
        public FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}
        public void close() {
            try {
                this.input.close();
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        
        public int nextInt() {
            long nl = nextLong();
            if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
            return (int) nl;
        }
        
        public long nextLong() {
            try {
                int sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                long ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) return ret * sign;
                    ret *= 10;
                    ret += b - '0';
                }
            } catch (IOException e) {
                e.printStackTrace();
                return -1;
            }
        }
        
        public double nextDouble() {
            try {
                double sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                double ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) break;
                    ret *= 10;
                    ret += b - '0';
                }
                if (b != '.') return sign * ret;
                double div = 1;
                b = input.read();
                while ('0' <= b && b <= '9') {
                    ret *= 10;
                    ret += b - '0';
                    div *= 10;
                    b = input.read();
                }
                return sign * ret / div;
            } catch (IOException e) {
                e.printStackTrace();
                return Double.NaN;
            }
        }
        
        public char nextChar() {
            try {
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                return (char) b;
            } catch (IOException e) {
                e.printStackTrace();
                return 0;
            }
        }
        
        public String nextStr() {
            try {
                StringBuilder sb = new StringBuilder();
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                while (b != -1 && !Character.isWhitespace(b)) {
                    sb.append((char) b);
                    b = input.read();
                }
                return sb.toString();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }
        
        public String nextLine() {
            try {
                StringBuilder sb = new StringBuilder();
                int b = input.read();
                while (b != -1 && b != '\n') {
                    sb.append((char) b);
                    b = input.read();
                }
                return sb.toString();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }
        
        public int[] nextIntArray(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt();
            }
            return res;
        }
        
        public int[] nextIntArrayDec(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt() - 1;
            }
            return res;
        }
        
        public int[] nextIntArray1Index(int n) {
            int[] res = new int[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextInt();
            }
            return res;
        }
        
        public long[] nextLongArray(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong();
            }
            return res;
        }
        
        public long[] nextLongArrayDec(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong() - 1;
            }
            return res;
        }
        
        public long[] nextLongArray1Index(int n) {
            long[] res = new long[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextLong();
            }
            return res;
        }
        
        public double[] nextDoubleArray(int n) {
            double[] res = new double[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextDouble();
            }
            return res;
        }
    }
}
0