oj.uz

Submission #910102

# Submission time Handle Problem Language Result Execution time Memory
910102 2024-01-17T22:16:34 Z MinaRagy06 Inside information (BOI21_servers) C++17
50 / 100
 3500 ms 97004 KB 
#include <bits/stdc++.h>
using namespace std;
typedef int64_t ll;
#define SZ(x) (int) x.size()

const int N = 120'005;
vector<array<int, 3>> adj[N];
//0: increasing, 1: decreasing, {ancestor, last weight}
array<int, 3> bl[2][18][N];
int st[N], en[N], curt;
void dfs(int i, int par, int part) {
	bl[0][0][i] = {par, part, part};
	bl[1][0][i] = {par, part, part};
	for (int j = 1; j < 18; j++) {
		bl[0][j][i] = bl[0][j - 1][i];
		auto [lst, lstt, mx] = bl[0][j][i];
		if (lstt <= bl[0][0][lst][1]) {
			bl[0][j][i] = bl[0][j - 1][lst];
			bl[0][j][i][2] = max(bl[0][j][i][2], mx);
		}
	}
	for (int j = 1; j < 18; j++) {
		bl[1][j][i] = bl[1][j - 1][i];
		auto [lst, lstt, mx] = bl[1][j][i];
		if (lstt >= bl[1][0][lst][1]) {
			bl[1][j][i] = bl[1][j - 1][lst];
			bl[1][j][i][2] = max(bl[1][j][i][2], mx);
		}
	}
	st[i] = curt++;
	for (auto [nxt, t, nxtidx] : adj[i]) {
		if (nxt == par) continue;
		dfs(nxt, i, t);
	}
	en[i] = curt;
}
bool lca(int l, int b) {
	if (st[l] <= st[b] && en[b] <= en[l]) {
		return 1;
	}
	return 0;
}
array<int, 2> check(int t, int a, int b) {
	int mx = -1e9, high = bl[t][17][a][0];
	if (!lca(high, b)) {
		return {int(1e9), 0};
	}
	if (a == high || lca(a, b)) {
		return {int(-1e9), (t == 1? 1 : -1) * int(1e9)};
	}
	for (int j = 17; j >= 0; j--) {
		if (!lca(bl[t][j][a][0], b) && !lca(bl[t][j][a][0], high)) {
			mx = max(mx, bl[t][j][a][2]);
			a = bl[t][j][a][0];
		}
	}
	return {max(mx, bl[t][0][a][2]), bl[t][0][a][1]};
}
vector<array<int, 3>> curadj[N];
vector<int> dp[N];
int solve(int i, int par) {
	int prv = -1;
	if (par < SZ(curadj[i])) prv = adj[i][par][1];
	dp[i][par] = 1;
	for (int j = 0; j < SZ(curadj[i]); j++) {
		auto [nxt, t, nxtidx] = curadj[i][j];
		if (j == par || prv >= t) continue;
		dp[i][par] += solve(nxt, nxtidx);
	}
	return dp[i][par];
}
int main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	int n, q;
	cin >> n >> q;
	q += n - 1;
	pair<char, vector<int>> v[q];
	for (int i = 0; i < q; i++) {
		cin >> v[i].first;
		if (v[i].first == 'S') {
			int a, b;
			cin >> a >> b;
			int x = adj[b].size(), y = adj[a].size();
			adj[a].push_back({b, i, x});
			adj[b].push_back({a, i, y});
			v[i].second = {a, b};
		} else if (v[i].first == 'Q') {
			int a, b;
			cin >> a >> b;
			v[i].second = {a, b};
		} else {
			int a;
			cin >> a;
			v[i].second = {a};
		}
	}
	dfs(1, 1, 0);
	for (int i = 1; i <= n; i++) {
		dp[i].resize(adj[i].size() + 1);
	}
	auto recalc = [&] () {
		for (int i = 1; i <= n; i++) {
			for (int j = 0; j <= SZ(adj[i]); j++) {
				dp[i][j] = -1;
			}
		}
		for (int i = 1; i <= n; i++) {
			for (int j = 0; j <= SZ(adj[i]); j++) {
				solve(i, j);
			}
		}
	};
	for (int i = 0; i < q; i++) {
		if (v[i].first == 'S') {
			int a = v[i].second[0], b = v[i].second[1];
			int x = curadj[b].size(), y = curadj[a].size();
			curadj[a].push_back({b, i, x});
			curadj[b].push_back({a, i, y});
		} else if (v[i].first == 'Q') {
			int a = v[i].second[0], b = v[i].second[1];
			array<int, 2> l = check(1, a, b), r = check(0, b, a);
			if (l[0] <= i && r[0] <= i && l[1] >= r[1]) {
				cout << "yes\n";
			} else {
				cout << "no\n";
			}
		} else {
			recalc();
			int x = v[i].second[0];
			cout << dp[x][adj[x].size()] << '\n';
		}
	}
	return 0;
}

Subtask #1
2.5 / 2.5

# Verdict Execution time Memory Grader output
1 Correct 37 ms 69204 KB Output is correct
2 Correct 42 ms 69968 KB Output is correct
3 Correct 48 ms 70564 KB Output is correct
4 Correct 46 ms 70224 KB Output is correct
5 Correct 41 ms 70276 KB Output is correct
6 Correct 50 ms 70008 KB Output is correct

Subtask #2
0 / 2.5

# Verdict Execution time Memory Grader output
1 Correct 37 ms 69204 KB Output is correct
2 Correct 42 ms 69968 KB Output is correct
3 Correct 48 ms 70564 KB Output is correct
4 Correct 46 ms 70224 KB Output is correct
5 Correct 41 ms 70276 KB Output is correct
6 Correct 50 ms 70008 KB Output is correct
7 Correct 84 ms 69108 KB Output is correct
8 Execution timed out 3568 ms 69996 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #3
2.5 / 2.5

# Verdict Execution time Memory Grader output
1 Correct 37 ms 69200 KB Output is correct
2 Correct 370 ms 92160 KB Output is correct
3 Correct 358 ms 92352 KB Output is correct

Subtask #4
0 / 2.5

# Verdict Execution time Memory Grader output
1 Correct 37 ms 69200 KB Output is correct
2 Correct 370 ms 92160 KB Output is correct
3 Correct 358 ms 92352 KB Output is correct
4 Correct 178 ms 69204 KB Output is correct
5 Execution timed out 3534 ms 87600 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 69200 KB Output is correct
2 Correct 242 ms 94876 KB Output is correct
3 Correct 246 ms 94624 KB Output is correct
4 Correct 172 ms 94552 KB Output is correct

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 69200 KB Output is correct
2 Correct 242 ms 94876 KB Output is correct
3 Correct 246 ms 94624 KB Output is correct
4 Correct 172 ms 94552 KB Output is correct
5 Correct 56 ms 69164 KB Output is correct
6 Execution timed out 3579 ms 91940 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 69200 KB Output is correct
2 Correct 184 ms 92560 KB Output is correct
3 Correct 258 ms 93248 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 69200 KB Output is correct
2 Correct 184 ms 92560 KB Output is correct
3 Correct 258 ms 93248 KB Output is correct
4 Correct 61 ms 69200 KB Output is correct
5 Execution timed out 3533 ms 88324 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #9
12.5 / 12.5

# Verdict Execution time Memory Grader output
1 Correct 33 ms 69064 KB Output is correct
2 Correct 264 ms 94760 KB Output is correct
3 Correct 243 ms 94560 KB Output is correct
4 Correct 186 ms 94588 KB Output is correct
5 Correct 34 ms 69200 KB Output is correct
6 Correct 178 ms 92752 KB Output is correct
7 Correct 257 ms 93244 KB Output is correct
8 Correct 268 ms 94036 KB Output is correct
9 Correct 320 ms 94032 KB Output is correct
10 Correct 384 ms 97004 KB Output is correct
11 Correct 401 ms 96340 KB Output is correct

Subtask #10
0 / 12.5

# Verdict Execution time Memory Grader output
1 Correct 33 ms 69064 KB Output is correct
2 Correct 264 ms 94760 KB Output is correct
3 Correct 243 ms 94560 KB Output is correct
4 Correct 186 ms 94588 KB Output is correct
5 Correct 34 ms 69200 KB Output is correct
6 Correct 178 ms 92752 KB Output is correct
7 Correct 257 ms 93244 KB Output is correct
8 Correct 268 ms 94036 KB Output is correct
9 Correct 320 ms 94032 KB Output is correct
10 Correct 384 ms 97004 KB Output is correct
11 Correct 401 ms 96340 KB Output is correct
12 Correct 52 ms 69204 KB Output is correct
13 Execution timed out 3559 ms 92344 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #11
17.5 / 17.5

# Verdict Execution time Memory Grader output
1 Correct 39 ms 69200 KB Output is correct
2 Correct 41 ms 69968 KB Output is correct
3 Correct 47 ms 70228 KB Output is correct
4 Correct 46 ms 70224 KB Output is correct
5 Correct 40 ms 70224 KB Output is correct
6 Correct 49 ms 70020 KB Output is correct
7 Correct 38 ms 69204 KB Output is correct
8 Correct 361 ms 92548 KB Output is correct
9 Correct 367 ms 92300 KB Output is correct
10 Correct 33 ms 69200 KB Output is correct
11 Correct 249 ms 94532 KB Output is correct
12 Correct 239 ms 94544 KB Output is correct
13 Correct 175 ms 94908 KB Output is correct
14 Correct 33 ms 69016 KB Output is correct
15 Correct 178 ms 92756 KB Output is correct
16 Correct 270 ms 93368 KB Output is correct
17 Correct 277 ms 94032 KB Output is correct
18 Correct 338 ms 94208 KB Output is correct
19 Correct 368 ms 96812 KB Output is correct
20 Correct 400 ms 96412 KB Output is correct
21 Correct 321 ms 92552 KB Output is correct
22 Correct 345 ms 92944 KB Output is correct
23 Correct 321 ms 93524 KB Output is correct
24 Correct 338 ms 93660 KB Output is correct
25 Correct 348 ms 92168 KB Output is correct
26 Correct 276 ms 92200 KB Output is correct
27 Correct 251 ms 91948 KB Output is correct

Subtask #12
0 / 17.5

# Verdict Execution time Memory Grader output
1 Correct 39 ms 69200 KB Output is correct
2 Correct 41 ms 69968 KB Output is correct
3 Correct 47 ms 70228 KB Output is correct
4 Correct 46 ms 70224 KB Output is correct
5 Correct 40 ms 70224 KB Output is correct
6 Correct 49 ms 70020 KB Output is correct
7 Correct 38 ms 69204 KB Output is correct
8 Correct 361 ms 92548 KB Output is correct
9 Correct 367 ms 92300 KB Output is correct
10 Correct 33 ms 69200 KB Output is correct
11 Correct 249 ms 94532 KB Output is correct
12 Correct 239 ms 94544 KB Output is correct
13 Correct 175 ms 94908 KB Output is correct
14 Correct 33 ms 69016 KB Output is correct
15 Correct 178 ms 92756 KB Output is correct
16 Correct 270 ms 93368 KB Output is correct
17 Correct 277 ms 94032 KB Output is correct
18 Correct 338 ms 94208 KB Output is correct
19 Correct 368 ms 96812 KB Output is correct
20 Correct 400 ms 96412 KB Output is correct
21 Correct 321 ms 92552 KB Output is correct
22 Correct 345 ms 92944 KB Output is correct
23 Correct 321 ms 93524 KB Output is correct
24 Correct 338 ms 93660 KB Output is correct
25 Correct 348 ms 92168 KB Output is correct
26 Correct 276 ms 92200 KB Output is correct
27 Correct 251 ms 91948 KB Output is correct
28 Correct 84 ms 68692 KB Output is correct
29 Execution timed out 3541 ms 70108 KB Time limit exceeded
30 Halted 0 ms 0 KB -