oj.uz

Submission #952893

# Submission time Handle Problem Language Result Execution time Memory
952893 2024-03-25T04:41:40 Z tacocat The short shank; Redemption (BOI21_prison) C++14
80 / 100
 2000 ms 99776 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; _ < 33; _++) {//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 344 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 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 344 KB Output is correct
2 Correct 1063 ms 40680 KB Output is correct
3 Correct 1080 ms 40460 KB Output is correct
4 Correct 1018 ms 44468 KB Output is correct
5 Correct 910 ms 41372 KB Output is correct
6 Correct 898 ms 51616 KB Output is correct
7 Correct 1130 ms 99564 KB Output is correct
8 Correct 875 ms 41304 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 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 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 760 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 344 KB Output is correct
20 Correct 1 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 9 ms 732 KB Output is correct
24 Correct 8 ms 732 KB Output is correct
25 Correct 7 ms 732 KB Output is correct
26 Correct 8 ms 860 KB Output is correct
27 Correct 8 ms 732 KB Output is correct
28 Correct 8 ms 732 KB Output is correct
29 Correct 7 ms 728 KB Output is correct
30 Correct 8 ms 732 KB Output is correct
31 Correct 6 ms 732 KB Output is correct
32 Correct 5 ms 732 KB Output is correct
33 Correct 5 ms 732 KB Output is correct
34 Correct 7 ms 872 KB Output is correct
35 Correct 7 ms 784 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 198 ms 9312 KB Output is correct
3 Correct 178 ms 8924 KB Output is correct
4 Correct 149 ms 9968 KB Output is correct
5 Correct 121 ms 12536 KB Output is correct
6 Correct 114 ms 10560 KB Output is correct
7 Correct 159 ms 11800 KB Output is correct
8 Correct 153 ms 12372 KB Output is correct
9 Correct 155 ms 18504 KB Output is correct
10 Correct 141 ms 8504 KB Output is correct

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 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 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 760 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 344 KB Output is correct
20 Correct 1 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 9 ms 732 KB Output is correct
24 Correct 8 ms 732 KB Output is correct
25 Correct 7 ms 732 KB Output is correct
26 Correct 8 ms 860 KB Output is correct
27 Correct 8 ms 732 KB Output is correct
28 Correct 8 ms 732 KB Output is correct
29 Correct 7 ms 728 KB Output is correct
30 Correct 8 ms 732 KB Output is correct
31 Correct 6 ms 732 KB Output is correct
32 Correct 5 ms 732 KB Output is correct
33 Correct 5 ms 732 KB Output is correct
34 Correct 7 ms 872 KB Output is correct
35 Correct 7 ms 784 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 198 ms 9312 KB Output is correct
38 Correct 178 ms 8924 KB Output is correct
39 Correct 149 ms 9968 KB Output is correct
40 Correct 121 ms 12536 KB Output is correct
41 Correct 114 ms 10560 KB Output is correct
42 Correct 159 ms 11800 KB Output is correct
43 Correct 153 ms 12372 KB Output is correct
44 Correct 155 ms 18504 KB Output is correct
45 Correct 141 ms 8504 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 348 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 344 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 348 KB Output is correct
57 Correct 8 ms 728 KB Output is correct
58 Correct 8 ms 728 KB Output is correct
59 Correct 7 ms 984 KB Output is correct
60 Correct 9 ms 732 KB Output is correct
61 Correct 11 ms 732 KB Output is correct
62 Correct 8 ms 860 KB Output is correct
63 Correct 8 ms 732 KB Output is correct
64 Correct 6 ms 860 KB Output is correct
65 Correct 6 ms 808 KB Output is correct
66 Correct 7 ms 732 KB Output is correct
67 Correct 5 ms 984 KB Output is correct
68 Correct 7 ms 860 KB Output is correct
69 Correct 7 ms 788 KB Output is correct
70 Correct 0 ms 348 KB Output is correct
71 Correct 187 ms 9628 KB Output is correct
72 Correct 173 ms 8160 KB Output is correct
73 Correct 128 ms 8208 KB Output is correct
74 Correct 118 ms 12288 KB Output is correct
75 Correct 112 ms 10848 KB Output is correct
76 Correct 164 ms 11600 KB Output is correct
77 Correct 152 ms 12692 KB Output is correct
78 Correct 146 ms 17684 KB Output is correct
79 Correct 144 ms 9556 KB Output is correct
80 Correct 176 ms 9416 KB Output is correct
81 Correct 170 ms 9652 KB Output is correct
82 Correct 171 ms 9416 KB Output is correct
83 Correct 148 ms 10240 KB Output is correct
84 Correct 184 ms 9840 KB Output is correct
85 Correct 95 ms 11180 KB Output is correct
86 Correct 132 ms 9788 KB Output is correct
87 Correct 134 ms 9440 KB Output is correct
88 Correct 137 ms 18216 KB Output is correct
89 Correct 170 ms 18404 KB Output is correct
90 Correct 143 ms 16432 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 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 344 KB Output is correct
13 Correct 1063 ms 40680 KB Output is correct
14 Correct 1080 ms 40460 KB Output is correct
15 Correct 1018 ms 44468 KB Output is correct
16 Correct 910 ms 41372 KB Output is correct
17 Correct 898 ms 51616 KB Output is correct
18 Correct 1130 ms 99564 KB Output is correct
19 Correct 875 ms 41304 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 760 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 344 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 9 ms 732 KB Output is correct
32 Correct 8 ms 732 KB Output is correct
33 Correct 7 ms 732 KB Output is correct
34 Correct 8 ms 860 KB Output is correct
35 Correct 8 ms 732 KB Output is correct
36 Correct 8 ms 732 KB Output is correct
37 Correct 7 ms 728 KB Output is correct
38 Correct 8 ms 732 KB Output is correct
39 Correct 6 ms 732 KB Output is correct
40 Correct 5 ms 732 KB Output is correct
41 Correct 5 ms 732 KB Output is correct
42 Correct 7 ms 872 KB Output is correct
43 Correct 7 ms 784 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 198 ms 9312 KB Output is correct
46 Correct 178 ms 8924 KB Output is correct
47 Correct 149 ms 9968 KB Output is correct
48 Correct 121 ms 12536 KB Output is correct
49 Correct 114 ms 10560 KB Output is correct
50 Correct 159 ms 11800 KB Output is correct
51 Correct 153 ms 12372 KB Output is correct
52 Correct 155 ms 18504 KB Output is correct
53 Correct 141 ms 8504 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 348 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 344 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 348 KB Output is correct
65 Correct 8 ms 728 KB Output is correct
66 Correct 8 ms 728 KB Output is correct
67 Correct 7 ms 984 KB Output is correct
68 Correct 9 ms 732 KB Output is correct
69 Correct 11 ms 732 KB Output is correct
70 Correct 8 ms 860 KB Output is correct
71 Correct 8 ms 732 KB Output is correct
72 Correct 6 ms 860 KB Output is correct
73 Correct 6 ms 808 KB Output is correct
74 Correct 7 ms 732 KB Output is correct
75 Correct 5 ms 984 KB Output is correct
76 Correct 7 ms 860 KB Output is correct
77 Correct 7 ms 788 KB Output is correct
78 Correct 0 ms 348 KB Output is correct
79 Correct 187 ms 9628 KB Output is correct
80 Correct 173 ms 8160 KB Output is correct
81 Correct 128 ms 8208 KB Output is correct
82 Correct 118 ms 12288 KB Output is correct
83 Correct 112 ms 10848 KB Output is correct
84 Correct 164 ms 11600 KB Output is correct
85 Correct 152 ms 12692 KB Output is correct
86 Correct 146 ms 17684 KB Output is correct
87 Correct 144 ms 9556 KB Output is correct
88 Correct 176 ms 9416 KB Output is correct
89 Correct 170 ms 9652 KB Output is correct
90 Correct 171 ms 9416 KB Output is correct
91 Correct 148 ms 10240 KB Output is correct
92 Correct 184 ms 9840 KB Output is correct
93 Correct 95 ms 11180 KB Output is correct
94 Correct 132 ms 9788 KB Output is correct
95 Correct 134 ms 9440 KB Output is correct
96 Correct 137 ms 18216 KB Output is correct
97 Correct 170 ms 18404 KB Output is correct
98 Correct 143 ms 16432 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 348 KB Output is correct
102 Correct 1 ms 344 KB Output is correct
103 Correct 1 ms 600 KB Output is correct
104 Correct 1 ms 504 KB Output is correct
105 Correct 1 ms 344 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 0 ms 348 KB Output is correct
111 Correct 1071 ms 40416 KB Output is correct
112 Correct 1056 ms 40608 KB Output is correct
113 Correct 1012 ms 44444 KB Output is correct
114 Correct 999 ms 40432 KB Output is correct
115 Correct 902 ms 51504 KB Output is correct
116 Correct 1138 ms 99776 KB Output is correct
117 Correct 849 ms 41252 KB Output is correct
118 Correct 7 ms 1112 KB Output is correct
119 Correct 8 ms 732 KB Output is correct
120 Correct 7 ms 732 KB Output is correct
121 Correct 8 ms 732 KB Output is correct
122 Correct 8 ms 732 KB Output is correct
123 Correct 10 ms 732 KB Output is correct
124 Correct 7 ms 732 KB Output is correct
125 Correct 6 ms 732 KB Output is correct
126 Correct 6 ms 732 KB Output is correct
127 Correct 6 ms 732 KB Output is correct
128 Correct 5 ms 984 KB Output is correct
129 Correct 7 ms 732 KB Output is correct
130 Correct 7 ms 792 KB Output is correct
131 Correct 1 ms 348 KB Output is correct
132 Correct 177 ms 8600 KB Output is correct
133 Correct 177 ms 8652 KB Output is correct
134 Correct 131 ms 8384 KB Output is correct
135 Correct 136 ms 11176 KB Output is correct
136 Correct 109 ms 10500 KB Output is correct
137 Correct 133 ms 10356 KB Output is correct
138 Correct 152 ms 13520 KB Output is correct
139 Correct 152 ms 18216 KB Output is correct
140 Correct 130 ms 9004 KB Output is correct
141 Correct 184 ms 9276 KB Output is correct
142 Correct 167 ms 9188 KB Output is correct
143 Correct 173 ms 9608 KB Output is correct
144 Correct 152 ms 10368 KB Output is correct
145 Correct 153 ms 8736 KB Output is correct
146 Correct 114 ms 10432 KB Output is correct
147 Correct 143 ms 9920 KB Output is correct
148 Correct 138 ms 10020 KB Output is correct
149 Correct 142 ms 16520 KB Output is correct
150 Correct 144 ms 18800 KB Output is correct
151 Correct 146 ms 14876 KB Output is correct
152 Execution timed out 2020 ms 98984 KB Time limit exceeded
153 Halted 0 ms 0 KB -