oj.uz

Submission #916966

# Submission time Handle Problem Language Result Execution time Memory
916966 2024-01-26T21:09:17 Z NK_ The short shank; Redemption (BOI21_prison) C++17
15 / 100
 157 ms 44856 KB 
// Success consists of going from failure to failure without loss of enthusiasm
#include <bits/stdc++.h>

using namespace std;

#define nl '\n'
#define pb push_back
#define sz(x) int(x.size())
#define mp make_pair

template<class T> using V = vector<T>;
template<class T> using pq = priority_queue<T, vector<T>, less<T>>;

using vi = V<int>;
using pi = pair<int, int>;

int main() {
	cin.tie(0)->sync_with_stdio(0);
	
	int N, D, T; cin >> N >> D >> T;
	vi A(N); for(auto& x : A) cin >> x;

	V<vi> E(N);
	for(int i = 0; i < N; i++) {
		A[i] = max(T + 1 - A[i], 0);
		// cout << i << " => " << A[i] << endl;
		int r = i + A[i];
		if (r < N) E[r].pb(i);
	}
	// cout << endl;

	set<int> R; int ans = 0;

	vi LX, RX; 
	for(int i = 0; i < N; i++) {
		R.insert(i);
		for(auto& x : E[i]) R.erase(x);

		if (A[i] == 0) {
			if (sz(R)) {
				LX.pb(*rbegin(R));
				RX.pb(max(LX.back(), (sz(RX) ? RX.back() : -1)));
				// cout << i << " => " << LX.back() << " " << RX.back() << endl;
			} else {
				// cout << i << " => {}" << endl;
				ans++;
			}

		} 
		// else {
		// 	// cout << i << " " << A[i] << endl;
		// }
	}	

	int M = sz(LX);

	vi P, C, I, stk = {-1}; // parent, count
	for(int i = 0; i < M; i++) {
		if (i && mp(LX[i], RX[i]) == mp(LX[i-1], RX[i-1])) C.back()++;
		else {
			int u = sz(C); 
			while(stk.back() != -1 && LX[I[stk.back()]] > LX[i]) stk.pop_back();

			if (i && RX[i - 1] == RX[i]) P.back() = u;
			if (stk.back() != -1 && LX[I[stk.back()]] == LX[i]) P[stk.back()] = u;

			C.pb(1); I.pb(i); P.pb(-1); stk.pb(u);
		}
	}

	int K = sz(P);
	V<vi> chd(K); for(int i = 0; i < K; i++) {
		if (P[i] != -1) {
			chd[P[i]].pb(i);
			// cout << i << " <--> " << P[i] << endl;
		}
	}

	vi mx(K), vis(K), taken(K, 0), rem(K, 0), S(K, 0); 
	function<void(int)> dfs = [&](int u) {
		S[u] += C[u]; mx[u] = u; vis[u] = 1; 
		for(auto& v : chd[u]) {
			S[v] += S[u];
			dfs(v); 
			if (S[mx[u]] < S[mx[v]]) mx[u] = mx[v];
		}	
	};

	pq<pi> q; for(int i = 0; i < K; i++) if (P[i] == -1) {
		dfs(i); q.push(mp(S[mx[i]], mx[i]));
		// cout << i << " --> " << mx[i] << endl;
	}

	while(D && sz(q)) {
		auto [amt, u] = q.top(); q.pop();
		D--; ans += max(amt, 0); 
		// cout << "T: " << amt << " " << u << endl;

		while(u != -1) {
			taken[u] = 1;
			for(auto& v : chd[u]) if (!taken[v]) {
				P[v] = -1; rem[v] += rem[u] + S[u];
				// cout << "ROOT: " << v << " => " << mx[v] << " " << S[mx[v]] - rem[v] << endl;
				q.push(mp(S[mx[v]] - rem[v], mx[v]));
			}
			u = P[u];
		}
	}

	// cout << ans << endl;

	cout << N - ans << nl;

	exit(0-0);
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 157 ms 42308 KB Output is correct
3 Correct 153 ms 44856 KB Output is correct
4 Correct 155 ms 42740 KB Output is correct
5 Correct 100 ms 37800 KB Output is correct
6 Incorrect 87 ms 38464 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 600 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 2 ms 604 KB Output is correct
24 Correct 2 ms 604 KB Output is correct
25 Correct 1 ms 600 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 600 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Incorrect 1 ms 604 KB Output isn't correct
32 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 21 ms 7084 KB Output is correct
3 Correct 22 ms 6996 KB Output is correct
4 Correct 21 ms 6988 KB Output is correct
5 Correct 20 ms 5208 KB Output is correct
6 Correct 20 ms 5588 KB Output is correct
7 Correct 12 ms 5724 KB Output is correct
8 Incorrect 13 ms 6056 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 600 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 2 ms 604 KB Output is correct
24 Correct 2 ms 604 KB Output is correct
25 Correct 1 ms 600 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 600 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Incorrect 1 ms 604 KB Output isn't correct
32 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 157 ms 42308 KB Output is correct
14 Correct 153 ms 44856 KB Output is correct
15 Correct 155 ms 42740 KB Output is correct
16 Correct 100 ms 37800 KB Output is correct
17 Incorrect 87 ms 38464 KB Output isn't correct
18 Halted 0 ms 0 KB -