# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1038588 | 2024-07-30T02:47:33 Z | 12345678 | Uplifting Excursion (BOI22_vault) | C++17 | 5000 ms | 15964 KB |
#include <bits/stdc++.h> using namespace std; const int nx=2e6+5, c=1e6; #define ll long long ll m, z, p[nx], n[nx], dp[nx], l; int main() { cin.tie(NULL)->sync_with_stdio(false); cin>>m>>l; for (int i=m; i>=1; i--) cin>>n[i]; cin>>z; for (int i=1; i<=m; i++) cin>>p[i]; for (int i=0; i<nx; i++) dp[i]=-1; dp[c]=z; for (int i=1; i<=m; i++) { for (int t=0; t<n[i]; t++) { for (int j=0; j<nx; j++) { if (j+i<nx&&dp[j+i]!=-1) dp[j]=max(dp[j], dp[j+i]+1); } } } for (int i=1; i<=m; i++) { for (int t=0; t<p[i]; t++) { for (int j=nx-1; j>=0; j--) { if (j-i>=0&&dp[j-i]!=-1) dp[j]=max(dp[j], dp[j-i]+1); } } } if (z==0) cout<<1/0; if (l+c<0||l+c>nx||dp[l+c]<1) cout<<"imposslble"; else cout<<dp[l+c]; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 19 ms | 15964 KB | Output is correct |
2 | Incorrect | 15 ms | 15964 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 19 ms | 15964 KB | Output is correct |
2 | Incorrect | 15 ms | 15964 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 83 ms | 15960 KB | Output is correct |
2 | Execution timed out | 5049 ms | 15960 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 83 ms | 15960 KB | Output is correct |
2 | Execution timed out | 5049 ms | 15960 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 83 ms | 15960 KB | Output is correct |
2 | Execution timed out | 5049 ms | 15960 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 19 ms | 15964 KB | Output is correct |
2 | Incorrect | 15 ms | 15964 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 83 ms | 15960 KB | Output is correct |
2 | Execution timed out | 5049 ms | 15960 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 19 ms | 15964 KB | Output is correct |
2 | Incorrect | 15 ms | 15964 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 83 ms | 15960 KB | Output is correct |
2 | Execution timed out | 5049 ms | 15960 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 19 ms | 15964 KB | Output is correct |
2 | Incorrect | 15 ms | 15964 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |