oj.uz

Submission #952890

# Submission time Handle Problem Language Result Execution time Memory
952890 2024-03-25T04:39:41 Z tacocat The short shank; Redemption (BOI21_prison) C++14
80 / 100
 2000 ms 118552 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; _ < 35; _++) {//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 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 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 0 ms 344 KB Output is correct
2 Correct 1196 ms 40432 KB Output is correct
3 Correct 1142 ms 40384 KB Output is correct
4 Correct 1107 ms 44856 KB Output is correct
5 Correct 1066 ms 41288 KB Output is correct
6 Correct 939 ms 51408 KB Output is correct
7 Correct 1224 ms 99776 KB Output is correct
8 Correct 905 ms 41208 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 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 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 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 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 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 8 ms 716 KB Output is correct
24 Correct 8 ms 732 KB Output is correct
25 Correct 8 ms 928 KB Output is correct
26 Correct 8 ms 732 KB Output is correct
27 Correct 8 ms 860 KB Output is correct
28 Correct 8 ms 732 KB Output is correct
29 Correct 8 ms 732 KB Output is correct
30 Correct 6 ms 860 KB Output is correct
31 Correct 6 ms 732 KB Output is correct
32 Correct 6 ms 732 KB Output is correct
33 Correct 6 ms 728 KB Output is correct
34 Correct 9 ms 732 KB Output is correct
35 Correct 7 ms 788 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 182 ms 9192 KB Output is correct
3 Correct 186 ms 8960 KB Output is correct
4 Correct 147 ms 8432 KB Output is correct
5 Correct 127 ms 11868 KB Output is correct
6 Correct 134 ms 12184 KB Output is correct
7 Correct 167 ms 11768 KB Output is correct
8 Correct 148 ms 11980 KB Output is correct
9 Correct 184 ms 18508 KB Output is correct
10 Correct 133 ms 8732 KB Output is correct

Subtask #5
25.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 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 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 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 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 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 8 ms 716 KB Output is correct
24 Correct 8 ms 732 KB Output is correct
25 Correct 8 ms 928 KB Output is correct
26 Correct 8 ms 732 KB Output is correct
27 Correct 8 ms 860 KB Output is correct
28 Correct 8 ms 732 KB Output is correct
29 Correct 8 ms 732 KB Output is correct
30 Correct 6 ms 860 KB Output is correct
31 Correct 6 ms 732 KB Output is correct
32 Correct 6 ms 732 KB Output is correct
33 Correct 6 ms 728 KB Output is correct
34 Correct 9 ms 732 KB Output is correct
35 Correct 7 ms 788 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 182 ms 9192 KB Output is correct
38 Correct 186 ms 8960 KB Output is correct
39 Correct 147 ms 8432 KB Output is correct
40 Correct 127 ms 11868 KB Output is correct
41 Correct 134 ms 12184 KB Output is correct
42 Correct 167 ms 11768 KB Output is correct
43 Correct 148 ms 11980 KB Output is correct
44 Correct 184 ms 18508 KB Output is correct
45 Correct 133 ms 8732 KB Output is correct
46 Correct 0 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 344 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 1 ms 344 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 344 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 8 ms 732 KB Output is correct
58 Correct 8 ms 732 KB Output is correct
59 Correct 8 ms 732 KB Output is correct
60 Correct 8 ms 732 KB Output is correct
61 Correct 8 ms 732 KB Output is correct
62 Correct 9 ms 732 KB Output is correct
63 Correct 8 ms 732 KB Output is correct
64 Correct 6 ms 732 KB Output is correct
65 Correct 8 ms 728 KB Output is correct
66 Correct 6 ms 732 KB Output is correct
67 Correct 5 ms 732 KB Output is correct
68 Correct 8 ms 732 KB Output is correct
69 Correct 7 ms 788 KB Output is correct
70 Correct 1 ms 344 KB Output is correct
71 Correct 176 ms 8732 KB Output is correct
72 Correct 197 ms 9480 KB Output is correct
73 Correct 142 ms 9152 KB Output is correct
74 Correct 131 ms 12348 KB Output is correct
75 Correct 129 ms 11532 KB Output is correct
76 Correct 157 ms 11320 KB Output is correct
77 Correct 159 ms 12868 KB Output is correct
78 Correct 175 ms 17992 KB Output is correct
79 Correct 153 ms 9768 KB Output is correct
80 Correct 196 ms 9244 KB Output is correct
81 Correct 169 ms 8988 KB Output is correct
82 Correct 213 ms 10408 KB Output is correct
83 Correct 155 ms 11480 KB Output is correct
84 Correct 173 ms 8852 KB Output is correct
85 Correct 118 ms 10260 KB Output is correct
86 Correct 155 ms 11272 KB Output is correct
87 Correct 142 ms 10416 KB Output is correct
88 Correct 166 ms 18552 KB Output is correct
89 Correct 154 ms 17940 KB Output is correct
90 Correct 157 ms 16384 KB Output is correct

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 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 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 1196 ms 40432 KB Output is correct
14 Correct 1142 ms 40384 KB Output is correct
15 Correct 1107 ms 44856 KB Output is correct
16 Correct 1066 ms 41288 KB Output is correct
17 Correct 939 ms 51408 KB Output is correct
18 Correct 1224 ms 99776 KB Output is correct
19 Correct 905 ms 41208 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 1 ms 600 KB Output is correct
24 Correct 1 ms 344 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 8 ms 716 KB Output is correct
32 Correct 8 ms 732 KB Output is correct
33 Correct 8 ms 928 KB Output is correct
34 Correct 8 ms 732 KB Output is correct
35 Correct 8 ms 860 KB Output is correct
36 Correct 8 ms 732 KB Output is correct
37 Correct 8 ms 732 KB Output is correct
38 Correct 6 ms 860 KB Output is correct
39 Correct 6 ms 732 KB Output is correct
40 Correct 6 ms 732 KB Output is correct
41 Correct 6 ms 728 KB Output is correct
42 Correct 9 ms 732 KB Output is correct
43 Correct 7 ms 788 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 182 ms 9192 KB Output is correct
46 Correct 186 ms 8960 KB Output is correct
47 Correct 147 ms 8432 KB Output is correct
48 Correct 127 ms 11868 KB Output is correct
49 Correct 134 ms 12184 KB Output is correct
50 Correct 167 ms 11768 KB Output is correct
51 Correct 148 ms 11980 KB Output is correct
52 Correct 184 ms 18508 KB Output is correct
53 Correct 133 ms 8732 KB Output is correct
54 Correct 0 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 344 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 1 ms 344 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 344 KB Output is correct
64 Correct 1 ms 348 KB Output is correct
65 Correct 8 ms 732 KB Output is correct
66 Correct 8 ms 732 KB Output is correct
67 Correct 8 ms 732 KB Output is correct
68 Correct 8 ms 732 KB Output is correct
69 Correct 8 ms 732 KB Output is correct
70 Correct 9 ms 732 KB Output is correct
71 Correct 8 ms 732 KB Output is correct
72 Correct 6 ms 732 KB Output is correct
73 Correct 8 ms 728 KB Output is correct
74 Correct 6 ms 732 KB Output is correct
75 Correct 5 ms 732 KB Output is correct
76 Correct 8 ms 732 KB Output is correct
77 Correct 7 ms 788 KB Output is correct
78 Correct 1 ms 344 KB Output is correct
79 Correct 176 ms 8732 KB Output is correct
80 Correct 197 ms 9480 KB Output is correct
81 Correct 142 ms 9152 KB Output is correct
82 Correct 131 ms 12348 KB Output is correct
83 Correct 129 ms 11532 KB Output is correct
84 Correct 157 ms 11320 KB Output is correct
85 Correct 159 ms 12868 KB Output is correct
86 Correct 175 ms 17992 KB Output is correct
87 Correct 153 ms 9768 KB Output is correct
88 Correct 196 ms 9244 KB Output is correct
89 Correct 169 ms 8988 KB Output is correct
90 Correct 213 ms 10408 KB Output is correct
91 Correct 155 ms 11480 KB Output is correct
92 Correct 173 ms 8852 KB Output is correct
93 Correct 118 ms 10260 KB Output is correct
94 Correct 155 ms 11272 KB Output is correct
95 Correct 142 ms 10416 KB Output is correct
96 Correct 166 ms 18552 KB Output is correct
97 Correct 154 ms 17940 KB Output is correct
98 Correct 157 ms 16384 KB Output is correct
99 Correct 0 ms 348 KB Output is correct
100 Correct 1 ms 348 KB Output is correct
101 Correct 1 ms 348 KB Output is correct
102 Correct 1 ms 348 KB Output is correct
103 Correct 1 ms 460 KB Output is correct
104 Correct 2 ms 344 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 500 KB Output is correct
109 Correct 1 ms 348 KB Output is correct
110 Correct 0 ms 348 KB Output is correct
111 Correct 1115 ms 45368 KB Output is correct
112 Correct 1120 ms 45484 KB Output is correct
113 Correct 1075 ms 48352 KB Output is correct
114 Correct 1041 ms 42576 KB Output is correct
115 Correct 934 ms 55464 KB Output is correct
116 Correct 1195 ms 104396 KB Output is correct
117 Correct 931 ms 45716 KB Output is correct
118 Correct 8 ms 732 KB Output is correct
119 Correct 8 ms 860 KB Output is correct
120 Correct 8 ms 732 KB Output is correct
121 Correct 8 ms 860 KB Output is correct
122 Correct 8 ms 732 KB Output is correct
123 Correct 8 ms 812 KB Output is correct
124 Correct 8 ms 980 KB Output is correct
125 Correct 6 ms 728 KB Output is correct
126 Correct 6 ms 984 KB Output is correct
127 Correct 5 ms 732 KB Output is correct
128 Correct 5 ms 732 KB Output is correct
129 Correct 8 ms 744 KB Output is correct
130 Correct 7 ms 820 KB Output is correct
131 Correct 0 ms 348 KB Output is correct
132 Correct 170 ms 8872 KB Output is correct
133 Correct 206 ms 9524 KB Output is correct
134 Correct 137 ms 9188 KB Output is correct
135 Correct 120 ms 11904 KB Output is correct
136 Correct 136 ms 12816 KB Output is correct
137 Correct 131 ms 12676 KB Output is correct
138 Correct 164 ms 13044 KB Output is correct
139 Correct 196 ms 19436 KB Output is correct
140 Correct 130 ms 9168 KB Output is correct
141 Correct 206 ms 10284 KB Output is correct
142 Correct 200 ms 10512 KB Output is correct
143 Correct 196 ms 9624 KB Output is correct
144 Correct 161 ms 10564 KB Output is correct
145 Correct 169 ms 8812 KB Output is correct
146 Correct 120 ms 10932 KB Output is correct
147 Correct 165 ms 9832 KB Output is correct
148 Correct 143 ms 9432 KB Output is correct
149 Correct 173 ms 18460 KB Output is correct
150 Correct 152 ms 17948 KB Output is correct
151 Correct 144 ms 17008 KB Output is correct
152 Execution timed out 2075 ms 118552 KB Time limit exceeded
153 Halted 0 ms 0 KB -