Submission #3411811
Source Code Expand
#include <bits/stdc++.h> using namespace std; using ll = long long; using pii = pair<int, int>; int N; int A[200010]; int main() { cin.tie(0); ios_base::sync_with_stdio(false); cout << fixed << setprecision(10); cin >> N; for (int i = 0; i < N; i++) { cin >> A[i]; } int l = 0, r = 0; int tmp = 0; ll ans = 0; while (l < N) { while (r < N && (tmp | A[r]) == tmp + A[r]) { tmp += A[r]; r++; } ans += r - l; tmp -= A[l]; l++; } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Xor Sum 2 |
User | legosuke |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 558 Byte |
Status | AC |
Exec Time | 19 ms |
Memory | 1024 KB |
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 | 11 ms | 896 KB |
subtask_1_04.txt | AC | 1 ms | 256 KB |
subtask_1_05.txt | AC | 9 ms | 640 KB |
subtask_1_06.txt | AC | 7 ms | 512 KB |
subtask_1_07.txt | AC | 1 ms | 256 KB |
subtask_1_08.txt | AC | 8 ms | 512 KB |
subtask_1_09.txt | AC | 11 ms | 768 KB |
subtask_1_10.txt | AC | 13 ms | 768 KB |
subtask_1_11.txt | AC | 17 ms | 896 KB |
subtask_1_12.txt | AC | 18 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 | 6 ms | 512 KB |
subtask_1_16.txt | AC | 1 ms | 256 KB |
subtask_1_17.txt | AC | 13 ms | 1024 KB |
subtask_1_18.txt | AC | 15 ms | 1024 KB |
subtask_1_19.txt | AC | 15 ms | 1024 KB |
subtask_1_20.txt | AC | 18 ms | 1024 KB |
subtask_1_21.txt | AC | 16 ms | 1024 KB |
subtask_1_22.txt | AC | 18 ms | 1024 KB |
subtask_1_23.txt | AC | 16 ms | 1024 KB |
subtask_1_24.txt | AC | 18 ms | 1024 KB |
subtask_1_25.txt | AC | 17 ms | 1024 KB |
subtask_1_26.txt | AC | 19 ms | 1024 KB |
subtask_1_27.txt | AC | 13 ms | 1024 KB |
subtask_1_28.txt | AC | 13 ms | 1024 KB |
subtask_1_29.txt | AC | 14 ms | 1024 KB |
subtask_1_30.txt | AC | 13 ms | 1024 KB |
subtask_1_31.txt | AC | 13 ms | 1024 KB |
subtask_1_32.txt | AC | 14 ms | 1024 KB |