# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
23003 | cprayer | Unifying Values (KRIII5_UV) | C++14 | 500 ms | 211616 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 <cstdio>
#include <algorithm>
#include <set>
#include <map>
using namespace std;
const int MAXN = 1e4 + 9, MOD = 1e9 + 7;
int A[MAXN];
int N;
set<long long> chk;
map<pair<int, pair<long long, bool>>, int> m;
int f(int i, int current, long long v, bool divide){
int &res = m[{i, {current, divide}}];
if(i == N - 1) return current == v && divide ? 1 : 0;
if(res) return res;
res += f(i + 1, current + A[i + 1], v, divide);
res %= MOD;
if(current == v) res += f(i + 1, A[i + 1], v, true);
res %= MOD;
return res;
}
int main(){
scanf("%d", &N);
for(int i = 0; i < N; i++) scanf("%d", &A[i]);
long long ans = 0, s = 0;
for(int i = 0; i < N; i++){
s += A[i];
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |