Submission #3045367
Source Code Expand
#include <iostream> #include <vector> #include <algorithm> int main() { int n, ret = 0; std::cin >> n; std::vector<long long> a(n + 1), s(n + 1), x(n + 1); for (auto i = 1ll; i <= n; i++) { std::cin >> a[i]; s[i] = s[i - 1] + a[i]; x[i] = x[i - 1] ^ a[i]; } auto prev = 2; for (auto i = 1; i <= n; i++) { for (auto r = prev; r <= n; r++) { if (s[r] - s[i - 1] != (x[r] ^ x[i - 1])) { ret += r - i; prev = r; break; } else if (r == n) { ret += n - i + 1; prev = n; } } } std::cout << ret << std::endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Xor Sum 2 |
User | CharlotteL |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 743 Byte |
Status | WA |
Exec Time | 64 ms |
Memory | 4992 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
subtask_1_01.txt | AC | 1 ms | 256 KB |
subtask_1_02.txt | WA | 1 ms | 256 KB |
subtask_1_03.txt | WA | 29 ms | 4096 KB |
subtask_1_04.txt | AC | 2 ms | 384 KB |
subtask_1_05.txt | AC | 25 ms | 2816 KB |
subtask_1_06.txt | AC | 24 ms | 1920 KB |
subtask_1_07.txt | AC | 2 ms | 384 KB |
subtask_1_08.txt | AC | 23 ms | 2048 KB |
subtask_1_09.txt | AC | 27 ms | 3328 KB |
subtask_1_10.txt | AC | 36 ms | 3584 KB |
subtask_1_11.txt | AC | 35 ms | 3968 KB |
subtask_1_12.txt | AC | 52 ms | 4608 KB |
subtask_1_13.txt | AC | 11 ms | 1664 KB |
subtask_1_14.txt | AC | 9 ms | 1280 KB |
subtask_1_15.txt | AC | 14 ms | 2048 KB |
subtask_1_16.txt | AC | 2 ms | 256 KB |
subtask_1_17.txt | WA | 35 ms | 4992 KB |
subtask_1_18.txt | AC | 37 ms | 4992 KB |
subtask_1_19.txt | AC | 46 ms | 4992 KB |
subtask_1_20.txt | AC | 64 ms | 4992 KB |
subtask_1_21.txt | AC | 43 ms | 4992 KB |
subtask_1_22.txt | AC | 56 ms | 4992 KB |
subtask_1_23.txt | AC | 41 ms | 4992 KB |
subtask_1_24.txt | AC | 50 ms | 4992 KB |
subtask_1_25.txt | AC | 43 ms | 4992 KB |
subtask_1_26.txt | AC | 56 ms | 4992 KB |
subtask_1_27.txt | WA | 36 ms | 4992 KB |
subtask_1_28.txt | WA | 35 ms | 4992 KB |
subtask_1_29.txt | WA | 35 ms | 4992 KB |
subtask_1_30.txt | WA | 35 ms | 4992 KB |
subtask_1_31.txt | AC | 35 ms | 4992 KB |
subtask_1_32.txt | AC | 35 ms | 4992 KB |