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>
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 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... |