oj.uz

Submission #952905

# Submission time Handle Problem Language Result Execution time Memory
952905 2024-03-25T04:51:06 Z SirCovidThe19th The short shank; Redemption (BOI21_prison) C++17
80 / 100
 2000 ms 94636 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;
			double v = 0;
			int c = 0; // count owo!!!
			node() {};
			node(double 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 + (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 + 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 348 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 344 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 484 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 360 KB Output is correct
2 Correct 552 ms 24148 KB Output is correct
3 Correct 497 ms 23892 KB Output is correct
4 Correct 496 ms 30844 KB Output is correct
5 Correct 452 ms 24132 KB Output is correct
6 Correct 384 ms 34676 KB Output is correct
7 Correct 558 ms 83120 KB Output is correct
8 Correct 387 ms 24796 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 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 344 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 484 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 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 344 KB Output is correct
23 Correct 4 ms 604 KB Output is correct
24 Correct 4 ms 604 KB Output is correct
25 Correct 5 ms 612 KB Output is correct
26 Correct 6 ms 604 KB Output is correct
27 Correct 4 ms 604 KB Output is correct
28 Correct 5 ms 604 KB Output is correct
29 Correct 6 ms 640 KB Output is correct
30 Correct 3 ms 604 KB Output is correct
31 Correct 3 ms 604 KB Output is correct
32 Correct 3 ms 604 KB Output is correct
33 Correct 3 ms 604 KB Output is correct
34 Correct 4 ms 648 KB Output is correct
35 Correct 4 ms 856 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 73 ms 4008 KB Output is correct
3 Correct 76 ms 3968 KB Output is correct
4 Correct 55 ms 4048 KB Output is correct
5 Correct 46 ms 7256 KB Output is correct
6 Correct 45 ms 6204 KB Output is correct
7 Correct 54 ms 6216 KB Output is correct
8 Correct 62 ms 7604 KB Output is correct
9 Correct 75 ms 13100 KB Output is correct
10 Correct 40 ms 4024 KB Output is correct

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 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 344 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 484 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 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 344 KB Output is correct
23 Correct 4 ms 604 KB Output is correct
24 Correct 4 ms 604 KB Output is correct
25 Correct 5 ms 612 KB Output is correct
26 Correct 6 ms 604 KB Output is correct
27 Correct 4 ms 604 KB Output is correct
28 Correct 5 ms 604 KB Output is correct
29 Correct 6 ms 640 KB Output is correct
30 Correct 3 ms 604 KB Output is correct
31 Correct 3 ms 604 KB Output is correct
32 Correct 3 ms 604 KB Output is correct
33 Correct 3 ms 604 KB Output is correct
34 Correct 4 ms 648 KB Output is correct
35 Correct 4 ms 856 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 73 ms 4008 KB Output is correct
38 Correct 76 ms 3968 KB Output is correct
39 Correct 55 ms 4048 KB Output is correct
40 Correct 46 ms 7256 KB Output is correct
41 Correct 45 ms 6204 KB Output is correct
42 Correct 54 ms 6216 KB Output is correct
43 Correct 62 ms 7604 KB Output is correct
44 Correct 75 ms 13100 KB Output is correct
45 Correct 40 ms 4024 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 500 KB Output is correct
53 Correct 1 ms 344 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 4 ms 604 KB Output is correct
58 Correct 4 ms 644 KB Output is correct
59 Correct 4 ms 600 KB Output is correct
60 Correct 7 ms 600 KB Output is correct
61 Correct 4 ms 600 KB Output is correct
62 Correct 4 ms 600 KB Output is correct
63 Correct 4 ms 604 KB Output is correct
64 Correct 3 ms 604 KB Output is correct
65 Correct 5 ms 604 KB Output is correct
66 Correct 3 ms 604 KB Output is correct
67 Correct 3 ms 604 KB Output is correct
68 Correct 4 ms 604 KB Output is correct
69 Correct 4 ms 604 KB Output is correct
70 Correct 0 ms 348 KB Output is correct
71 Correct 92 ms 3932 KB Output is correct
72 Correct 81 ms 3976 KB Output is correct
73 Correct 51 ms 3948 KB Output is correct
74 Correct 43 ms 7012 KB Output is correct
75 Correct 47 ms 6328 KB Output is correct
76 Correct 64 ms 6072 KB Output is correct
77 Correct 61 ms 7612 KB Output is correct
78 Correct 66 ms 12992 KB Output is correct
79 Correct 44 ms 4264 KB Output is correct
80 Correct 75 ms 3932 KB Output is correct
81 Correct 70 ms 3980 KB Output is correct
82 Correct 74 ms 3932 KB Output is correct
83 Correct 64 ms 5780 KB Output is correct
84 Correct 65 ms 3968 KB Output is correct
85 Correct 48 ms 5304 KB Output is correct
86 Correct 52 ms 5124 KB Output is correct
87 Correct 49 ms 4376 KB Output is correct
88 Correct 47 ms 12204 KB Output is correct
89 Correct 49 ms 12728 KB Output is correct
90 Correct 51 ms 10416 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 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 344 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 484 KB Output is correct
12 Correct 0 ms 360 KB Output is correct
13 Correct 552 ms 24148 KB Output is correct
14 Correct 497 ms 23892 KB Output is correct
15 Correct 496 ms 30844 KB Output is correct
16 Correct 452 ms 24132 KB Output is correct
17 Correct 384 ms 34676 KB Output is correct
18 Correct 558 ms 83120 KB Output is correct
19 Correct 387 ms 24796 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 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 344 KB Output is correct
31 Correct 4 ms 604 KB Output is correct
32 Correct 4 ms 604 KB Output is correct
33 Correct 5 ms 612 KB Output is correct
34 Correct 6 ms 604 KB Output is correct
35 Correct 4 ms 604 KB Output is correct
36 Correct 5 ms 604 KB Output is correct
37 Correct 6 ms 640 KB Output is correct
38 Correct 3 ms 604 KB Output is correct
39 Correct 3 ms 604 KB Output is correct
40 Correct 3 ms 604 KB Output is correct
41 Correct 3 ms 604 KB Output is correct
42 Correct 4 ms 648 KB Output is correct
43 Correct 4 ms 856 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 73 ms 4008 KB Output is correct
46 Correct 76 ms 3968 KB Output is correct
47 Correct 55 ms 4048 KB Output is correct
48 Correct 46 ms 7256 KB Output is correct
49 Correct 45 ms 6204 KB Output is correct
50 Correct 54 ms 6216 KB Output is correct
51 Correct 62 ms 7604 KB Output is correct
52 Correct 75 ms 13100 KB Output is correct
53 Correct 40 ms 4024 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 500 KB Output is correct
61 Correct 1 ms 344 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 4 ms 604 KB Output is correct
66 Correct 4 ms 644 KB Output is correct
67 Correct 4 ms 600 KB Output is correct
68 Correct 7 ms 600 KB Output is correct
69 Correct 4 ms 600 KB Output is correct
70 Correct 4 ms 600 KB Output is correct
71 Correct 4 ms 604 KB Output is correct
72 Correct 3 ms 604 KB Output is correct
73 Correct 5 ms 604 KB Output is correct
74 Correct 3 ms 604 KB Output is correct
75 Correct 3 ms 604 KB Output is correct
76 Correct 4 ms 604 KB Output is correct
77 Correct 4 ms 604 KB Output is correct
78 Correct 0 ms 348 KB Output is correct
79 Correct 92 ms 3932 KB Output is correct
80 Correct 81 ms 3976 KB Output is correct
81 Correct 51 ms 3948 KB Output is correct
82 Correct 43 ms 7012 KB Output is correct
83 Correct 47 ms 6328 KB Output is correct
84 Correct 64 ms 6072 KB Output is correct
85 Correct 61 ms 7612 KB Output is correct
86 Correct 66 ms 12992 KB Output is correct
87 Correct 44 ms 4264 KB Output is correct
88 Correct 75 ms 3932 KB Output is correct
89 Correct 70 ms 3980 KB Output is correct
90 Correct 74 ms 3932 KB Output is correct
91 Correct 64 ms 5780 KB Output is correct
92 Correct 65 ms 3968 KB Output is correct
93 Correct 48 ms 5304 KB Output is correct
94 Correct 52 ms 5124 KB Output is correct
95 Correct 49 ms 4376 KB Output is correct
96 Correct 47 ms 12204 KB Output is correct
97 Correct 49 ms 12728 KB Output is correct
98 Correct 51 ms 10416 KB Output is correct
99 Correct 1 ms 344 KB Output is correct
100 Correct 1 ms 452 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 348 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 344 KB Output is correct
108 Correct 1 ms 348 KB Output is correct
109 Correct 1 ms 348 KB Output is correct
110 Correct 1 ms 348 KB Output is correct
111 Correct 524 ms 23940 KB Output is correct
112 Correct 489 ms 23904 KB Output is correct
113 Correct 491 ms 28780 KB Output is correct
114 Correct 468 ms 23892 KB Output is correct
115 Correct 390 ms 34896 KB Output is correct
116 Correct 569 ms 83024 KB Output is correct
117 Correct 380 ms 24672 KB Output is correct
118 Correct 4 ms 600 KB Output is correct
119 Correct 4 ms 604 KB Output is correct
120 Correct 4 ms 604 KB Output is correct
121 Correct 4 ms 604 KB Output is correct
122 Correct 4 ms 604 KB Output is correct
123 Correct 4 ms 604 KB Output is correct
124 Correct 5 ms 600 KB Output is correct
125 Correct 4 ms 604 KB Output is correct
126 Correct 3 ms 604 KB Output is correct
127 Correct 2 ms 600 KB Output is correct
128 Correct 3 ms 600 KB Output is correct
129 Correct 4 ms 604 KB Output is correct
130 Correct 5 ms 604 KB Output is correct
131 Correct 1 ms 348 KB Output is correct
132 Correct 72 ms 3924 KB Output is correct
133 Correct 75 ms 3968 KB Output is correct
134 Correct 50 ms 4044 KB Output is correct
135 Correct 44 ms 7076 KB Output is correct
136 Correct 46 ms 6328 KB Output is correct
137 Correct 64 ms 6068 KB Output is correct
138 Correct 56 ms 7604 KB Output is correct
139 Correct 52 ms 12976 KB Output is correct
140 Correct 40 ms 4020 KB Output is correct
141 Correct 85 ms 3860 KB Output is correct
142 Correct 79 ms 3932 KB Output is correct
143 Correct 75 ms 3928 KB Output is correct
144 Correct 63 ms 5780 KB Output is correct
145 Correct 65 ms 3968 KB Output is correct
146 Correct 43 ms 5304 KB Output is correct
147 Correct 59 ms 5204 KB Output is correct
148 Correct 49 ms 4276 KB Output is correct
149 Correct 48 ms 12208 KB Output is correct
150 Correct 51 ms 12728 KB Output is correct
151 Correct 48 ms 10608 KB Output is correct
152 Execution timed out 2037 ms 94636 KB Time limit exceeded
153 Halted 0 ms 0 KB -