oj.uz

Submission #952907

# Submission time Handle Problem Language Result Execution time Memory
952907 2024-03-25T04:52:57 Z SirCovidThe19th The short shank; Redemption (BOI21_prison) C++17
80 / 100
 2000 ms 77272 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;
	int l = 0, r = 2e6, m = 0;
	int ans = 0;
	while (l < r) {//aliens HAHAHAhaha ha ha :sob:
		m = (l + r) / 2;
		vector<pair<int,int>> st; st.reserve(N);
		struct node {
			int p = -1;//prev
			int n = -1;//next
			int lz = 0;
			int v = 0;
			int c = 0; // count owo!!!
			node() {};
			node(int v, int c) : v(v), c(c) {};
		};
		vector<node> st2; st2.reserve(N);
		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 + (int)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 + (int)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((int)st2[start].v + (int)amt - (int)D * m);
		}
		else {
			//cout << "fuck" << endl;
			l = m + 1;
		}
	}
	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 1 ms 600 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 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 348 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 1 ms 348 KB Output is correct
2 Correct 583 ms 18388 KB Output is correct
3 Correct 593 ms 18060 KB Output is correct
4 Correct 541 ms 22880 KB Output is correct
5 Correct 527 ms 18092 KB Output is correct
6 Correct 448 ms 29144 KB Output is correct
7 Correct 564 ms 77264 KB Output is correct
8 Correct 440 ms 18920 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 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 348 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 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 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 348 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 4 ms 348 KB Output is correct
24 Correct 5 ms 348 KB Output is correct
25 Correct 4 ms 348 KB Output is correct
26 Correct 4 ms 348 KB Output is correct
27 Correct 4 ms 348 KB Output is correct
28 Correct 4 ms 604 KB Output is correct
29 Correct 5 ms 596 KB Output is correct
30 Correct 3 ms 604 KB Output is correct
31 Correct 3 ms 620 KB Output is correct
32 Correct 5 ms 604 KB Output is correct
33 Correct 3 ms 616 KB Output is correct
34 Correct 4 ms 600 KB Output is correct
35 Correct 4 ms 600 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 84 ms 3108 KB Output is correct
3 Correct 86 ms 3132 KB Output is correct
4 Correct 65 ms 3176 KB Output is correct
5 Correct 56 ms 6160 KB Output is correct
6 Correct 54 ms 5580 KB Output is correct
7 Correct 64 ms 5352 KB Output is correct
8 Correct 64 ms 6756 KB Output is correct
9 Correct 71 ms 12272 KB Output is correct
10 Correct 51 ms 3260 KB Output is correct

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 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 348 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 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 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 348 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 4 ms 348 KB Output is correct
24 Correct 5 ms 348 KB Output is correct
25 Correct 4 ms 348 KB Output is correct
26 Correct 4 ms 348 KB Output is correct
27 Correct 4 ms 348 KB Output is correct
28 Correct 4 ms 604 KB Output is correct
29 Correct 5 ms 596 KB Output is correct
30 Correct 3 ms 604 KB Output is correct
31 Correct 3 ms 620 KB Output is correct
32 Correct 5 ms 604 KB Output is correct
33 Correct 3 ms 616 KB Output is correct
34 Correct 4 ms 600 KB Output is correct
35 Correct 4 ms 600 KB Output is correct
36 Correct 1 ms 600 KB Output is correct
37 Correct 84 ms 3108 KB Output is correct
38 Correct 86 ms 3132 KB Output is correct
39 Correct 65 ms 3176 KB Output is correct
40 Correct 56 ms 6160 KB Output is correct
41 Correct 54 ms 5580 KB Output is correct
42 Correct 64 ms 5352 KB Output is correct
43 Correct 64 ms 6756 KB Output is correct
44 Correct 71 ms 12272 KB Output is correct
45 Correct 51 ms 3260 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 1 ms 344 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 348 KB Output is correct
55 Correct 1 ms 348 KB Output is correct
56 Correct 1 ms 344 KB Output is correct
57 Correct 4 ms 600 KB Output is correct
58 Correct 4 ms 348 KB Output is correct
59 Correct 4 ms 348 KB Output is correct
60 Correct 5 ms 600 KB Output is correct
61 Correct 4 ms 344 KB Output is correct
62 Correct 4 ms 604 KB Output is correct
63 Correct 4 ms 604 KB Output is correct
64 Correct 3 ms 604 KB Output is correct
65 Correct 6 ms 604 KB Output is correct
66 Correct 3 ms 604 KB Output is correct
67 Correct 3 ms 620 KB Output is correct
68 Correct 4 ms 604 KB Output is correct
69 Correct 4 ms 600 KB Output is correct
70 Correct 1 ms 348 KB Output is correct
71 Correct 88 ms 3140 KB Output is correct
72 Correct 89 ms 3108 KB Output is correct
73 Correct 64 ms 3176 KB Output is correct
74 Correct 63 ms 6144 KB Output is correct
75 Correct 60 ms 5508 KB Output is correct
76 Correct 76 ms 5440 KB Output is correct
77 Correct 76 ms 6736 KB Output is correct
78 Correct 79 ms 12260 KB Output is correct
79 Correct 54 ms 3240 KB Output is correct
80 Correct 95 ms 3116 KB Output is correct
81 Correct 95 ms 3116 KB Output is correct
82 Correct 87 ms 3112 KB Output is correct
83 Correct 98 ms 5116 KB Output is correct
84 Correct 80 ms 3128 KB Output is correct
85 Correct 55 ms 4680 KB Output is correct
86 Correct 88 ms 4256 KB Output is correct
87 Correct 64 ms 3592 KB Output is correct
88 Correct 71 ms 11416 KB Output is correct
89 Correct 61 ms 12072 KB Output is correct
90 Correct 66 ms 10088 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 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 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 583 ms 18388 KB Output is correct
14 Correct 593 ms 18060 KB Output is correct
15 Correct 541 ms 22880 KB Output is correct
16 Correct 527 ms 18092 KB Output is correct
17 Correct 448 ms 29144 KB Output is correct
18 Correct 564 ms 77264 KB Output is correct
19 Correct 440 ms 18920 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 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 348 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 4 ms 348 KB Output is correct
32 Correct 5 ms 348 KB Output is correct
33 Correct 4 ms 348 KB Output is correct
34 Correct 4 ms 348 KB Output is correct
35 Correct 4 ms 348 KB Output is correct
36 Correct 4 ms 604 KB Output is correct
37 Correct 5 ms 596 KB Output is correct
38 Correct 3 ms 604 KB Output is correct
39 Correct 3 ms 620 KB Output is correct
40 Correct 5 ms 604 KB Output is correct
41 Correct 3 ms 616 KB Output is correct
42 Correct 4 ms 600 KB Output is correct
43 Correct 4 ms 600 KB Output is correct
44 Correct 1 ms 600 KB Output is correct
45 Correct 84 ms 3108 KB Output is correct
46 Correct 86 ms 3132 KB Output is correct
47 Correct 65 ms 3176 KB Output is correct
48 Correct 56 ms 6160 KB Output is correct
49 Correct 54 ms 5580 KB Output is correct
50 Correct 64 ms 5352 KB Output is correct
51 Correct 64 ms 6756 KB Output is correct
52 Correct 71 ms 12272 KB Output is correct
53 Correct 51 ms 3260 KB Output is correct
54 Correct 1 ms 348 KB Output is correct
55 Correct 1 ms 348 KB Output is correct
56 Correct 1 ms 344 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 348 KB Output is correct
63 Correct 1 ms 348 KB Output is correct
64 Correct 1 ms 344 KB Output is correct
65 Correct 4 ms 600 KB Output is correct
66 Correct 4 ms 348 KB Output is correct
67 Correct 4 ms 348 KB Output is correct
68 Correct 5 ms 600 KB Output is correct
69 Correct 4 ms 344 KB Output is correct
70 Correct 4 ms 604 KB Output is correct
71 Correct 4 ms 604 KB Output is correct
72 Correct 3 ms 604 KB Output is correct
73 Correct 6 ms 604 KB Output is correct
74 Correct 3 ms 604 KB Output is correct
75 Correct 3 ms 620 KB Output is correct
76 Correct 4 ms 604 KB Output is correct
77 Correct 4 ms 600 KB Output is correct
78 Correct 1 ms 348 KB Output is correct
79 Correct 88 ms 3140 KB Output is correct
80 Correct 89 ms 3108 KB Output is correct
81 Correct 64 ms 3176 KB Output is correct
82 Correct 63 ms 6144 KB Output is correct
83 Correct 60 ms 5508 KB Output is correct
84 Correct 76 ms 5440 KB Output is correct
85 Correct 76 ms 6736 KB Output is correct
86 Correct 79 ms 12260 KB Output is correct
87 Correct 54 ms 3240 KB Output is correct
88 Correct 95 ms 3116 KB Output is correct
89 Correct 95 ms 3116 KB Output is correct
90 Correct 87 ms 3112 KB Output is correct
91 Correct 98 ms 5116 KB Output is correct
92 Correct 80 ms 3128 KB Output is correct
93 Correct 55 ms 4680 KB Output is correct
94 Correct 88 ms 4256 KB Output is correct
95 Correct 64 ms 3592 KB Output is correct
96 Correct 71 ms 11416 KB Output is correct
97 Correct 61 ms 12072 KB Output is correct
98 Correct 66 ms 10088 KB Output is correct
99 Correct 1 ms 348 KB Output is correct
100 Correct 1 ms 348 KB Output is correct
101 Correct 1 ms 476 KB Output is correct
102 Correct 1 ms 348 KB Output is correct
103 Correct 1 ms 352 KB Output is correct
104 Correct 1 ms 348 KB Output is correct
105 Correct 1 ms 348 KB Output is correct
106 Correct 1 ms 348 KB Output is correct
107 Correct 1 ms 348 KB Output is correct
108 Correct 1 ms 348 KB Output is correct
109 Correct 1 ms 344 KB Output is correct
110 Correct 1 ms 352 KB Output is correct
111 Correct 627 ms 18060 KB Output is correct
112 Correct 566 ms 18128 KB Output is correct
113 Correct 553 ms 22964 KB Output is correct
114 Correct 523 ms 18068 KB Output is correct
115 Correct 436 ms 29160 KB Output is correct
116 Correct 642 ms 77272 KB Output is correct
117 Correct 483 ms 18920 KB Output is correct
118 Correct 4 ms 596 KB Output is correct
119 Correct 4 ms 348 KB Output is correct
120 Correct 4 ms 348 KB Output is correct
121 Correct 4 ms 348 KB Output is correct
122 Correct 4 ms 600 KB Output is correct
123 Correct 4 ms 600 KB Output is correct
124 Correct 5 ms 604 KB Output is correct
125 Correct 3 ms 604 KB Output is correct
126 Correct 3 ms 604 KB Output is correct
127 Correct 3 ms 604 KB Output is correct
128 Correct 3 ms 604 KB Output is correct
129 Correct 4 ms 604 KB Output is correct
130 Correct 4 ms 604 KB Output is correct
131 Correct 0 ms 348 KB Output is correct
132 Correct 89 ms 3096 KB Output is correct
133 Correct 89 ms 3160 KB Output is correct
134 Correct 82 ms 3208 KB Output is correct
135 Correct 54 ms 6164 KB Output is correct
136 Correct 55 ms 5492 KB Output is correct
137 Correct 64 ms 5344 KB Output is correct
138 Correct 65 ms 6760 KB Output is correct
139 Correct 66 ms 12240 KB Output is correct
140 Correct 54 ms 3316 KB Output is correct
141 Correct 86 ms 3168 KB Output is correct
142 Correct 98 ms 3136 KB Output is correct
143 Correct 86 ms 3136 KB Output is correct
144 Correct 81 ms 5156 KB Output is correct
145 Correct 103 ms 3128 KB Output is correct
146 Correct 53 ms 4448 KB Output is correct
147 Correct 64 ms 4280 KB Output is correct
148 Correct 65 ms 3576 KB Output is correct
149 Correct 89 ms 11388 KB Output is correct
150 Correct 64 ms 11984 KB Output is correct
151 Correct 59 ms 9792 KB Output is correct
152 Execution timed out 2029 ms 70900 KB Time limit exceeded
153 Halted 0 ms 0 KB -