oj.uz

답안 #912799

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
912799 2024-01-19T23:38:20 Z MinaRagy06 Inside information (BOI21_servers) C++17
70 / 100
 3500 ms 344912 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
typedef int64_t ll;
#define SZ(x) (int) x.size()

const int N = 120'005, LOG = 18, B = 300, inf = 1e9;
vector<array<int, 3>> adj[N];
vector<int> dp[N];
int lst;
int solve(int i, int par) {
	if (~dp[i][par]) return dp[i][par];
	int j = (par == SZ(adj[i])? 0 : par + 1);
	dp[i][par] = 1;
	if (j < SZ(adj[i])) {
		if (adj[i][j][1] > lst) return dp[i][par];
		dp[i][par] += solve(adj[i][j][0], adj[i][j][2]) + solve(i, j) - 1;
	}
	return dp[i][par];
}
int st[N], en[N], curt, eulerst[N], euleren[N], eulert;
array<int, 2> par[N];
bool isanc(int u, int v) {
	return st[u] <= st[v] && en[v] <= en[u];
}
struct sparse {
	array<int, 2> a[2 * N][LOG + 1];
	int n;
	int logs[2 * N];
	void build(int _n) {
		n = _n;
		logs[1] = 0;
		for (int j = 2; j <= n; j++) {
			logs[j] = logs[j >> 1] + 1;
		}
		for (int j = 1; j <= LOG; j++) {
			for (int i = 0; i + (1 << (j - 1)) < n; i++) {
				a[i][j] = min(a[i][j - 1], a[i + (1 << (j - 1))][j - 1]);
			}
		}
	}
	int query(int u, int v) {
		if (st[u] > st[v]) swap(u, v);
		if (isanc(u, v)) {
			return u;
		}
		int l = en[u], r = st[v];
		int lg = logs[r - l + 1];
		array<int, 2> mn = min(a[l][lg], a[r - (1 << lg) + 1][lg]);
		return mn[1];
	}
} lca;
void dfs(int i, int h, int p, int part) {
	lca.a[curt][0] = {h, i};
	st[i] = curt++;
	eulerst[i] = eulert++;
	par[i] = {p, part};
	for (int j = 0; j < SZ(adj[i]); j++) {
		auto [nxt, t, nxtidx] = adj[i][j];
		if (nxt == p) continue;
		dfs(nxt, h + 1, i, t);
		lca.a[curt][0] = {h, i};
		curt++;
	}
	en[i] = curt - 1;
	euleren[i] = eulert - 1;
}
vector<array<int, 2>> ask[N];
int ans[2 * N];
struct sqrt_decomp {
	const int b = 350;
	int a[N], lazy[350];
	int n;
	void init(int _n, int _v) {
		n = _n;
		for (int i = 0; i < n; i++) {
			a[i] = _v;
		}
		for (int i = 0; i <= n / b; i++) {
			lazy[i] = -1;
		}
	}
	void set(int l, int r, int v) {
		int s = l / b, e = r / b;
		if (s == e) {
			for (int i = l; i <= r; i++) {
				a[i] = v;
			}
			return;
		}
		for (int i = s + 1; i <= e - 1; i++) {
			lazy[i] = v;
		}
		int x = s * b, y = (s + 1) * b - 1;
		if (lazy[s] != -1) {
			for (int i = x; i <= y; i++) {
				a[i] = lazy[s];
			}
			lazy[s] = -1;
		}
		for (int i = l; i <= y; i++) {
			a[i] = v;
		}
		x = e * b, y = (e + 1) * b - 1;
		if (lazy[e] != -1) {
			for (int i = x; i <= y; i++) {
				a[i] = lazy[e];
			}
			lazy[e] = -1;
		}
		for (int i = x; i <= r; i++) {
			a[i] = v;
		}
	}
	int get(int i) {
		int x = i / b;
		if (lazy[x] != -1) {
			return lazy[x];
		}
		return a[i];
	}
} Inc, Dec;
set<int> activeinc, activedec;
bool ininc[N], indec[N];
pair<char, vector<int>> v[2 * N];
void process(int i, int p) {
	for (auto [nxt, t, nxtidx] : adj[i]) {
		if (nxt == p) continue;
		process(nxt, i);
	}
	ininc[eulerst[i]] = 1;
	indec[eulerst[i]] = 1;
	for (auto [idx, t] : ask[i]) {
		int a, b;
		if (v[idx].first == 'Q') {
			a = v[idx].second[1], b = v[idx].second[0];
		} else {
			a = v[t].second[0], b = v[t].second[1];
			int x = v[idx].second[0];
			if (isanc(b, x)) {
				a = x;
			} else {
				b = a;
				a = x;
			}
		}
		if (!indec[eulerst[a]] || !ininc[eulerst[b]]) continue;
		int lst1 = Dec.get(eulerst[a]), lst2 = Inc.get(eulerst[b]);
		bool ok = lst1 < lst2;
		int mx;
		if (v[idx].first == 'Q') {
			mx = idx;
		} else {
			mx = t - 1;
		}
		if (b != i) {
			ok &= par[b][1] <= mx;
		} else if (a != i) {
			ok &= lst1 <= mx;
		}
		ans[idx] += ok;
	}
// 	for (auto [a, b, t, idx] : ask[i]) {
// 		if (!indec[eulerst[a]] || !ininc[eulerst[b]]) continue;
// 		int lst1 = Dec.get(eulerst[a]), lst2 = Inc.get(eulerst[b]);
// 		bool ok = lst1 < lst2;
// 		if (b != i) {
// 			ok &= par[b][1] <= t;
// 		} else if (a != i) {
// 			ok &= lst1 <= t;
// 		}
// 		ans[idx] += ok;
// 	}
	ask[i].clear();
	if (i == 1) return;
	int part = par[i][1];
	for (auto [nxt, t, nxtidx] : adj[i]) {
		if (nxt == p) continue;
		if (part < t) {
			Inc.set(eulerst[nxt], euleren[nxt], part);
			auto it = activedec.lower_bound(eulerst[nxt]);
			while (it != activedec.end() && *it <= euleren[nxt]) {
				indec[*it] = 0;
				it = activedec.erase(it);
			}
			Dec.set(eulerst[nxt], euleren[nxt], inf);
		} else {
			auto it = activeinc.lower_bound(eulerst[nxt]);
			while (it != activeinc.end() && *it <= euleren[nxt]) {
				ininc[*it] = 0;
				it = activeinc.erase(it);
			}
			Inc.set(eulerst[nxt], euleren[nxt], -inf);
			Dec.set(eulerst[nxt], euleren[nxt], part);
		}
	}
	activeinc.insert(eulerst[i]);
	Inc.set(eulerst[i], eulerst[i], part);
	activedec.insert(eulerst[i]);
	Dec.set(eulerst[i], eulerst[i], part);
}
int main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	int n, q;
	cin >> n >> q;
	q += n - 1;
	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, 0, 1, 0);
	lca.build(curt);
	for (int i = 1; i <= n; i++) {
		dp[i].resize(adj[i].size() + 1);
		for (int j = 0; j <= SZ(adj[i]); j++) {
			dp[i][j] = -1;
		}
	}
	vector<array<int, 3>> upd;
	lst = -1;
	for (int i = 0; i < q; i++) {
		if (upd.size() == B) {
			lst = i - 1;
			upd.clear();
			for (int j = 1; j <= n; j++) {
				for (int k = 0; k <= SZ(adj[j]); k++) {
					dp[j][k] = -1;
				}
			}
		}
		if (v[i].first == 'S') {
			int a = v[i].second[0], b = v[i].second[1];
			if (isanc(b, a)) swap(a, b), swap(v[i].second[0], v[i].second[1]);
			upd.push_back({a, b, i});
		} else if (v[i].first == 'Q') {
			int a = v[i].second[0], b = v[i].second[1];
			int mid = lca.query(a, b);
// 			ask[mid].push_back({b, a, i, i});
			ask[mid].push_back({i, -1});
		} else {
			int x = v[i].second[0];
			ans[i] += solve(x, adj[x].size());
// 			for (auto [a, b, t] : upd) {
// 				if (isanc(b, x)) {
// 					ask[b].push_back({x, b, t - 1, i});
// 				} else {
// 					int mid = lca.query(a, x);
// 					ask[mid].push_back({x, a, t - 1, i});
// 				}
// 			}

			for (auto [a, b, t] : upd) {
				if (isanc(b, x)) {
					ask[b].push_back({i, t});
				} else {
					int mid = lca.query(a, x);
					ask[mid].push_back({i, t});
				}
			}

// 			for (auto [a, b, t, idx] : ask[i]) {
// 				if (!indec[eulerst[a]] || !ininc[eulerst[b]]) continue;
// 				int lst1 = Dec.get(eulerst[a]), lst2 = Inc.get(eulerst[b]);
// 				bool ok = lst1 < lst2;
// 				if (b != i) {
// 					ok &= par[b][1] <= t;
// 				} else if (a != i) {
// 					ok &= lst1 <= t;
// 				}
// 				ans[idx] += ok;
// 			}
		}
	}
	Dec.init(eulert, -inf);
	Inc.init(eulert, inf);
	process(1, 1);
	for (int i = 0; i < q; i++) {
		if (v[i].first == 'Q') {
			cout << (ans[i]? "yes\n" : "no\n");
		} else if (v[i].first == 'C') {
			cout << ans[i] << '\n';
		}
	}
	return 0;
}

Subtask #1
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 26436 KB Output is correct
2 Correct 39 ms 28876 KB Output is correct
3 Correct 38 ms 29172 KB Output is correct
4 Correct 39 ms 29100 KB Output is correct
5 Correct 38 ms 29788 KB Output is correct
6 Correct 35 ms 29092 KB Output is correct

Subtask #2
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 26436 KB Output is correct
2 Correct 39 ms 28876 KB Output is correct
3 Correct 38 ms 29172 KB Output is correct
4 Correct 39 ms 29100 KB Output is correct
5 Correct 38 ms 29788 KB Output is correct
6 Correct 35 ms 29092 KB Output is correct
7 Correct 36 ms 29240 KB Output is correct
8 Correct 290 ms 130072 KB Output is correct
9 Correct 188 ms 121200 KB Output is correct
10 Correct 279 ms 139752 KB Output is correct
11 Correct 145 ms 88960 KB Output is correct
12 Correct 148 ms 94368 KB Output is correct

Subtask #3
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 26320 KB Output is correct
2 Correct 385 ms 87600 KB Output is correct
3 Correct 380 ms 87380 KB Output is correct

Subtask #4
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 26320 KB Output is correct
2 Correct 385 ms 87600 KB Output is correct
3 Correct 380 ms 87380 KB Output is correct
4 Correct 34 ms 29124 KB Output is correct
5 Correct 1259 ms 121424 KB Output is correct
6 Correct 1574 ms 344000 KB Output is correct
7 Correct 1574 ms 344912 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 26456 KB Output is correct
2 Correct 444 ms 90704 KB Output is correct
3 Correct 445 ms 90700 KB Output is correct
4 Correct 436 ms 96308 KB Output is correct

