oj.uz

Submission #952889

# Submission time Handle Problem Language Result Execution time Memory
952889 2024-03-25T04:38:54 Z tacocat The short shank; Redemption (BOI21_prison) C++17
55 / 100
 1010 ms 104580 KB 
/*
*       ___
*   _ /    _\_
*  / |    |___|
*  | |       |
*  \_|   __  |
*     \_/  \_/
*   uwu amogus
*/
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x7FFFFFFF
#define llinf 0x7FFFFFFFFFFFFFFF
#define ff first
#define ss second
#define FOR(i, a, b) for(int i = a; i < b; i++)
#define ROF(i, a, b) for(int i = a - 1; i >= b; i--)
//#define assert void
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
//#define int ll
struct dsu {
	dsu(int n) {
		p.resize(n, -1);
		pp.resize(n); for (int i = 0; i < n; i++) pp[i] = i;
		r.resize(n, 0);
	}
	inline int par(int x) {
		return pp[_par(x)];
	}
	inline int _par(int x) {
		return p[x] == -1 ? x : p[x] = _par(p[x]);
	}
	inline void merge(int a, int b) {
		a = _par(a); b = _par(b);
		if (a == b)return;
		if (r[a] < r[b]) {
			swap(a, b);
			swap(pp[a], pp[b]);
		}
		if (r[a] == r[b]) r[a]++;
		p[b] = a;
	}
	vector<int> p, r, pp;
};
 
signed main() {
  ios_base::sync_with_stdio(false); cin.tie(NULL);
	int N, D, T; cin >> N >> D >> T;
	vector<int> t(N); for (auto& x : t) cin >> x;
	double l = 0, r = 2e6, m = 0;
	int ans = 0;
	for (int _ = 0; _ < 30; _++) {//aliens HAHAHAhaha ha ha :sob:
		m = (l + r) / 2;
		vector<pair<int,int>> st;
		struct node {
			int p = -1;//prev
			int n = -1;//next
			int lz = 0;
			double v = 0;
			int c = 0; // count owo!!!
			node() {};
			node(double v, int c) : v(v), c(c) {};
		};
		vector<node> st2;
		dsu pls(N);
		int start = 0; 
		int amt = 0;//amount added
		function<void(int)> kill = [&](int i) {
			int n = st2[i].n;
			//assert(n != -1); 
			if (n == -1) return;
			if ((st2[i].v + (double)st2[i].lz > st2[n].v)) {
				int p = st2[i].p;
				st2[n].p = p;
				if (p != -1) {
					st2[p].lz += st2[i].lz;
					st2[p].n = n;
					pls.merge(p, i); //merge i to p
					kill(p);
				}
				else {
					// DEAD
					amt -= st2[i].lz; //recycle owo
					start = n;
				}
			}
		};
		for (int i = 0; i < N; i++) {
			//create and then upd
			if (st2.size()) {
				st2.push_back(node(st2[start].v + (double)amt + m, st2[start].c+1));
				st2[i - 1].n = i; st2[i].p = i - 1;
				kill(i - 1);
			}
			else {
				st2.push_back(node());
			}
 
			int o = i;
			if (t[i] <= T) {
				while (st.size() && st.back().ff >= t[i] - i) {
					st.pop_back();
				}
				st.push_back({ t[i] - i, i});
			}
			else {
				while (st.size() && st.back().ff > T - i) st.pop_back();
				if (st.size()) {
					o = st.back().ss;
				}
				else o = -1;
			}
			//cout << o << ",";
			if(o >= start){
				int t = pls.par(o);
				st2[t].lz++; amt++;
				kill(t);
			}
			//cout << amt << ",";
		}
		//cout << endl;
		int c = st2[start].c;
		//cout << c << endl;
		if (c <= D) {
			r = m;
			ans = round((double)st2[start].v + (double)amt - (double)D * m);
		}
		else {
			//cout << "fuck" << endl;
			l = m;
		}
	}
	cout << ans << endl;
	// n log n inverse ackermann n please pass i swear to god
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 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 456 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 985 ms 45548 KB Output is correct
3 Correct 963 ms 45568 KB Output is correct
4 Correct 932 ms 48128 KB Output is correct
5 Correct 896 ms 42340 KB Output is correct
6 Correct 798 ms 55704 KB Output is correct
7 Correct 1010 ms 104580 KB Output is correct
8 Correct 789 ms 45176 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 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 456 KB Output is correct
10 Correct 1 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 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 2 ms 600 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 7 ms 732 KB Output is correct
24 Correct 7 ms 732 KB Output is correct
25 Correct 7 ms 732 KB Output is correct
26 Correct 7 ms 732 KB Output is correct
27 Correct 7 ms 732 KB Output is correct
28 Correct 8 ms 724 KB Output is correct
29 Correct 7 ms 732 KB Output is correct
30 Correct 6 ms 724 KB Output is correct
31 Correct 6 ms 732 KB Output is correct
32 Correct 5 ms 728 KB Output is correct
33 Correct 5 ms 732 KB Output is correct
34 Correct 6 ms 732 KB Output is correct
35 Correct 6 ms 804 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 176 ms 10276 KB Output is correct
3 Correct 166 ms 10660 KB Output is correct
4 Correct 110 ms 10520 KB Output is correct
5 Correct 111 ms 12900 KB Output is correct
6 Correct 113 ms 12536 KB Output is correct
7 Correct 149 ms 12260 KB Output is correct
8 Correct 145 ms 12324 KB Output is correct
9 Correct 141 ms 18600 KB Output is correct
10 Correct 107 ms 9144 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 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 456 KB Output is correct
10 Correct 1 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 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 2 ms 600 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 7 ms 732 KB Output is correct
24 Correct 7 ms 732 KB Output is correct
25 Correct 7 ms 732 KB Output is correct
26 Correct 7 ms 732 KB Output is correct
27 Correct 7 ms 732 KB Output is correct
28 Correct 8 ms 724 KB Output is correct
29 Correct 7 ms 732 KB Output is correct
30 Correct 6 ms 724 KB Output is correct
31 Correct 6 ms 732 KB Output is correct
32 Correct 5 ms 728 KB Output is correct
33 Correct 5 ms 732 KB Output is correct
34 Correct 6 ms 732 KB Output is correct
35 Correct 6 ms 804 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 176 ms 10276 KB Output is correct
38 Correct 166 ms 10660 KB Output is correct
39 Correct 110 ms 10520 KB Output is correct
40 Correct 111 ms 12900 KB Output is correct
41 Correct 113 ms 12536 KB Output is correct
42 Correct 149 ms 12260 KB Output is correct
43 Correct 145 ms 12324 KB Output is correct
44 Correct 141 ms 18600 KB Output is correct
45 Correct 107 ms 9144 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 1 ms 344 KB Output is correct
48 Correct 1 ms 456 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 1 ms 348 KB Output is correct
54 Correct 1 ms 452 KB Output is correct
55 Correct 1 ms 348 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 7 ms 776 KB Output is correct
58 Correct 7 ms 732 KB Output is correct
59 Correct 7 ms 820 KB Output is correct
60 Correct 7 ms 732 KB Output is correct
61 Correct 7 ms 724 KB Output is correct
62 Correct 8 ms 728 KB Output is correct
63 Correct 7 ms 728 KB Output is correct
64 Correct 5 ms 728 KB Output is correct
65 Correct 6 ms 980 KB Output is correct
66 Correct 5 ms 732 KB Output is correct
67 Correct 5 ms 732 KB Output is correct
68 Correct 6 ms 724 KB Output is correct
69 Correct 6 ms 804 KB Output is correct
70 Correct 0 ms 348 KB Output is correct
71 Correct 172 ms 9908 KB Output is correct
72 Correct 161 ms 9836 KB Output is correct
73 Correct 104 ms 10412 KB Output is correct
74 Correct 103 ms 12052 KB Output is correct
75 Correct 103 ms 11668 KB Output is correct
76 Correct 126 ms 10972 KB Output is correct
77 Correct 157 ms 13580 KB Output is correct
78 Correct 146 ms 18504 KB Output is correct
79 Correct 117 ms 10200 KB Output is correct
80 Incorrect 174 ms 10056 KB Output isn't correct
81 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 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 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 456 KB Output is correct
10 Correct 1 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 985 ms 45548 KB Output is correct
14 Correct 963 ms 45568 KB Output is correct
15 Correct 932 ms 48128 KB Output is correct
16 Correct 896 ms 42340 KB Output is correct
17 Correct 798 ms 55704 KB Output is correct
18 Correct 1010 ms 104580 KB Output is correct
19 Correct 789 ms 45176 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 2 ms 600 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 7 ms 732 KB Output is correct
32 Correct 7 ms 732 KB Output is correct
33 Correct 7 ms 732 KB Output is correct
34 Correct 7 ms 732 KB Output is correct
35 Correct 7 ms 732 KB Output is correct
36 Correct 8 ms 724 KB Output is correct
37 Correct 7 ms 732 KB Output is correct
38 Correct 6 ms 724 KB Output is correct
39 Correct 6 ms 732 KB Output is correct
40 Correct 5 ms 728 KB Output is correct
41 Correct 5 ms 732 KB Output is correct
42 Correct 6 ms 732 KB Output is correct
43 Correct 6 ms 804 KB Output is correct
44 Correct 1 ms 344 KB Output is correct
45 Correct 176 ms 10276 KB Output is correct
46 Correct 166 ms 10660 KB Output is correct
47 Correct 110 ms 10520 KB Output is correct
48 Correct 111 ms 12900 KB Output is correct
49 Correct 113 ms 12536 KB Output is correct
50 Correct 149 ms 12260 KB Output is correct
51 Correct 145 ms 12324 KB Output is correct
52 Correct 141 ms 18600 KB Output is correct
53 Correct 107 ms 9144 KB Output is correct
54 Correct 0 ms 344 KB Output is correct
55 Correct 1 ms 344 KB Output is correct
56 Correct 1 ms 456 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 1 ms 348 KB Output is correct
61 Correct 1 ms 348 KB Output is correct
62 Correct 1 ms 452 KB Output is correct
63 Correct 1 ms 348 KB Output is correct
64 Correct 1 ms 348 KB Output is correct
65 Correct 7 ms 776 KB Output is correct
66 Correct 7 ms 732 KB Output is correct
67 Correct 7 ms 820 KB Output is correct
68 Correct 7 ms 732 KB Output is correct
69 Correct 7 ms 724 KB Output is correct
70 Correct 8 ms 728 KB Output is correct
71 Correct 7 ms 728 KB Output is correct
72 Correct 5 ms 728 KB Output is correct
73 Correct 6 ms 980 KB Output is correct
74 Correct 5 ms 732 KB Output is correct
75 Correct 5 ms 732 KB Output is correct
76 Correct 6 ms 724 KB Output is correct
77 Correct 6 ms 804 KB Output is correct
78 Correct 0 ms 348 KB Output is correct
79 Correct 172 ms 9908 KB Output is correct
80 Correct 161 ms 9836 KB Output is correct
81 Correct 104 ms 10412 KB Output is correct
82 Correct 103 ms 12052 KB Output is correct
83 Correct 103 ms 11668 KB Output is correct
84 Correct 126 ms 10972 KB Output is correct
85 Correct 157 ms 13580 KB Output is correct
86 Correct 146 ms 18504 KB Output is correct
87 Correct 117 ms 10200 KB Output is correct
88 Incorrect 174 ms 10056 KB Output isn't correct
89 Halted 0 ms 0 KB -