| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 721947 | OttincaM | Uplifting Excursion (BOI22_vault) | 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 <iostream>
#include <vector>
#include "stdio.h"
using namespace std;
// #define int long long
long long const LLINF = 1e9 +z;
int const N = (10000 * 101) / 2 + 9;
int const ZER = 300000;
signed main(){
ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
#ifdef WTF
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("error.txt", "w", stderr);
#endif
int m;
long long l; cin >> m >> l;
int smn = 0, smf = 0;
if (l >= N || l < -N){
cout << "impossible\n";
return 0;
}
vector <int> a(2 * m + 2), x, y, z;
for(int i = 1; i <= 2 * m + 1; i ++){
cin >> a[i];
int K = a[i];
while(K --){
if(i - 1 - m >= 0){
x.push_back(i - 1 - m);
smn += i - 1 - m;
} else if(i - 1 - m < 0){
y.push_back(-(i - 1 - m));
smf += i - 1 - m;
} else {
z.push_back(i - 1 - m);
}
}
}
vector <int> dp1(N, -LLINF), dp2(N, -LLINF);
dp1[0] = 0;
dp2[0] = 0;
for(int k: x){
for(int i = N - 1; i >= k; i --){
dp1[i] = max(dp1[i], dp1[i - k] + 1);
}
}
// for(int i = 0; i < N; i ++){
// cout << dp1[i] << " ";
// }
// cout << "\n";
for(int k: y){
for(int i = N - 1; i >= k; i --){
dp2[i] = max(dp2[i], dp2[i - k] + 1);
}
}
long long ans = -LLINF;
if(l >= 0){
for(int i = l; i < N; i ++){
int j = i - l;
ans = max(ans, dp1[i] + dp2[j]);
}
} else {
l = -l;
for(int i = l; i < N; i ++){
int j = i - l;
ans = max(ans, dp2[i] + dp1[j]);
}
}
if(ans < 0){
cout << "impossible\n";
} else {
cout << ans << "\n";
}
return 0;
}