Submission #3014326
Source Code Expand
#include<bits/stdc++.h> using namespace std; const int MAX = 2 * 100005; int A[MAX]; int main() { int N; scanf("%d", &N); for (int i = 0; i < N; i++) scanf("%d", &A[i]); int l, r, s, x; l = r = 0; s = x = A[0]; long long ans = 0; while (r < N) { if (s == x) { ans += 1 + r - l; r++; s += A[r]; x ^= A[r]; } else { s -= A[l]; x ^= A[l]; l++; } } printf("%lld\n", ans); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Xor Sum 2 |
User | atumari |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 564 Byte |
Status | AC |
Exec Time | 21 ms |
Memory | 1024 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:9:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &N); ^ ./Main.cpp:10:51: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] for (int i = 0; i < N; i++) scanf("%d", &A[i]); ^
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 | 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 | AC | 1 ms | 256 KB |
subtask_1_03.txt | AC | 13 ms | 896 KB |
subtask_1_04.txt | AC | 1 ms | 256 KB |
subtask_1_05.txt | AC | 10 ms | 640 KB |
subtask_1_06.txt | AC | 8 ms | 512 KB |
subtask_1_07.txt | AC | 2 ms | 256 KB |
subtask_1_08.txt | AC | 9 ms | 512 KB |
subtask_1_09.txt | AC | 12 ms | 768 KB |
subtask_1_10.txt | AC | 14 ms | 768 KB |
subtask_1_11.txt | AC | 15 ms | 896 KB |
subtask_1_12.txt | AC | 20 ms | 1024 KB |
subtask_1_13.txt | AC | 5 ms | 512 KB |
subtask_1_14.txt | AC | 4 ms | 384 KB |
subtask_1_15.txt | AC | 7 ms | 512 KB |
subtask_1_16.txt | AC | 1 ms | 256 KB |
subtask_1_17.txt | AC | 16 ms | 1024 KB |
subtask_1_18.txt | AC | 18 ms | 1024 KB |
subtask_1_19.txt | AC | 18 ms | 1024 KB |
subtask_1_20.txt | AC | 21 ms | 1024 KB |
subtask_1_21.txt | AC | 19 ms | 1024 KB |
subtask_1_22.txt | AC | 20 ms | 1024 KB |
subtask_1_23.txt | AC | 19 ms | 1024 KB |
subtask_1_24.txt | AC | 20 ms | 1024 KB |
subtask_1_25.txt | AC | 19 ms | 1024 KB |
subtask_1_26.txt | AC | 21 ms | 1024 KB |
subtask_1_27.txt | AC | 16 ms | 1024 KB |
subtask_1_28.txt | AC | 16 ms | 1024 KB |
subtask_1_29.txt | AC | 16 ms | 1024 KB |
subtask_1_30.txt | AC | 16 ms | 1024 KB |
subtask_1_31.txt | AC | 16 ms | 1024 KB |
subtask_1_32.txt | AC | 16 ms | 1024 KB |