Submission #23003

#TimeUsernameProblemLanguageResultExecution timeMemory
23003cprayerUnifying Values (KRIII5_UV)C++14
0 / 7
500 ms211616 KiB
#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]; if(chk.find(s) == chk.end()){ ans += f(i, s, s, false); chk.insert(s); m.clear(); } ans %= MOD; } printf("%lld", ans); }

Compilation message (stderr)

UV.cpp: In function 'int main()':
UV.cpp:26:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &N);
                    ^
UV.cpp:27:50: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i = 0; i < N; i++) scanf("%d", &A[i]);
                                                  ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...