# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
23006 | cprayer | Unifying Values (KRIII5_UV) | C++14 | 500 ms | 205596 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<long long, pair<long long, bool>>, pair<int, bool>> m;
int f(int i, long long current, long long v, bool divide){
auto &res = m[{i, {current, divide}}];
if(i == N - 1){
res.first = current == v && divide ? 1 : 0;
res.second = true;
}
if(res.second) return res.first;
res.second = true;
res.first += f(i + 1, current + A[i + 1], v, divide);
res.first %= MOD;
if(current == v) res.first += f(i + 1, A[i + 1], v, true);
res.first %= MOD;
return res.first;
}
int main(){
scanf("%d", &N);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |