This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define endl '\n'
typedef long long ll;
using namespace std;
const int N=555555;
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 time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |