# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
244821 |
2020-07-05T06:52:20 Z |
NONAME |
Kas (COCI17_kas) |
C++14 |
|
549 ms |
524292 KB |
#include <bits/stdc++.h>
#define dbg(x) cerr << #x << " = " << x << "\n"
#define fast_io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie()
using namespace std;
using ll = long long;
const int fx = -(3e5 + 100);
int n, a[1000], f[500][int(3e5) + 100], total;
int rec(int p, int cur) {
if (p == n)
return (cur == 0) ? 0 : fx;
if (f[p][int(1e5) + cur] != fx)
return f[p][cur];
int res = fx;
res = max(res, max(rec(p + 1, cur),
max(rec(p + 1, cur - a[p]), rec(p + 1, cur + a[p]) + a[p])));
return f[p][int(1e5) + cur] = res;
}
int main() {
fast_io;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
total += a[i];
}
for (int i = 0; i < n; ++i)
for (int j = 0; j <= 3e5; ++j)
f[i][j] = fx;
int res = rec(0, 0);
cout << res + (total - 2 * res) << "\n";
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
12 ms |
12032 KB |
Output is correct |
2 |
Correct |
13 ms |
12032 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
13 ms |
12032 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
12 ms |
12032 KB |
Output is correct |
2 |
Incorrect |
13 ms |
13312 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
14 ms |
14464 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
14 ms |
15616 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
33 ms |
41464 KB |
Output is correct |
2 |
Incorrect |
38 ms |
47360 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
41 ms |
53144 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
341 ms |
235312 KB |
Output is correct |
2 |
Correct |
264 ms |
294008 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
455 ms |
352776 KB |
Output is correct |
2 |
Incorrect |
549 ms |
470136 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
333 ms |
524292 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |