Submission #510211

#TimeUsernameProblemLanguageResultExecution timeMemory
510211khaled_whebeNizin (COCI16_nizin)C++17
80 / 100
270 ms65540 KiB
#include<bits/stdc++.h> #define endl '\n' typedef long long ll; using namespace std; const int N=10000009; ll n,a[N],pre[N],suf[N],ans; set <ll> st; int main() { ios::sync_with_stdio(0);cin.tie(0);cout.tie(0); cin>>n; for (ll i=0;i<n;i++){ cin>>a[i]; } pre[0]=a[0]; st.insert(pre[0]); for (ll i=1;i<n;i++){ pre[i]=pre[i-1]+a[i]; st.insert(pre[i]); } suf [n-1]=a[n-1]; st.insert(suf[n-1]); for (ll i=n-2;i>=0;i--) { suf[i]=suf[i+1]+a[i]; st.insert(suf[i]); } ans=st.size()-n; cout<<ans<<endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...