# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
22353 | 2017-04-30T04:10:03 Z | 크리님 제가 귀여우면 됬지 뭘 더 원하세요 진짜(#952, sys7961, hyorothy, skdudn321) | Unifying Values (KRIII5_UV) | C++11 | 0 ms | 2180 KB |
#include<bits/stdc++.h> using std::pair; std::map<pair<long long, int>, long long> map; const long long MOD = 1000000007; long long arr[10010]; long long sum[10010]; int main() { int n; scanf("%d", &n); for (int i = 1; i <= n; i++) { scanf("%lld", &arr[i]); sum[i] = sum[i - 1] + arr[i]; } long long p = sum[n]; for (int i = 1; i <= n; i++) { if (p%sum[i] == 0) { map[{sum[i], 1}]++; } for (auto q : map) { if (q.first.first*(q.first.second + 1) == sum[i]) { map[{q.first.first, q.first.second + 1}] += q.second; map[{q.first.first, q.first.second + 1}] %= MOD; } } } long long ans = 0; for (auto q : map) { if (q.first.first*q.first.second == p && q.first.second!=1) { ans += q.second; ans %= MOD; } } printf("%lld", ans); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 2180 KB | Output is correct |
2 | Correct | 0 ms | 2180 KB | Output is correct |
3 | Runtime error | 0 ms | 2180 KB | Execution killed with signal 8 (could be triggered by violating memory limits) |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 0 ms | 2180 KB | Execution killed with signal 8 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |