oj.uz

답안 #863690

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
863690 2023-10-20T17:37:23 Z Mizo_Compiler Inside information (BOI21_servers) C++17
55 / 100
 3500 ms 37452 KB 
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
typedef long long ll;
typedef double ld;
#define pb push_back
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define F first
#define S second
const int N = 120001;
int n, pr[N], sz[N], q, dep[N], p[N][17], mn[N], vt[N];
int mx[N], sze[N], bit[N+N], ans[N+N];
bool r[N];
int ar[N];
int cnt = 0;
vector<array<int, 3>> qr;
vector<pair<int, int>> adj[N];
vector<int> c[N];
 
void upd(int i, int val) {
	i++;
	while (i <= q) {
		bit[i] += val;
		i += (i & -i);
	}
}
 
int get(int i) {
	i++;
	int ret = 0;
	while (i) {
		ret += bit[i];
		i -= (i & -i);
	}
	return ret;
}
 
void dfs_sz(int u, int par) {
	sze[u] = 1;
	for (auto &[v, t] : adj[u]) {
		if (r[v] || v == par)continue;
		dfs_sz(v, u);
		sze[u] += sz[v];
	}
}
 
int centroid(int u, int par, int mxsz) {
	for (auto &[v, t] : adj[u]) {
		if (r[v] || v == par)continue;
		if (2*sze[v] > mxsz)return centroid(v, u, mxsz);
	}
	return u;
}
 
int findp(int u) {
	return pr[u] = (pr[u] == u ? u : findp(pr[u]));
}
 
void merge(int u, int v) {
	u = findp(u), v = findp(v);
	if (u == v)return;
	if (sz[u] < sz[v])swap(u, v);
	sz[u] += sz[v];
	pr[v] = u;
}
 
void init(int u, int par) {
	for (auto &[v, t] : adj[u]) {
		if (v == par)continue;
		p[v][0] = u;
		dep[v] = dep[u]+1;
		vt[v] = t;
		mn[v] = (vt[v] < vt[u] ? mn[u] : u);
		mx[v] = (vt[v] > vt[u] ? mx[u] : u);
		for (int i = 1; i < 17; i++) {
			p[v][i] = p[p[v][i-1]][i-1];
		}
		init(v, u);
	}
}
 
int lift(int u, int k) {
	for (int i = 0; i < 17; i++) {
		if ((k & (1 << i)))u = p[u][i];
	}
	return u;
}
 
int lca(int u, int v) {
	if (dep[u] < dep[v])swap(u, v);
	u = lift(u, dep[u]-dep[v]);
	if (u == v)return u;
	for (int i = 16; i >= 0; i--) {
		if (p[u][i] != p[v][i]) {
			u = p[u][i];
			v = p[v][i];
		}
	}
	return p[u][0];
}
 
bool sol(int u, int v) {
	if (findp(u) != findp(v))return false;
	int l = lca(u, v);
	if (dep[mx[u]] > dep[l])return false;
	if (dep[mn[v]] > dep[l])return false;
	if (l == v || l == u)return true;
	u = lift(u, dep[u]-dep[l]-1);
	v = lift(v, dep[v]-dep[l]-1);
	return (vt[v] < vt[u]);
}
int vv;
void dfs(int u, int par, int ls) {
	for (auto &t : c[u]) {
		ans[t] += get(t) + (vv <= t);
	}
	for (auto &[v, t] : adj[u]) {
		if (r[v] || v == par || t > ls)continue;
		dfs(v, u, t);
	}
}
 
void dfs2(int u, int par, int ls) {
	upd(ls, 1);
	ar[cnt++] = ls;
	for (auto &[v, t] : adj[u]) {
		if (r[v] || v == par || t < ls)continue;
		dfs2(v, u, t);
	}
}
 
void cen(int u) {
	dfs_sz(u, u);
	u = centroid(u, u, sze[u]);
	cnt = 0;
	for (auto &[v, t] : adj[u]) {
		if (r[v])continue;
		vv = t;
		dfs(v, u, t);
		dfs2(v, u, t);
	}
	for (auto &t : c[u]) {
		ans[t] += get(t);
	}
	for (int i = 0; i < cnt; i++)upd(ar[i], -1);
	r[u] = true;
	for (auto &[v, t] : adj[u]) {
		if (r[v])continue;
		cen(v);
	}
}
 
int main () {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin >> n >> q;
	for (int i = 0; i < n; i++) {
		pr[i] = i, sz[i] = 1;
	}
	q += n-1;
	bool ff = true;
	for (int i = 0; i < q; i++) {
		char ch;
		cin >> ch;
		if (ch == 'S') {
			int u, v;
			cin >> u >> v;
			--u, --v;
			qr.pb({0, u, v});
			adj[u].pb({v, i});
			adj[v].pb({u, i});
		} else if (ch == 'Q') {
			int u, v;
			cin >> u >> v;
			--u, --v;
			qr.pb({1, u, v});
		} else {
			ff = false;
			int u;
			cin >> u;
			--u;
			c[u].pb(i);
			qr.pb({2, u, i});
		}
	}
	vt[0] = q+5;
	init(0, 0);
	if (!ff) {
		for (int i = 0; i < n; i++)reverse(all(adj[i]));
		cen(0);
	}
	for (auto &[op, u, v] : qr) {
		if (!op) {
			merge(u, v);
		}
		else if (op == 1) {
			cout << (sol(u, v) ? "yes\n" : "no\n");
		} else {
			cout << ans[v] + 1 << "\n";
		}
	}
}

Subtask #1
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 12752 KB Output is correct
2 Correct 21 ms 12768 KB Output is correct
3 Correct 31 ms 12892 KB Output is correct
4 Correct 21 ms 12764 KB Output is correct
5 Correct 29 ms 13060 KB Output is correct
6 Correct 29 ms 12788 KB Output is correct

Subtask #2
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 12752 KB Output is correct
2 Correct 21 ms 12768 KB Output is correct
3 Correct 31 ms 12892 KB Output is correct
4 Correct 21 ms 12764 KB Output is correct
5 Correct 29 ms 13060 KB Output is correct
6 Correct 29 ms 12788 KB Output is correct
7 Correct 20 ms 14792 KB Output is correct
8 Correct 38 ms 15364 KB Output is correct
9 Correct 28 ms 15364 KB Output is correct
10 Correct 120 ms 15364 KB Output is correct
11 Correct 121 ms 15632 KB Output is correct
12 Correct 27 ms 15368 KB Output is correct

Subtask #3
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 12880 KB Output is correct
2 Correct 70 ms 25600 KB Output is correct
3 Correct 71 ms 25600 KB Output is correct

Subtask #4
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 12880 KB Output is correct
2 Correct 70 ms 25600 KB Output is correct
3 Correct 71 ms 25600 KB Output is correct
4 Correct 21 ms 14800 KB Output is correct
5 Correct 88 ms 27900 KB Output is correct
6 Correct 62 ms 28696 KB Output is correct
7 Correct 74 ms 28164 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 12752 KB Output is correct
2 Correct 81 ms 33968 KB Output is correct
3 Correct 87 ms 34316 KB Output is correct
4 Correct 78 ms 34044 KB Output is correct

Subtask #6
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 12752 KB Output is correct
2 Correct 81 ms 33968 KB Output is correct
3 Correct 87 ms 34316 KB Output is correct
4 Correct 78 ms 34044 KB Output is correct
5 Correct 20 ms 14804 KB Output is correct
6 Execution timed out 3586 ms 37452 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 12752 KB Output is correct
2 Correct 71 ms 25600 KB Output is correct
3 Correct 87 ms 26108 KB Output is correct

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 12752 KB Output is correct
2 Correct 71 ms 25600 KB Output is correct
3 Correct 87 ms 26108 KB Output is correct
4 Correct 18 ms 14804 KB Output is correct
5 Execution timed out 3513 ms 29440 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #9
12.5 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 12752 KB Output is correct
2 Correct 87 ms 34112 KB Output is correct
3 Correct 109 ms 34072 KB Output is correct
4 Correct 81 ms 34004 KB Output is correct
5 Correct 22 ms 12684 KB Output is correct
6 Correct 73 ms 25612 KB Output is correct
7 Correct 90 ms 26364 KB Output is correct
8 Correct 120 ms 26556 KB Output is correct
9 Correct 113 ms 26376 KB Output is correct
10 Correct 103 ms 30880 KB Output is correct
11 Correct 167 ms 30344 KB Output is correct

