# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
580392 | 2022-06-21T07:45:42 Z | 조영욱(#8357) | Uplifting Excursion (BOI22_vault) | C++17 | 413 ms | 40200 KB |
#include <bits/stdc++.h> using namespace std; int m; long long l; int dp[102][100001]; const int zero=50000; int arr[102]; int main(void) { scanf("%d %lld",&m,&l); if (l>50000||l<-50000) { printf("impossible"); return 0; } for(int i=1;i<=m*2+1;i++) { scanf("%d",&arr[i]); } for(int i=0;i<=zero*2;i++) { for(int j=0;j<=2*m+1;j++) dp[j][i]=-9e5; } dp[0][zero]=0; for(int i=1;i<=m*2+1;i++) { for(int j=0;j<=zero*2;j++) { for(int k=0;k<=arr[i];k++) { int val=j+k*(i-m-1); if (val>=0&&val<=zero*2) { dp[i][val]=max(dp[i][val],dp[i-1][j]+k); } } } } if (dp[2*m+1][zero+l]<0) { printf("impossible"); return 0; } printf("%d",dp[2*m+1][zero+l]); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 2644 KB | Output is correct |
2 | Correct | 6 ms | 3412 KB | Output is correct |
3 | Correct | 3 ms | 1792 KB | Output is correct |
4 | Correct | 24 ms | 8788 KB | Output is correct |
5 | Correct | 0 ms | 212 KB | Output is correct |
6 | Correct | 413 ms | 40196 KB | Output is correct |
7 | Correct | 195 ms | 40200 KB | Output is correct |
8 | Correct | 397 ms | 40200 KB | Output is correct |
9 | Incorrect | 0 ms | 212 KB | Output isn't correct |
10 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 2644 KB | Output is correct |
2 | Correct | 6 ms | 3412 KB | Output is correct |
3 | Correct | 3 ms | 1792 KB | Output is correct |
4 | Correct | 24 ms | 8788 KB | Output is correct |
5 | Correct | 0 ms | 212 KB | Output is correct |
6 | Correct | 413 ms | 40196 KB | Output is correct |
7 | Correct | 195 ms | 40200 KB | Output is correct |
8 | Correct | 397 ms | 40200 KB | Output is correct |
9 | Incorrect | 0 ms | 212 KB | Output isn't correct |
10 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 20 ms | 8912 KB | Output is correct |
2 | Incorrect | 0 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 20 ms | 8912 KB | Output is correct |
2 | Incorrect | 0 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 20 ms | 8912 KB | Output is correct |
2 | Incorrect | 0 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 2644 KB | Output is correct |
2 | Correct | 6 ms | 3412 KB | Output is correct |
3 | Correct | 3 ms | 1792 KB | Output is correct |
4 | Correct | 24 ms | 8788 KB | Output is correct |
5 | Correct | 0 ms | 212 KB | Output is correct |
6 | Correct | 413 ms | 40196 KB | Output is correct |
7 | Correct | 195 ms | 40200 KB | Output is correct |
8 | Correct | 397 ms | 40200 KB | Output is correct |
9 | Incorrect | 0 ms | 212 KB | Output isn't correct |
10 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 20 ms | 8912 KB | Output is correct |
2 | Incorrect | 0 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 2644 KB | Output is correct |
2 | Correct | 6 ms | 3412 KB | Output is correct |
3 | Correct | 3 ms | 1792 KB | Output is correct |
4 | Correct | 24 ms | 8788 KB | Output is correct |
5 | Correct | 0 ms | 212 KB | Output is correct |
6 | Correct | 413 ms | 40196 KB | Output is correct |
7 | Correct | 195 ms | 40200 KB | Output is correct |
8 | Correct | 397 ms | 40200 KB | Output is correct |
9 | Incorrect | 0 ms | 212 KB | Output isn't correct |
10 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 20 ms | 8912 KB | Output is correct |
2 | Incorrect | 0 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 2644 KB | Output is correct |
2 | Correct | 6 ms | 3412 KB | Output is correct |
3 | Correct | 3 ms | 1792 KB | Output is correct |
4 | Correct | 24 ms | 8788 KB | Output is correct |
5 | Correct | 0 ms | 212 KB | Output is correct |
6 | Correct | 413 ms | 40196 KB | Output is correct |
7 | Correct | 195 ms | 40200 KB | Output is correct |
8 | Correct | 397 ms | 40200 KB | Output is correct |
9 | Incorrect | 0 ms | 212 KB | Output isn't correct |
10 | Halted | 0 ms | 0 KB | - |