Submission #3009989
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long LL; const int MAXN = 234567; LL presum[MAXN]; LL prexor[MAXN]; int main() { int N; while (~scanf("%d", &N)) { presum[0] = prexor[0] = 0; for (int i = 1; i <= N; i++) { int tmp; scanf("%d", &tmp); presum[i] = presum[i - 1] + tmp; prexor[i] = prexor[i - 1] ^ tmp; } int l = 1; LL ans = 0; for (int i = 1; i <= N; i++) { while ((presum[i] - presum[l - 1]) != (prexor[i] ^ prexor[l - 1])) l++; ans += (i - l + 1); } printf("%lld\n", ans); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Xor Sum 2 |
User | BOT |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 744 Byte |
Status | AC |
Exec Time | 23 ms |
Memory | 3328 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:15:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &tmp); ^
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 | 14 ms | 2816 KB |
subtask_1_04.txt | AC | 2 ms | 256 KB |
subtask_1_05.txt | AC | 11 ms | 1920 KB |
subtask_1_06.txt | AC | 9 ms | 1408 KB |
subtask_1_07.txt | AC | 2 ms | 256 KB |
subtask_1_08.txt | AC | 9 ms | 1536 KB |
subtask_1_09.txt | AC | 13 ms | 2304 KB |
subtask_1_10.txt | AC | 15 ms | 2432 KB |
subtask_1_11.txt | AC | 16 ms | 2688 KB |
subtask_1_12.txt | AC | 21 ms | 3200 KB |
subtask_1_13.txt | AC | 6 ms | 1152 KB |
subtask_1_14.txt | AC | 5 ms | 896 KB |
subtask_1_15.txt | AC | 7 ms | 1408 KB |
subtask_1_16.txt | AC | 1 ms | 256 KB |
subtask_1_17.txt | AC | 17 ms | 3328 KB |
subtask_1_18.txt | AC | 19 ms | 3328 KB |
subtask_1_19.txt | AC | 19 ms | 3328 KB |
subtask_1_20.txt | AC | 22 ms | 3328 KB |
subtask_1_21.txt | AC | 20 ms | 3328 KB |
subtask_1_22.txt | AC | 22 ms | 3328 KB |
subtask_1_23.txt | AC | 20 ms | 3328 KB |
subtask_1_24.txt | AC | 21 ms | 3328 KB |
subtask_1_25.txt | AC | 20 ms | 3328 KB |
subtask_1_26.txt | AC | 23 ms | 3328 KB |
subtask_1_27.txt | AC | 17 ms | 3328 KB |
subtask_1_28.txt | AC | 17 ms | 3328 KB |
subtask_1_29.txt | AC | 17 ms | 3328 KB |
subtask_1_30.txt | AC | 17 ms | 3328 KB |
subtask_1_31.txt | AC | 17 ms | 3328 KB |
subtask_1_32.txt | AC | 17 ms | 3328 KB |