Subtask #10
0 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 12752 KB Output is correct
2 Correct 87 ms 34112 KB Output is correct
3 Correct 109 ms 34072 KB Output is correct
4 Correct 81 ms 34004 KB Output is correct
5 Correct 22 ms 12684 KB Output is correct
6 Correct 73 ms 25612 KB Output is correct
7 Correct 90 ms 26364 KB Output is correct
8 Correct 120 ms 26556 KB Output is correct
9 Correct 113 ms 26376 KB Output is correct
10 Correct 103 ms 30880 KB Output is correct
11 Correct 167 ms 30344 KB Output is correct
12 Correct 25 ms 14772 KB Output is correct
13 Execution timed out 3519 ms 37196 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #11
17.5 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 12748 KB Output is correct
2 Correct 22 ms 12768 KB Output is correct
3 Correct 29 ms 12964 KB Output is correct
4 Correct 21 ms 12768 KB Output is correct
5 Correct 31 ms 13072 KB Output is correct
6 Correct 30 ms 12864 KB Output is correct
7 Correct 19 ms 12748 KB Output is correct
8 Correct 90 ms 25600 KB Output is correct
9 Correct 91 ms 25596 KB Output is correct
10 Correct 18 ms 12752 KB Output is correct
11 Correct 78 ms 34108 KB Output is correct
12 Correct 78 ms 34072 KB Output is correct
13 Correct 78 ms 34044 KB Output is correct
14 Correct 18 ms 12748 KB Output is correct
15 Correct 73 ms 25536 KB Output is correct
16 Correct 80 ms 26104 KB Output is correct
17 Correct 105 ms 26308 KB Output is correct
18 Correct 83 ms 26532 KB Output is correct
19 Correct 103 ms 30972 KB Output is correct
20 Correct 115 ms 30324 KB Output is correct
21 Correct 80 ms 25676 KB Output is correct
22 Correct 74 ms 25652 KB Output is correct
23 Correct 89 ms 26028 KB Output is correct
24 Correct 78 ms 26112 KB Output is correct
25 Correct 81 ms 27904 KB Output is correct
26 Correct 76 ms 25552 KB Output is correct
27 Correct 73 ms 25344 KB Output is correct

Subtask #12
0 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 12748 KB Output is correct
2 Correct 22 ms 12768 KB Output is correct
3 Correct 29 ms 12964 KB Output is correct
4 Correct 21 ms 12768 KB Output is correct
5 Correct 31 ms 13072 KB Output is correct
6 Correct 30 ms 12864 KB Output is correct
7 Correct 19 ms 12748 KB Output is correct
8 Correct 90 ms 25600 KB Output is correct
9 Correct 91 ms 25596 KB Output is correct
10 Correct 18 ms 12752 KB Output is correct
11 Correct 78 ms 34108 KB Output is correct
12 Correct 78 ms 34072 KB Output is correct
13 Correct 78 ms 34044 KB Output is correct
14 Correct 18 ms 12748 KB Output is correct
15 Correct 73 ms 25536 KB Output is correct
16 Correct 80 ms 26104 KB Output is correct
17 Correct 105 ms 26308 KB Output is correct
18 Correct 83 ms 26532 KB Output is correct
19 Correct 103 ms 30972 KB Output is correct
20 Correct 115 ms 30324 KB Output is correct
21 Correct 80 ms 25676 KB Output is correct
22 Correct 74 ms 25652 KB Output is correct
23 Correct 89 ms 26028 KB Output is correct
24 Correct 78 ms 26112 KB Output is correct
25 Correct 81 ms 27904 KB Output is correct
26 Correct 76 ms 25552 KB Output is correct
27 Correct 73 ms 25344 KB Output is correct
28 Correct 18 ms 14800 KB Output is correct
29 Correct 39 ms 15340 KB Output is correct
30 Correct 28 ms 15368 KB Output is correct
31 Correct 122 ms 15364 KB Output is correct
32 Correct 124 ms 15640 KB Output is correct
33 Correct 27 ms 15364 KB Output is correct
34 Correct 20 ms 14804 KB Output is correct
35 Correct 83 ms 27880 KB Output is correct
36 Correct 65 ms 28304 KB Output is correct
37 Correct 67 ms 28152 KB Output is correct
38 Correct 19 ms 14804 KB Output is correct
39 Execution timed out 3560 ms 37116 KB Time limit exceeded
40 Halted 0 ms 0 KB -