Submission #43734759
Source Code Expand
use proconio::input; fn main() { input! { n: usize, a: [usize; n], }; let mut xor = 0_usize; let mut sum = 0_usize; let mut count = 0_usize; let mut r = 0_usize; for l in 0..n { while (r < n) && (xor ^ a[r] == sum + a[r]) { xor ^= a[r]; sum += a[r]; r += 1; } count += r - l; if r == l { r += 1; } else { xor ^= a[l]; sum -= a[l]; } } let ans = count; println!("{}", ans); }
Submission Info
Submission Time | |
---|---|
Task | D - Xor Sum 2 |
User | bouzuya |
Language | Rust (1.42.0) |
Score | 500 |
Code Size | 552 Byte |
Status | AC |
Exec Time | 23 ms |
Memory | 4684 KiB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 500 / 500 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_28.txt, subtask_1_29.txt, subtask_1_30.txt, subtask_1_31.txt, subtask_1_32.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 6 ms | 2008 KiB |
sample_02.txt | AC | 2 ms | 2040 KiB |
sample_03.txt | AC | 1 ms | 1928 KiB |
subtask_1_01.txt | AC | 2 ms | 2076 KiB |
subtask_1_02.txt | AC | 2 ms | 1912 KiB |
subtask_1_03.txt | AC | 13 ms | 3408 KiB |
subtask_1_04.txt | AC | 2 ms | 2152 KiB |
subtask_1_05.txt | AC | 12 ms | 3212 KiB |
subtask_1_06.txt | AC | 7 ms | 3008 KiB |
subtask_1_07.txt | AC | 1 ms | 2016 KiB |
subtask_1_08.txt | AC | 11 ms | 3020 KiB |
subtask_1_09.txt | AC | 11 ms | 3096 KiB |
subtask_1_10.txt | AC | 12 ms | 3696 KiB |
subtask_1_11.txt | AC | 14 ms | 3672 KiB |
subtask_1_12.txt | AC | 23 ms | 4344 KiB |
subtask_1_13.txt | AC | 5 ms | 2420 KiB |
subtask_1_14.txt | AC | 5 ms | 2364 KiB |
subtask_1_15.txt | AC | 5 ms | 2684 KiB |
subtask_1_16.txt | AC | 2 ms | 2052 KiB |
subtask_1_17.txt | AC | 14 ms | 3804 KiB |
subtask_1_18.txt | AC | 13 ms | 3800 KiB |
subtask_1_19.txt | AC | 13 ms | 4116 KiB |
subtask_1_20.txt | AC | 21 ms | 4684 KiB |
subtask_1_21.txt | AC | 14 ms | 4016 KiB |
subtask_1_22.txt | AC | 21 ms | 4440 KiB |
subtask_1_23.txt | AC | 15 ms | 3960 KiB |
subtask_1_24.txt | AC | 18 ms | 4216 KiB |
subtask_1_25.txt | AC | 19 ms | 4056 KiB |
subtask_1_26.txt | AC | 16 ms | 4408 KiB |
subtask_1_27.txt | AC | 10 ms | 3744 KiB |
subtask_1_28.txt | AC | 14 ms | 3792 KiB |
subtask_1_29.txt | AC | 14 ms | 3836 KiB |
subtask_1_30.txt | AC | 10 ms | 3840 KiB |
subtask_1_31.txt | AC | 10 ms | 3864 KiB |
subtask_1_32.txt | AC | 10 ms | 3788 KiB |