Subtask #6
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 26456 KB Output is correct
2 Correct 444 ms 90704 KB Output is correct
3 Correct 445 ms 90700 KB Output is correct
4 Correct 436 ms 96308 KB Output is correct
5 Correct 33 ms 29144 KB Output is correct
6 Correct 922 ms 191564 KB Output is correct
7 Correct 1189 ms 198052 KB Output is correct
8 Correct 1292 ms 282936 KB Output is correct
9 Correct 1261 ms 283136 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 26192 KB Output is correct
2 Correct 360 ms 82368 KB Output is correct
3 Correct 413 ms 77392 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 26192 KB Output is correct
2 Correct 360 ms 82368 KB Output is correct
3 Correct 413 ms 77392 KB Output is correct
4 Correct 35 ms 28876 KB Output is correct
5 Correct 860 ms 207604 KB Output is correct
6 Correct 914 ms 193004 KB Output is correct

Subtask #9
12.5 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 26460 KB Output is correct
2 Correct 455 ms 90664 KB Output is correct
3 Correct 443 ms 90636 KB Output is correct
4 Correct 397 ms 96084 KB Output is correct
5 Correct 28 ms 26200 KB Output is correct
6 Correct 367 ms 82372 KB Output is correct
7 Correct 442 ms 77192 KB Output is correct
8 Correct 421 ms 77140 KB Output is correct
9 Correct 438 ms 77696 KB Output is correct
10 Correct 673 ms 88628 KB Output is correct
11 Correct 695 ms 87368 KB Output is correct

