結果

問題 No.1863 Xor Sum 2...?
ユーザー shojin_proshojin_pro
提出日時 2022-03-04 23:24:51
言語 Java21
(openjdk 21)
結果
AC  
実行時間 285 ms / 2,000 ms
コード長 3,808 bytes
コンパイル時間 2,605 ms
コンパイル使用メモリ 78,920 KB
実行使用メモリ 46,908 KB
最終ジャッジ日時 2024-07-18 21:57:23
合計ジャッジ時間 9,170 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 52 ms
36,820 KB
testcase_01 AC 51 ms
37,216 KB
testcase_02 AC 53 ms
37,096 KB
testcase_03 AC 51 ms
37,156 KB
testcase_04 AC 51 ms
37,056 KB
testcase_05 AC 139 ms
42,108 KB
testcase_06 AC 115 ms
40,268 KB
testcase_07 AC 172 ms
43,288 KB
testcase_08 AC 184 ms
44,052 KB
testcase_09 AC 227 ms
46,296 KB
testcase_10 AC 220 ms
45,652 KB
testcase_11 AC 193 ms
44,436 KB
testcase_12 AC 169 ms
43,156 KB
testcase_13 AC 202 ms
45,480 KB
testcase_14 AC 234 ms
45,692 KB
testcase_15 AC 219 ms
45,736 KB
testcase_16 AC 211 ms
44,768 KB
testcase_17 AC 173 ms
44,464 KB
testcase_18 AC 135 ms
42,476 KB
testcase_19 AC 166 ms
44,388 KB
testcase_20 AC 219 ms
44,716 KB
testcase_21 AC 218 ms
45,764 KB
testcase_22 AC 159 ms
43,476 KB
testcase_23 AC 257 ms
46,640 KB
testcase_24 AC 277 ms
46,340 KB
testcase_25 AC 266 ms
46,908 KB
testcase_26 AC 285 ms
46,788 KB
testcase_27 AC 262 ms
46,328 KB
testcase_28 AC 257 ms
46,800 KB
testcase_29 AC 262 ms
46,596 KB
testcase_30 AC 255 ms
46,528 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