# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
572955 | AmirElarbi | Uplifting Excursion (BOI22_vault) | C++14 | 31 ms | 71996 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>
#define vi vector<int>
#define ve vector
#define ll long long
#define vf vector<float>
#define vll vector<pair<ll,ll>>
#define ii pair<int,int>
#define vvi vector<vi>
#define vii vector<ii>
#define gii greater<ii>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF 1e7
#define eps 1e-7
#define eps1 1e-2
#define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define MAX_A 2e5+5
using namespace std;
const int MOD = 1e4+7;
const int nax = 305;
const int nax2 = 30005;
typedef complex<int> Point;
#define X real()
#define Y imag()
int s[nax], dp[nax2*2][nax],m,l;
int solve(int sm, int pos){
if(pos > 2*m){
if(sm == l) return 0;
else return -1;
}
if(dp[sm+nax2][pos] != -1) return dp[sm+nax2][pos];
for (int i = 0; i <= s[pos]; ++i)
{
int a = solve(sm+(pos-m)*i,pos+1);
if(a!=-1) dp[sm+nax2][pos] = max(dp[sm+nax2][pos], solve(sm+(pos-m)*i,pos+1)+ i );
}
return dp[sm+nax2][pos];
}
int main(){
optimise;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
cin >> m >> l;
for (int i = 0; i < 2*m+1; ++i)
{
cin >> s[i];
}
int res = 0;
memset(dp, -1,sizeof dp);
res = solve(0,0);
if(res == -1) cout << "INPOSSIBLE" << endl;
else
cout << res << endl;
}
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... |