Submission #714330

#TimeUsernameProblemLanguageResultExecution timeMemory
714330vjudge1Uplifting Excursion (BOI22_vault)C++17
0 / 100
139 ms792 KiB
#include<bits/stdc++.h> using namespace std; int res[64750]; int main () { for(int i = 0;i<64750;i++)res[i]=-2e9; res[0]=0; long long m, l; cin >> m >> l; long long a[2*m+1]; for(int i = 0;i<=2*m;i++) { cin >> a[i]; } if(l>=64750) { cout << "impossible\n"; return 0; } for(int i = m+1;i<=2*m;i++) { for(int cnt=1;cnt<=a[i];cnt++) { for(int j = 64750-1;j>=(i-m);j--) { res[j]=max(res[j], res[j-(i-m)]+1); } } } for(int i = 0;i<=m-1;i++) { for(int cnt=1;cnt<=a[i];cnt++) { for(int j = 0;j<64750;j++) { if((j-(i-m))<64750)res[j]=max(res[j], res[j-(i-m)]+1); } } } res[l]+=a[m]; if(res[l]<0)cout<<"impossible\n"; else cout << (res[l]) << "\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...