# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
577748 | 2022-06-15T08:35:32 Z | patrikpavic2 | Uplifting Excursion (BOI22_vault) | C++17 | 14 ms | 212 KB |
#include <cstdio> #include <algorithm> using namespace std; typedef long long ll; const int M = 32; const int INF = 0x3f3f3f3f; int m; ll L, A[M], kol; int dp[2 * M * M]; int main(){ scanf("%d%lld", &m, &L); for(int i = m;i >= 1;i--){ ll x; scanf("%lld", &x); // A[i] += x; L += x * i; } ll bla; scanf("%lld", &bla); for(int i = 1;i <= m;i++){ ll x; scanf("%lld", &x); A[i] += x; } for(int i = 1;i <= m;i++){ ll ost = min((ll)M * M, A[i]); ll uz = min(A[i] - ost, max(L - M * M, 0LL) / i); kol += uz; L -= uz * i; A[i] = ost; } for(int i = 1;i < M * M + M;i++) dp[i] = -INF; for(int i = 1;i <= m;i++){ for(int j = 0;j < A[i];j++){ for(int k = M * M + M - 1;k >= i;k--) dp[k] = max(dp[k], 1 + dp[k - i]); } } if(L >= 2 * M || dp[L] < 0) printf("impossible\n"); else printf("%lld\n", kol + dp[L] + bla); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Incorrect | 14 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Incorrect | 14 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Incorrect | 14 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Incorrect | 14 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Incorrect | 14 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |