#include <bits/stdc++.h>
#include <bits/extc++.h>
#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define pf(a) push_front(a)
#define ef(a) emplace_front(a)
#define pob pop_back()
#define pof pop_front()
#define mp(a, b) make_pair(a, b)
#define F first
#define S second
#define mt make_tuple
#define gt(t, i) get<i>(t)
#define tomax(a, b) ((a) = max((a), (b)))
#define tomin(a, b) ((a) = min((a), (b)))
#define topos(a) ((a) = (((a) % MOD + MOD) % MOD))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define printv(a, b) {bool pvaspace=false; \
for(auto pva : a){ \
if(pvaspace) b << " "; pvaspace=true;\
b << pva;\
}\
b << "\n";}
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#include <bits/stdc++.h>
#include <bits/extc++.h>
#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define pf(a) push_front(a)
#define ef(a) emplace_front(a)
#define pob pop_back()
#define pof pop_front()
#define mp(a, b) make_pair(a, b)
#define F first
#define S second
#define mt make_tuple
#define gt(t, i) get<i>(t)
#define tomax(a, b) ((a) = max((a), (b)))
#define tomin(a, b) ((a) = min((a), (b)))
#define topos(a) ((a) = (((a) % MOD + MOD) % MOD))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define printv(a, b) {bool pvaspace=false; \
for(auto pva : a){ \
if(pvaspace) b << " "; pvaspace=true;\
b << pva;\
}\
b << "\n";}
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
using tiii = tuple<int, int, int>;
const ll MOD = 1000000007;
const ll MAX = 1LL << 60;
template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
return o << '(' << p.F << ',' << p.S << ')';
}
ll ifloor(ll a, ll b){
if(b < 0) a *= -1, b *= -1;
if(a < 0) return (a - b + 1) / b;
else return a / b;
}
ll iceil(ll a, ll b){
if(b < 0) a *= -1, b *= -1;
if(a > 0) return (a + b - 1) / b;
else return a / b;
}
int M;
int S;
ll L;
vector<ll> dp;
void waassert(bool t){
return;
if(t) return;
cout << "OAO\n";
exit(0);
}
void upd_pos(int sz, ll cnt, int t){
if(cnt == 0) return;
//assert(sz > 0 && cnt > 0);
vector<deque<pll>> dq(sz);
for(int i = 0; i <= 2 * S; i++){
int id = i % sz;
while(!dq[id].empty() && dq[id].front().F / sz < i / sz - cnt) dq[id].pof;
if(dp[i] != -MAX){
ll tmp = dp[i] - i / sz * t;
while(!dq[id].empty() && dq[id].back().S <= tmp) dq[id].pob;
dq[id].eb(mp(i, tmp));
}
if(!dq[id].empty()){
dp[i] = max(dp[i], dq[id].front().S + i / sz * t);
}
}
/*cerr << "upd_pos " << sz << " " << cnt << "\n";
printv(dp, cerr);*/
}
void upd_neg(int sz, ll cnt, int t){
if(cnt == 0) return;
//assert(sz > 0 && cnt > 0);
vector<deque<pll>> dq(sz);
for(int i = 2 * S; i >= 0; i--){
int id = i % sz;
while(!dq[id].empty() && dq[id].front().F / sz > i / sz + cnt) dq[id].pof;
if(dp[i] != -MAX){
ll tmp = dp[i] + i / sz * t;
while(!dq[id].empty() && dq[id].back().S <= tmp) dq[id].pob;
dq[id].eb(mp(i, tmp));
}
if(!dq[id].empty()){
dp[i] = max(dp[i], dq[id].front().S - i / sz * t);
}
}
/*cerr << "upd_neg " << sz << " " << cnt << "\n";
printv(dp, cerr);*/
}
int main(){
StarBurstStream
cin >> M;
cin >> L;
ll sum = 0;
ll total = 0;
vector<ll> _a(2 * M + 1), _b(2 * M + 1);
function<ll&(int)> a = [&](int x) -> ll&{
waassert(M + x >= 0 && M + x <= 2 * M);
return _a[M + x];
};
function<ll&(int)> b = [&](int x) -> ll&{
waassert(M + x >= 0 && M + x <= 2 * M);
return _b[M + x];
};
ll pos = 0, neg = 0;
for(int i = -M; i <= M; i++){
cin >> a(i);
sum += a(i) * i;
if(i < 0) neg += i * a(i);
else pos += i * a(i);
}
if(sum <= L){
for(int i = -M; i < 0; i++){
swap(a(i), a(-i));
}
L = -L;
}
int p = -M - 1;
sum = 0;
for(int i = -M; i <= M; i++){
sum += a(i) * i;
if(sum <= L) p = i;
}
sum = 0;
for(int i = -M; i <= p; i++){
sum += a(i) * i;
b(i) = a(i);
total += b(i);
}
if(p < M){
b(p + 1) = (L - sum) / (p + 1);
sum += b(p + 1) * (p + 1);
total += b(p + 1);
}
//total = a(0);
/*cerr << "test " << sum << " " << L << " " << L - sum << "\n";
printv(_a, cerr);
printv(_b, cerr);*/
S = max({pos, -neg, (ll)M * M});
dp.resize(2 * S + 1, -MAX);
//assert(pos <= S && -neg <= S);
dp[S] = 0;
//printv(dp, cerr);
for(int i = -M; i <= M; i++){
if(i == 0) continue;
if(i < 0){
upd_pos(-i, b(i), -1);
upd_neg(-i, a(i) - b(i), 1);
}
else{
upd_pos(i, a(i) - b(i), 1);
upd_neg(i, b(i), -1);
}
}
ll ans = L - sum > S || L - sum < -S ? -MAX : dp[S + L - sum];
ans += total;
if(ans < 0) cout << "impossible\n";
else cout << ans << "\n";
return 0;
}
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
using tiii = tuple<int, int, int>;
const ll MOD = 1000000007;
const ll MAX = 1LL << 60;
template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
return o << '(' << p.F << ',' << p.S << ')';
}
ll ifloor(ll a, ll b){
if(b < 0) a *= -1, b *= -1;
if(a < 0) return (a - b + 1) / b;
else return a / b;
}
ll iceil(ll a, ll b){
if(b < 0) a *= -1, b *= -1;
if(a > 0) return (a + b - 1) / b;
else return a / b;
}
int M;
int S;
ll L;
vector<ll> dp;
void waassert(bool t){
return;
if(t) return;
cout << "OAO\n";
exit(0);
}
void upd_pos(int sz, ll cnt, int t){
if(cnt == 0) return;
//assert(sz > 0 && cnt > 0);
vector<deque<pll>> dq(sz);
for(int i = 0; i <= 2 * S; i++){
int id = i % sz;
while(!dq[id].empty() && dq[id].front().F / sz < i / sz - cnt) dq[id].pof;
if(dp[i] != -MAX){
ll tmp = dp[i] - i / sz * t;
while(!dq[id].empty() && dq[id].back().S <= tmp) dq[id].pob;
dq[id].eb(mp(i, tmp));
}
if(!dq[id].empty()){
dp[i] = max(dp[i], dq[id].front().S + i / sz * t);
}
}
/*cerr << "upd_pos " << sz << " " << cnt << "\n";
printv(dp, cerr);*/
}
void upd_neg(int sz, ll cnt, int t){
if(cnt == 0) return;
//assert(sz > 0 && cnt > 0);
vector<deque<pll>> dq(sz);
for(int i = 2 * S; i >= 0; i--){
int id = i % sz;
while(!dq[id].empty() && dq[id].front().F / sz > i / sz + cnt) dq[id].pof;
if(dp[i] != -MAX){
ll tmp = dp[i] + i / sz * t;
while(!dq[id].empty() && dq[id].back().S <= tmp) dq[id].pob;
dq[id].eb(mp(i, tmp));
}
if(!dq[id].empty()){
dp[i] = max(dp[i], dq[id].front().S - i / sz * t);
}
}
/*cerr << "upd_neg " << sz << " " << cnt << "\n";
printv(dp, cerr);*/
}
int main(){
StarBurstStream
cin >> M;
cin >> L;
ll sum = 0;
ll total = 0;
vector<ll> _a(2 * M + 1), _b(2 * M + 1);
function<ll&(int)> a = [&](int x) -> ll&{
waassert(M + x >= 0 && M + x <= 2 * M);
return _a[M + x];
};
function<ll&(int)> b = [&](int x) -> ll&{
waassert(M + x >= 0 && M + x <= 2 * M);
return _b[M + x];
};
ll pos = 0, neg = 0;
for(int i = -M; i <= M; i++){
cin >> a(i);
sum += a(i) * i;
if(i < 0) neg += i * a(i);
else pos += i * a(i);
}
if(sum <= L){
for(int i = -M; i < 0; i++){
swap(a(i), a(-i));
}
L = -L;
}
int p = -M - 1;
sum = 0;
for(int i = -M; i <= M; i++){
sum += a(i) * i;
if(sum <= L) p = i;
}
sum = 0;
for(int i = -M; i <= p; i++){
sum += a(i) * i;
b(i) = a(i);
total += b(i);
}
if(p < M){
b(p + 1) = (L - sum) / (p + 1);
sum += b(p + 1) * (p + 1);
total += b(p + 1);
assert(b(p + 1) <= a(p + 1));
}
//total = a(0);
/*cerr << "test " << sum << " " << L << " " << L - sum << "\n";
printv(_a, cerr);
printv(_b, cerr);*/
S = max({pos, -neg, (ll)M * M});
dp.resize(2 * S + 1, -MAX);
//assert(pos <= S && -neg <= S);
dp[S] = 0;
//printv(dp, cerr);
for(int i = -M; i <= M; i++){
if(i == 0) continue;
if(i < 0){
upd_pos(-i, b(i), -1);
upd_neg(-i, a(i) - b(i), 1);
}
else{
upd_pos(i, a(i) - b(i), 1);
upd_neg(i, b(i), -1);
}
}
ll ans = L - sum > S || L - sum < -S ? -MAX : dp[S + L - sum];
ans += total;
if(ans < 0) cout << "impossible\n";
else cout << ans << "\n";
return 0;
}
Compilation message
vault.cpp:238:10: error: redefinition of 'const ll MOD'
238 | const ll MOD = 1000000007;
| ^~~
vault.cpp:80:10: note: 'const ll MOD' previously defined here
80 | const ll MOD = 1000000007;
| ^~~
vault.cpp:239:10: error: redefinition of 'const ll MAX'
239 | const ll MAX = 1LL << 60;
| ^~~
vault.cpp:81:10: note: 'const ll MAX' previously defined here
81 | const ll MAX = 1LL << 60;
| ^~~
vault.cpp:242:10: error: redefinition of 'template<class A, class B> std::ostream& operator<<(std::ostream&, std::pair<_T1, _T2>)'
242 | ostream& operator<<(ostream& o, pair<A, B> p){
| ^~~~~~~~
vault.cpp:84:10: note: 'template<class A, class B> std::ostream& operator<<(std::ostream&, std::pair<_T1, _T2>)' previously declared here
84 | ostream& operator<<(ostream& o, pair<A, B> p){
| ^~~~~~~~
vault.cpp:246:4: error: redefinition of 'll ifloor(ll, ll)'
246 | ll ifloor(ll a, ll b){
| ^~~~~~
vault.cpp:88:4: note: 'll ifloor(ll, ll)' previously defined here
88 | ll ifloor(ll a, ll b){
| ^~~~~~
vault.cpp:252:4: error: redefinition of 'll iceil(ll, ll)'
252 | ll iceil(ll a, ll b){
| ^~~~~
vault.cpp:94:4: note: 'll iceil(ll, ll)' previously defined here
94 | ll iceil(ll a, ll b){
| ^~~~~
vault.cpp:258:5: error: redefinition of 'int M'
258 | int M;
| ^
vault.cpp:100:5: note: 'int M' previously declared here
100 | int M;
| ^
vault.cpp:54:11: error: redefinition of 'int second'
54 | #define S second
| ^~~~~~
vault.cpp:259:5: note: in expansion of macro 'S'
259 | int S;
| ^
vault.cpp:54:11: note: 'int second' previously declared here
54 | #define S second
| ^~~~~~
vault.cpp:101:5: note: in expansion of macro 'S'
101 | int S;
| ^
vault.cpp:260:4: error: redefinition of 'll L'
260 | ll L;
| ^
vault.cpp:102:4: note: 'll L' previously declared here
102 | ll L;
| ^
vault.cpp:261:12: error: redefinition of 'std::vector<long long int> dp'
261 | vector<ll> dp;
| ^~
vault.cpp:103:12: note: 'std::vector<long long int> dp' previously declared here
103 | vector<ll> dp;
| ^~
vault.cpp:263:6: error: redefinition of 'void waassert(bool)'
263 | void waassert(bool t){
| ^~~~~~~~
vault.cpp:105:6: note: 'void waassert(bool)' previously defined here
105 | void waassert(bool t){
| ^~~~~~~~
vault.cpp:270:6: error: redefinition of 'void upd_pos(int, ll, int)'
270 | void upd_pos(int sz, ll cnt, int t){
| ^~~~~~~
vault.cpp:112:6: note: 'void upd_pos(int, ll, int)' previously defined here
112 | void upd_pos(int sz, ll cnt, int t){
| ^~~~~~~
vault.cpp:290:6: error: redefinition of 'void upd_neg(int, ll, int)'
290 | void upd_neg(int sz, ll cnt, int t){
| ^~~~~~~
vault.cpp:132:6: note: 'void upd_neg(int, ll, int)' previously defined here
132 | void upd_neg(int sz, ll cnt, int t){
| ^~~~~~~
vault.cpp:310:5: error: redefinition of 'int main()'
310 | int main(){
| ^~~~
vault.cpp:152:5: note: 'int main()' previously defined here
152 | int main(){
| ^~~~
