oj.uz

Submission #579248

# Submission time Handle Problem Language Result Execution time Memory
579248 2022-06-18T15:56:18 Z cheissmart Uplifting Excursion (BOI22_vault) C++14
0 / 100
 2 ms 468 KB 
#include <bits/stdc++.h>
#define IO_OP std::ios::sync_with_stdio(0); std::cin.tie(0);
#define F first
#define S second
#define V vector
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(), (v).end()

using namespace std;

typedef long long ll;
typedef pair<int, int> pi;
typedef V<int> vi;

string _reset = "\u001b[0m", _yellow = "\u001b[33m", _bold = "\u001b[1m";
void DBG() { cerr << "]" << _reset << endl; }
template<class H, class...T> void DBG(H h, T ...t) {
	cerr << to_string(h);
	if(sizeof ...(t)) cerr << ", ";
	DBG(t...);
}
#ifdef CHEISSMART
#define debug(...) cerr << _yellow << _bold << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define debug(...)
#endif

const int INF = 1e9 + 7, mxM = 30;

template<class T> void cmax(T& a, T b) { a = max(a, b); }

int m;
ll a[mxM * 2], b[mxM * 2], l;

signed main()
{
	IO_OP;

	cin >> m >> l;
	ll tot = 0, ans = 0;
	for(int i = -m; i <= m; i++) {
		cin >> a[i + m];
		tot += a[i + m] * i;
	}
	if(tot < l) {
		tot = -tot;
		l = -l;
		for(int i = 0; i < m; i++)
			swap(a[i], a[2 * m - i]);
	}
	tot = 0;
	for(int i = -m; i <= 0; i++) {
		tot += a[i + m] * i;
		b[i + m] = a[i + m];
		ans += b[i + m];
	}

	if(tot > l) {
		cout << "impossible\n";
		return 0;
	}
	for(int i = 1; i <= m; i++) {
		assert(tot <= l);
		b[i + m] = min((l - tot) / i, a[i + m]);
		tot += b[i + m] * i;
		ans += b[i + m];
	}
	assert(tot <= l);
	assert(tot + mxM >= l);

	int C = mxM * mxM * 2;
	vi dp(C * 2, -INF);
	dp[0 + C] = 0;

	for(int i = -m; i <= m; i++) {
		if(i == 0) continue;
		vi ndp(C * 2, -INF);
		ll lb = b[i + m] - a[i + m], rb = b[i + m];
		if(lb > rb) {
			while(1);
		}
		auto go = [&] (vi pos) {
			deque<pi> dk;
			auto add = [&] (int x, int y) {
				while(SZ(dk) && dk.back().F <= x) dk.pop_back();
				dk.EB(x, y);
			};
			for(int k = 0, kk = 0; k < SZ(pos); k++) {
				while(kk < SZ(pos) && kk <= k + rb) {
					add(dp[pos[kk]] - kk, kk);
					kk++;
				}
				while(dk[0].S < k + lb)
					dk.pop_front();
				ndp[pos[k]] = dk[0].F + k;
			}
		};
		if(i > 0) {
			for(int j = 0; j < i; j++) {
				vi pos;
				for(int k = j; k < 2 * C; k += i)
					pos.PB(k);
				go(pos);
			}
		} else {
			for(int j = 0; j < -i; j++) {
				vi pos;
				for(int k = j; k < 2 * C; k -= i)
					pos.PB(k);
				reverse(ALL(pos));
				go(pos);	
			}
		}
		swap(dp, ndp);
	}
	if(dp[l - tot + C] < -1e8) cout << "impossible\n";
	else cout << ans + dp[l - tot + C] << '\n';


}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Runtime error 1 ms 468 KB Execution killed with signal 11
7 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Runtime error 1 ms 468 KB Execution killed with signal 11
7 Halted 0 ms 0 KB -

Subtask #3-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Runtime error 1 ms 468 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #3-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Runtime error 1 ms 468 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #4-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Runtime error 1 ms 468 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #4-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Runtime error 1 ms 468 KB Execution killed with signal 11
7 Halted 0 ms 0 KB -

Subtask #5-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Runtime error 1 ms 468 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #5-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Runtime error 1 ms 468 KB Execution killed with signal 11
7 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Runtime error 1 ms 468 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #6-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Runtime error 1 ms 468 KB Execution killed with signal 11
7 Halted 0 ms 0 KB -