# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
849199 | vjudge1 | Art Collections (BOI22_art) | C++17 | 0 ms | 0 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>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define F first
#define S second
#define endl '\n'
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
const int mod = 1e9 + 7;
const int N = 1e6 + 15;
const ll inf = 1e18;
int dp[2*N];
int32_t main(){
ios_base::sync_with_stdio(0);cin.tie(0);
int n, l;
cin >> n >> l;
vector<int> a(2*n + 1);
vector<int> b;
for (int i=-n;i<=n;i++){
cin >> a[i+n];
int frq = a[i+n];
for (int j=0;j<frq;j++) b.pb(i);
}
dp[N] = 1;// 0
for (int i=0;i<sz(b);i++){
if (b[i] >= 0){
for (int k=2*N;k>=b[i];k--){
if (dp[k-b[i]]) dp[k] = max(dp[k], dp[k-b[i]]+1);
}
}
else {
b[i] = -b[i];
for (int k=0;k+b[i]<2*N;k++){
if (dp[k+b[i]]) dp[k] = max(dp[k], dp[k+b[i]]+1);
}
}
}
if (dp[N+l]) cout << dp[N+l]-1 << endl;
else cout << "impossible\n";
}