# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
22404 | dried chocochip on Daegu asphalt (#40) | Unifying Values (KRIII5_UV) | C++14 | 500 ms | 7532 KiB |
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 <stdio.h>
#include <map>
using namespace std;
#define MOD 1000000007
typedef long long lli;
map<lli,int> d[10000];
lli a[10000];
int n;
int main() {
scanf("%d",&n);
lli s=0;
for(int i=0;i<n;i++) {
scanf("%lld",&a[i]);
s+=a[i];
d[i][s]=1;
}
map<lli,int>::iterator mi;
for(int i=1;i<n;i++) {
lli sum=0;
for(int j=i;j<n;j++) {
sum+=a[j];
mi=d[i-1].find(sum);
if(mi!=d[i-1].end()) d[j][sum]+=mi->second;
mi=d[j].find(sum);
if(mi!=d[j].end() && mi->second>=MOD) mi->second-=MOD;
}
}
int res=0;
for(map<lli,int>::iterator it=d[n-1].begin();it!=d[n-1].end();it++) {
res+=it->second;
if(res>=MOD) res-=MOD;
}
printf("%d\n",--res);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |