Submission #3391252
Source Code Expand
#include <bits/stdc++.h> #define rep(i,n) for(int i=0;i<n;i++) #define all(x) (x).begin(),(x).end() using namespace std; const int INF=1145141919,MOD=1e9+7; const long long LINF=8931145141919364364,LMOD=998244353; // const int dx[]={1,0,-1,0,1,1,-1,-1},dy[]={0,-1,0,1,1,-1,-1,1}; int main(){ int n; cin>>n; long long a[n]; rep(i,n) cin>>a[i]; int r=0; long long ans=0,sum=0; for(int l=0;l<n;l++){ while(r<n&&(sum+a[r]==(sum^a[r]))){ sum+=a[r]; r++; } // cout<<l<<" "<<r<<" "<<sum<<endl; ans+=r-l; if(l==r) r++; else sum-=a[l]; } cout<<ans<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Xor Sum 2 |
User | ChiyosBigDragon |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 689 Byte |
Status | AC |
Exec Time | 62 ms |
Memory | 1792 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 | 27 ms | 1536 KB |
subtask_1_04.txt | AC | 2 ms | 256 KB |
subtask_1_05.txt | AC | 24 ms | 1152 KB |
subtask_1_06.txt | AC | 24 ms | 768 KB |
subtask_1_07.txt | AC | 2 ms | 256 KB |
subtask_1_08.txt | AC | 21 ms | 896 KB |
subtask_1_09.txt | AC | 26 ms | 1280 KB |
subtask_1_10.txt | AC | 34 ms | 1408 KB |
subtask_1_11.txt | AC | 33 ms | 1536 KB |
subtask_1_12.txt | AC | 50 ms | 1664 KB |
subtask_1_13.txt | AC | 10 ms | 640 KB |
subtask_1_14.txt | AC | 8 ms | 640 KB |
subtask_1_15.txt | AC | 13 ms | 896 KB |
subtask_1_16.txt | AC | 1 ms | 256 KB |
subtask_1_17.txt | AC | 33 ms | 1792 KB |
subtask_1_18.txt | AC | 35 ms | 1792 KB |
subtask_1_19.txt | AC | 43 ms | 1792 KB |
subtask_1_20.txt | AC | 62 ms | 1792 KB |
subtask_1_21.txt | AC | 41 ms | 1792 KB |
subtask_1_22.txt | AC | 52 ms | 1792 KB |
subtask_1_23.txt | AC | 39 ms | 1792 KB |
subtask_1_24.txt | AC | 49 ms | 1792 KB |
subtask_1_25.txt | AC | 41 ms | 1792 KB |
subtask_1_26.txt | AC | 54 ms | 1792 KB |
subtask_1_27.txt | AC | 33 ms | 1792 KB |
subtask_1_28.txt | AC | 33 ms | 1792 KB |
subtask_1_29.txt | AC | 33 ms | 1792 KB |
subtask_1_30.txt | AC | 33 ms | 1792 KB |
subtask_1_31.txt | AC | 33 ms | 1792 KB |
subtask_1_32.txt | AC | 33 ms | 1792 KB |