# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
22526 | dried chocochip on Daegu asphalt (#40) | Unifying Values (KRIII5_UV) | C++11 | 456 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 mi1, mi2;
for(int i=1;i<n;++i) {
lli sum=0;
for(int j=i;j<n;++j) {
sum+=a[j];
mi1=d[i-1].find(sum);
if(mi1!=d[i-1].end()) {
mi2=d[j].find(sum);
if(mi2==d[j].end()) {
d[j][sum]=mi1->second;
mi2=d[j].find(sum);
} else {
mi2->second+=mi1->second;
if(mi2->second>=MOD) mi2->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... |