Subtask #10
0 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 26460 KB Output is correct
2 Correct 455 ms 90664 KB Output is correct
3 Correct 443 ms 90636 KB Output is correct
4 Correct 397 ms 96084 KB Output is correct
5 Correct 28 ms 26200 KB Output is correct
6 Correct 367 ms 82372 KB Output is correct
7 Correct 442 ms 77192 KB Output is correct
8 Correct 421 ms 77140 KB Output is correct
9 Correct 438 ms 77696 KB Output is correct
10 Correct 673 ms 88628 KB Output is correct
11 Correct 695 ms 87368 KB Output is correct
12 Correct 34 ms 29120 KB Output is correct
13 Correct 972 ms 191364 KB Output is correct
14 Correct 1176 ms 198232 KB Output is correct
15 Correct 1255 ms 283152 KB Output is correct
16 Correct 1244 ms 283216 KB Output is correct
17 Correct 34 ms 28864 KB Output is correct
18 Correct 862 ms 207428 KB Output is correct
19 Correct 931 ms 193144 KB Output is correct
20 Correct 1187 ms 267616 KB Output is correct
21 Correct 1050 ms 166332 KB Output is correct
22 Correct 1679 ms 241360 KB Output is correct
23 Execution timed out 3534 ms 179488 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #11
17.5 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 26444 KB Output is correct
2 Correct 37 ms 28872 KB Output is correct
3 Correct 50 ms 29144 KB Output is correct
4 Correct 41 ms 29128 KB Output is correct
5 Correct 51 ms 29776 KB Output is correct
6 Correct 36 ms 29132 KB Output is correct
7 Correct 28 ms 26224 KB Output is correct
8 Correct 378 ms 87288 KB Output is correct
9 Correct 378 ms 87300 KB Output is correct
10 Correct 28 ms 26308 KB Output is correct
11 Correct 453 ms 90704 KB Output is correct
12 Correct 465 ms 90612 KB Output is correct
13 Correct 390 ms 96048 KB Output is correct
14 Correct 28 ms 26320 KB Output is correct
15 Correct 388 ms 82264 KB Output is correct
16 Correct 421 ms 77300 KB Output is correct
17 Correct 421 ms 77136 KB Output is correct
18 Correct 432 ms 77800 KB Output is correct
19 Correct 673 ms 88820 KB Output is correct
20 Correct 643 ms 87284 KB Output is correct
21 Correct 404 ms 84628 KB Output is correct
22 Correct 424 ms 84600 KB Output is correct
23 Correct 409 ms 78416 KB Output is correct
24 Correct 404 ms 78780 KB Output is correct
25 Correct 448 ms 85848 KB Output is correct
26 Correct 506 ms 81328 KB Output is correct
27 Correct 500 ms 81704 KB Output is correct

Subtask #12
0 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 26444 KB Output is correct
2 Correct 37 ms 28872 KB Output is correct
3 Correct 50 ms 29144 KB Output is correct
4 Correct 41 ms 29128 KB Output is correct
5 Correct 51 ms 29776 KB Output is correct
6 Correct 36 ms 29132 KB Output is correct
7 Correct 28 ms 26224 KB Output is correct
8 Correct 378 ms 87288 KB Output is correct
9 Correct 378 ms 87300 KB Output is correct
10 Correct 28 ms 26308 KB Output is correct
11 Correct 453 ms 90704 KB Output is correct
12 Correct 465 ms 90612 KB Output is correct
13 Correct 390 ms 96048 KB Output is correct
14 Correct 28 ms 26320 KB Output is correct
15 Correct 388 ms 82264 KB Output is correct
16 Correct 421 ms 77300 KB Output is correct
17 Correct 421 ms 77136 KB Output is correct
18 Correct 432 ms 77800 KB Output is correct
19 Correct 673 ms 88820 KB Output is correct
20 Correct 643 ms 87284 KB Output is correct
21 Correct 404 ms 84628 KB Output is correct
22 Correct 424 ms 84600 KB Output is correct
23 Correct 409 ms 78416 KB Output is correct
24 Correct 404 ms 78780 KB Output is correct
25 Correct 448 ms 85848 KB Output is correct
26 Correct 506 ms 81328 KB Output is correct
27 Correct 500 ms 81704 KB Output is correct
28 Correct 36 ms 29244 KB Output is correct
29 Correct 285 ms 133524 KB Output is correct
30 Correct 197 ms 119924 KB Output is correct
31 Correct 280 ms 139504 KB Output is correct
32 Correct 146 ms 88800 KB Output is correct
33 Correct 146 ms 94632 KB Output is correct
34 Correct 35 ms 29380 KB Output is correct
35 Correct 1437 ms 123068 KB Output is correct
36 Correct 1767 ms 344528 KB Output is correct
37 Correct 2109 ms 344864 KB Output is correct
38 Correct 34 ms 29132 KB Output is correct
39 Correct 1059 ms 191592 KB Output is correct
40 Correct 1366 ms 198256 KB Output is correct
41 Correct 1437 ms 282800 KB Output is correct
42 Correct 1453 ms 283096 KB Output is correct
43 Correct 40 ms 28872 KB Output is correct
44 Correct 881 ms 205736 KB Output is correct
45 Correct 1121 ms 195428 KB Output is correct
46 Correct 1245 ms 267372 KB Output is correct
47 Correct 1228 ms 170652 KB Output is correct
48 Correct 1917 ms 241076 KB Output is correct
49 Execution timed out 3531 ms 143692 KB Time limit exceeded
50 Halted 0 ms 0 KB -