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;
vector<long long>v;
int m;
long long l, mx = -1;
void rec(long long uplift, int indx, long long cnt){
if(indx > m && uplift > l)return;
if(uplift == l && indx == 2 * m + 1){
mx = max(mx, cnt);
return;
}
else if(indx == 2 * m + 1)return;
for(int i = 0;i <= v[indx];++i){
rec(uplift + i * (indx - m), indx + 1, cnt + i);
}
}
int main()
{
cin >> m >> l;
v.resize(2 * m + 1);
for(int i = 0;i < 2 * m + 1;++i)cin >> v[i];
rec(0, 0, 0);
if(mx == -1)cout << "impossible";
else cout << mx;
}
# | 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... |