# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
588650 | 2022-07-03T19:07:21 Z | peuch | Uplifting Excursion (BOI22_vault) | C++17 | 5000 ms | 16424 KB |
#include<bits/stdc++.h> using namespace std; const long long MAXN = 101; const long long INF = 1e18; const long long HALF = MAXN * MAXN * MAXN / 2; long long m; long long l; long long v[2 * MAXN]; long long dp[2][MAXN * MAXN * MAXN]; int main(){ scanf("%lld %lld", &m, &l); long long sum = 0; long long cnt = 0; for(long long i = -m; i <= m; i++){ scanf("%lld", &v[i + m]); sum += v[i + m] * i; cnt += v[i + m]; } if(l + HALF >= MAXN * MAXN * MAXN || l + HALF < 0){ printf("impossible\n"); return 0; } for(long long j = 0; j < MAXN * MAXN * MAXN; j++) dp[1][j] = INF; dp[1][HALF] = 0; for(long long i = 0; i <= 2 * m; i++){ for(long long k = 0; k < v[i]; k++){ swap(dp[1], dp[0]); for(long long j = 0; j < MAXN * MAXN * MAXN; j++){ dp[1][j] = dp[0][j]; if(j - (i - m - 1) < MAXN * MAXN * MAXN && j - (i - m) >= 0) dp[1][j] = min(dp[1][j], dp[0][j - (i - m)] + 1); } } } if(dp[1][sum - l + HALF] == INF) printf("impossible\n"); else printf("%lld\n", cnt - dp[1][sum - l + HALF]); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 39 ms | 16340 KB | Output is correct |
2 | Correct | 40 ms | 16404 KB | Output is correct |
3 | Correct | 25 ms | 16424 KB | Output is correct |
4 | Correct | 187 ms | 16404 KB | Output is correct |
5 | Correct | 0 ms | 212 KB | Output is correct |
6 | Execution timed out | 5050 ms | 16308 KB | Time limit exceeded |
7 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 39 ms | 16340 KB | Output is correct |
2 | Correct | 40 ms | 16404 KB | Output is correct |
3 | Correct | 25 ms | 16424 KB | Output is correct |
4 | Correct | 187 ms | 16404 KB | Output is correct |
5 | Correct | 0 ms | 212 KB | Output is correct |
6 | Execution timed out | 5050 ms | 16308 KB | Time limit exceeded |
7 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 181 ms | 16340 KB | Output is correct |
2 | Incorrect | 1 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 181 ms | 16340 KB | Output is correct |
2 | Incorrect | 1 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 181 ms | 16340 KB | Output is correct |
2 | Incorrect | 1 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 39 ms | 16340 KB | Output is correct |
2 | Correct | 40 ms | 16404 KB | Output is correct |
3 | Correct | 25 ms | 16424 KB | Output is correct |
4 | Correct | 187 ms | 16404 KB | Output is correct |
5 | Correct | 0 ms | 212 KB | Output is correct |
6 | Execution timed out | 5050 ms | 16308 KB | Time limit exceeded |
7 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 181 ms | 16340 KB | Output is correct |
2 | Incorrect | 1 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 39 ms | 16340 KB | Output is correct |
2 | Correct | 40 ms | 16404 KB | Output is correct |
3 | Correct | 25 ms | 16424 KB | Output is correct |
4 | Correct | 187 ms | 16404 KB | Output is correct |
5 | Correct | 0 ms | 212 KB | Output is correct |
6 | Execution timed out | 5050 ms | 16308 KB | Time limit exceeded |
7 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 181 ms | 16340 KB | Output is correct |
2 | Incorrect | 1 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 39 ms | 16340 KB | Output is correct |
2 | Correct | 40 ms | 16404 KB | Output is correct |
3 | Correct | 25 ms | 16424 KB | Output is correct |
4 | Correct | 187 ms | 16404 KB | Output is correct |
5 | Correct | 0 ms | 212 KB | Output is correct |
6 | Execution timed out | 5050 ms | 16308 KB | Time limit exceeded |
7 | Halted | 0 ms | 0 KB | - |