# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
701171 | Kipras | Uplifting Excursion (BOI22_vault) | C++17 | 1 ms | 468 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const ll maxN = 51;
ll a[maxN*2+1];
ll dp[maxN^2*2];
int main()
{
ios_base::sync_with_stdio(0);cin.tie(nullptr);
ll m, l;
cin>>m>>l;
fill(dp, dp+(int)(maxN^2*2), 0);
for(int i = 0; i < m*2+1; i++){
cin>>a[i];
}
for(int i = 0; i < m*2+1; i++){
for(int x = 0; x < a[i]; x++){
ll v = i-m;
if(v<0){
for(int z = -min(maxN^2*2+1,l*2); z <= min(maxN^2*2+1,l*2); z++){
if((dp[z-v]!=0||z-v==0))dp[z]=dp[z-v]+1;
}
}
else{
for(int z = min(maxN^2+1,2*l); z >= -min(maxN^2+1,2*l); z--){
if((dp[z-v]!=0||z-v==0))dp[z]=dp[z-v]+1;
}
}
}
}
if(dp[l]>0)cout<<dp[l];
else cout<<"impossible";
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |