oj.uz

답안 #910101

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
910101 2024-01-17T22:15:13 Z MinaRagy06 Inside information (BOI21_servers) C++17
50 / 100
 452 ms 138592 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(adj[i])) prv = adj[i][par][1];
	dp[i][par] = 1;
	for (int j = 0; j < SZ(adj[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

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 69208 KB Output is correct
2 Correct 41 ms 70484 KB Output is correct
3 Correct 49 ms 70484 KB Output is correct
4 Correct 43 ms 70480 KB Output is correct
5 Correct 50 ms 70628 KB Output is correct
6 Correct 49 ms 70484 KB Output is correct

Subtask #2
0 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 69208 KB Output is correct
2 Correct 41 ms 70484 KB Output is correct
3 Correct 49 ms 70484 KB Output is correct
4 Correct 43 ms 70480 KB Output is correct
5 Correct 50 ms 70628 KB Output is correct
6 Correct 49 ms 70484 KB Output is correct
7 Runtime error 102 ms 138576 KB Execution killed with signal 11
8 Halted 0 ms 0 KB -

Subtask #3
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 69204 KB Output is correct
2 Correct 367 ms 93364 KB Output is correct
3 Correct 408 ms 93208 KB Output is correct

Subtask #4
0 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 69204 KB Output is correct
2 Correct 367 ms 93364 KB Output is correct
3 Correct 408 ms 93208 KB Output is correct
4 Runtime error 89 ms 138580 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 69200 KB Output is correct
2 Correct 260 ms 96468 KB Output is correct
3 Correct 261 ms 96080 KB Output is correct
4 Correct 191 ms 95944 KB Output is correct

Subtask #6
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 69200 KB Output is correct
2 Correct 260 ms 96468 KB Output is correct
3 Correct 261 ms 96080 KB Output is correct
4 Correct 191 ms 95944 KB Output is correct
5 Runtime error 90 ms 138592 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 69204 KB Output is correct
2 Correct 189 ms 94120 KB Output is correct
3 Correct 279 ms 95100 KB Output is correct

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 69204 KB Output is correct
2 Correct 189 ms 94120 KB Output is correct
3 Correct 279 ms 95100 KB Output is correct
4 Runtime error 91 ms 138576 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -

Subtask #9
12.5 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 69204 KB Output is correct
2 Correct 266 ms 96348 KB Output is correct
3 Correct 252 ms 96192 KB Output is correct
4 Correct 209 ms 96304 KB Output is correct
5 Correct 38 ms 69532 KB Output is correct
6 Correct 199 ms 94288 KB Output is correct
7 Correct 271 ms 94676 KB Output is correct
8 Correct 274 ms 95516 KB Output is correct
9 Correct 364 ms 95572 KB Output is correct
10 Correct 396 ms 98212 KB Output is correct
11 Correct 452 ms 97700 KB Output is correct

Subtask #10
0 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 69204 KB Output is correct
2 Correct 266 ms 96348 KB Output is correct
3 Correct 252 ms 96192 KB Output is correct
4 Correct 209 ms 96304 KB Output is correct
5 Correct 38 ms 69532 KB Output is correct
6 Correct 199 ms 94288 KB Output is correct
7 Correct 271 ms 94676 KB Output is correct
8 Correct 274 ms 95516 KB Output is correct
9 Correct 364 ms 95572 KB Output is correct
10 Correct 396 ms 98212 KB Output is correct
11 Correct 452 ms 97700 KB Output is correct
12 Runtime error 89 ms 138456 KB Execution killed with signal 11
13 Halted 0 ms 0 KB -

Subtask #11
17.5 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 69204 KB Output is correct
2 Correct 43 ms 70400 KB Output is correct
3 Correct 50 ms 70484 KB Output is correct
4 Correct 56 ms 70736 KB Output is correct
5 Correct 41 ms 70548 KB Output is correct
6 Correct 52 ms 70484 KB Output is correct
7 Correct 39 ms 69348 KB Output is correct
8 Correct 420 ms 93340 KB Output is correct
9 Correct 364 ms 93248 KB Output is correct
10 Correct 34 ms 69204 KB Output is correct
11 Correct 273 ms 96032 KB Output is correct
12 Correct 244 ms 96276 KB Output is correct
13 Correct 211 ms 96136 KB Output is correct
14 Correct 35 ms 69200 KB Output is correct
15 Correct 191 ms 94232 KB Output is correct
16 Correct 289 ms 94544 KB Output is correct
17 Correct 266 ms 95568 KB Output is correct
18 Correct 341 ms 95488 KB Output is correct
19 Correct 401 ms 98120 KB Output is correct
20 Correct 439 ms 97876 KB Output is correct
21 Correct 362 ms 93884 KB Output is correct
22 Correct 367 ms 94576 KB Output is correct
23 Correct 349 ms 94984 KB Output is correct
24 Correct 334 ms 95276 KB Output is correct
25 Correct 345 ms 93888 KB Output is correct
26 Correct 301 ms 93264 KB Output is correct
27 Correct 263 ms 93268 KB Output is correct

Subtask #12
0 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 69204 KB Output is correct
2 Correct 43 ms 70400 KB Output is correct
3 Correct 50 ms 70484 KB Output is correct
4 Correct 56 ms 70736 KB Output is correct
5 Correct 41 ms 70548 KB Output is correct
6 Correct 52 ms 70484 KB Output is correct
7 Correct 39 ms 69348 KB Output is correct
8 Correct 420 ms 93340 KB Output is correct
9 Correct 364 ms 93248 KB Output is correct
10 Correct 34 ms 69204 KB Output is correct
11 Correct 273 ms 96032 KB Output is correct
12 Correct 244 ms 96276 KB Output is correct
13 Correct 211 ms 96136 KB Output is correct
14 Correct 35 ms 69200 KB Output is correct
15 Correct 191 ms 94232 KB Output is correct
16 Correct 289 ms 94544 KB Output is correct
17 Correct 266 ms 95568 KB Output is correct
18 Correct 341 ms 95488 KB Output is correct
19 Correct 401 ms 98120 KB Output is correct
20 Correct 439 ms 97876 KB Output is correct
21 Correct 362 ms 93884 KB Output is correct
22 Correct 367 ms 94576 KB Output is correct
23 Correct 349 ms 94984 KB Output is correct
24 Correct 334 ms 95276 KB Output is correct
25 Correct 345 ms 93888 KB Output is correct
26 Correct 301 ms 93264 KB Output is correct
27 Correct 263 ms 93268 KB Output is correct
28 Runtime error 93 ms 138576 KB Execution killed with signal 11
29 Halted 0 ms 0 KB -