結果

問題 No.1863 Xor Sum 2...?
ユーザー shojin_proshojin_pro
提出日時 2022-03-04 23:24:51
言語 Java21
(openjdk 21)
結果
AC  
実行時間 278 ms / 2,000 ms
コード長 3,808 bytes
コンパイル時間 2,603 ms
コンパイル使用メモリ 74,860 KB
実行使用メモリ 58,876 KB
最終ジャッジ日時 2023-09-26 02:38:52
合計ジャッジ時間 9,842 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 45 ms
50,044 KB
testcase_01 AC 46 ms
49,552 KB
testcase_02 AC 45 ms
49,788 KB
testcase_03 AC 46 ms
49,636 KB
testcase_04 AC 45 ms
49,700 KB
testcase_05 AC 141 ms
55,472 KB
testcase_06 AC 113 ms
52,404 KB
testcase_07 AC 181 ms
55,968 KB
testcase_08 AC 160 ms
55,528 KB
testcase_09 AC 235 ms
56,332 KB
testcase_10 AC 221 ms
56,316 KB
testcase_11 AC 207 ms
55,960 KB
testcase_12 AC 179 ms
56,064 KB
testcase_13 AC 213 ms
56,200 KB
testcase_14 AC 213 ms
56,244 KB
testcase_15 AC 210 ms
56,612 KB
testcase_16 AC 213 ms
56,268 KB
testcase_17 AC 179 ms
55,396 KB
testcase_18 AC 128 ms
55,200 KB
testcase_19 AC 161 ms
55,204 KB
testcase_20 AC 213 ms
56,396 KB
testcase_21 AC 223 ms
56,812 KB
testcase_22 AC 149 ms
56,104 KB
testcase_23 AC 237 ms
56,968 KB
testcase_24 AC 272 ms
58,368 KB
testcase_25 AC 274 ms
58,632 KB
testcase_26 AC 254 ms
58,252 KB
testcase_27 AC 272 ms
58,564 KB
testcase_28 AC 266 ms
58,748 KB
testcase_29 AC 278 ms
58,876 KB
testcase_30 AC 266 ms
58,552 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*;
import java.io.*;

public class Main {
    static FastScanner sc = new FastScanner(System.in);
    static PrintWriter pw = new PrintWriter(System.out);
    static StringBuilder sb = new StringBuilder();
    static long mod = (long) 1e9 + 7;

    public static void main(String[] args) throws Exception {
        solve();
        pw.flush();
    }

    public static void solve() {
        int N = sc.nextInt();
        int[] A = sc.nextIntArray(N);
        int[] B = sc.nextIntArray(N);
        int l = 0, r = 0;
        long as = 0;
        int bl = 0, br = 0;
        int b01[] = {1, 0};
        long ans = 0;
        while (l < N) {
            while (r < N) {
                if ((as + A[r]) != (as ^ A[r])) break;
                as += A[r];
                br ^= B[r]; b01[br]++;
                r++;
            }
            ans += b01[bl] - 1;
            as -= A[l];
            b01[bl]--;
            bl ^= B[l];
            l++;
        }
        pw.println(ans);
    }

    static class GeekInteger {
        public static void save_sort(int[] array) {
            shuffle(array);
            Arrays.sort(array);
        }

        public static int[] shuffle(int[] array) {
            int n = array.length;
            Random random = new Random();
            for (int i = 0, j; i < n; i++) {
                j = i + random.nextInt(n - i);
                int randomElement = array[j];
                array[j] = array[i];
                array[i] = randomElement;
            }
            return array;
        }

        public static void save_sort(long[] array) {
            shuffle(array);
            Arrays.sort(array);
        }

        public static long[] shuffle(long[] array) {
            int n = array.length;
            Random random = new Random();
            for (int i = 0, j; i < n; i++) {
                j = i + random.nextInt(n - i);
                long randomElement = array[j];
                array[j] = array[i];
                array[i] = randomElement;
            }
            return array;
        }

    }
}

class FastScanner {
    private BufferedReader reader = null;
    private StringTokenizer tokenizer = null;

    public FastScanner(InputStream in) {
        reader = new BufferedReader(new InputStreamReader(in));
        tokenizer = null;
    }

    public FastScanner(FileReader in) {
        reader = new BufferedReader(in);
        tokenizer = null;
    }

    public String next() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

    public String nextLine() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                return reader.readLine();
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken("\n");
    }

    public long nextLong() {
        return Long.parseLong(next());
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }

    public double nextDouble() {
        return Double.parseDouble(next());
    }

    public String[] nextArray(int n) {
        String[] a = new String[n];
        for (int i = 0; i < n; i++)
            a[i] = next();
        return a;
    }

    public int[] nextIntArray(int n) {
        int[] a = new int[n];
        for (int i = 0; i < n; i++)
            a[i] = nextInt();
        return a;
    }

    public long[] nextLongArray(int n) {
        long[] a = new long[n];
        for (int i = 0; i < n; i++)
            a[i] = nextLong();
        return a;
    }
}
0