oj.uz

답안 #863588

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
863588 2023-10-20T15:29:39 Z Mizo_Compiler Inside information (BOI21_servers) C++17
55 / 100
 3500 ms 39528 KB 
#include <bits/stdc++.h>
using namespace std;
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 = 120005;
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];
vector<array<int, 3>> qr;
vector<pair<int, int>> adj[N];
vector<int> c[N], ar;

void upd(int i, int val) {
	i++;
	while (i <= n+q) {
		bit[i] += val;
		i += (i & -i);
	}
}

void upd2(int i) {
	i++;
	while (i <= n+q) {
		bit[i] = 0;
		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)continue;
		if (t > ls)continue;
		dfs(v, u, t);
	}
}

void dfs2(int u, int par, int ls) {
	upd(ls, 1);
	ar.pb(ls);
	for (auto &[v, t] : adj[u]) {
		if (r[v] || v == par)continue;
		if (t < ls)continue;
		dfs2(v, u, t);
	}
}

void cen(int u) {
	dfs_sz(u, u);
	u = centroid(u, u, sze[u]);
	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);
	}
	while (!ar.empty()) {
		upd(ar.back(), -1);
		ar.pop_back();
	}
	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 21 ms 14792 KB Output is correct
2 Correct 21 ms 14812 KB Output is correct
3 Correct 31 ms 14836 KB Output is correct
4 Correct 21 ms 14812 KB Output is correct
5 Correct 29 ms 15252 KB Output is correct
6 Correct 30 ms 14836 KB Output is correct

Subtask #2
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 14792 KB Output is correct
2 Correct 21 ms 14812 KB Output is correct
3 Correct 31 ms 14836 KB Output is correct
4 Correct 21 ms 14812 KB Output is correct
5 Correct 29 ms 15252 KB Output is correct
6 Correct 30 ms 14836 KB Output is correct
7 Correct 19 ms 14804 KB Output is correct
8 Correct 35 ms 15324 KB Output is correct
9 Correct 27 ms 15360 KB Output is correct
10 Correct 116 ms 15416 KB Output is correct
11 Correct 121 ms 15552 KB Output is correct
12 Correct 28 ms 15376 KB Output is correct

Subtask #3
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 14792 KB Output is correct
2 Correct 73 ms 27136 KB Output is correct
3 Correct 78 ms 27132 KB Output is correct

Subtask #4
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 14792 KB Output is correct
2 Correct 73 ms 27136 KB Output is correct
3 Correct 78 ms 27132 KB Output is correct
4 Correct 20 ms 14804 KB Output is correct
5 Correct 86 ms 28608 KB Output is correct
6 Correct 76 ms 29184 KB Output is correct
7 Correct 71 ms 28664 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 14800 KB Output is correct
2 Correct 77 ms 35576 KB Output is correct
3 Correct 78 ms 35576 KB Output is correct
4 Correct 77 ms 35740 KB Output is correct

Subtask #6
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 14800 KB Output is correct
2 Correct 77 ms 35576 KB Output is correct
3 Correct 78 ms 35576 KB Output is correct
4 Correct 77 ms 35740 KB Output is correct
5 Correct 18 ms 14804 KB Output is correct
6 Execution timed out 3536 ms 36664 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 14796 KB Output is correct
2 Correct 82 ms 27260 KB Output is correct
3 Correct 84 ms 27584 KB Output is correct

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 14796 KB Output is correct
2 Correct 82 ms 27260 KB Output is correct
3 Correct 84 ms 27584 KB Output is correct
4 Correct 18 ms 14804 KB Output is correct
5 Execution timed out 3544 ms 29008 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #9
12.5 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 14800 KB Output is correct
2 Correct 80 ms 35612 KB Output is correct
3 Correct 78 ms 35628 KB Output is correct
4 Correct 77 ms 35592 KB Output is correct
5 Correct 20 ms 14796 KB Output is correct
6 Correct 68 ms 27228 KB Output is correct
7 Correct 82 ms 27748 KB Output is correct
8 Correct 97 ms 27904 KB Output is correct
9 Correct 86 ms 28156 KB Output is correct
10 Correct 97 ms 32532 KB Output is correct
11 Correct 103 ms 31740 KB Output is correct

Subtask #10
0 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 14800 KB Output is correct
2 Correct 80 ms 35612 KB Output is correct
3 Correct 78 ms 35628 KB Output is correct
4 Correct 77 ms 35592 KB Output is correct
5 Correct 20 ms 14796 KB Output is correct
6 Correct 68 ms 27228 KB Output is correct
7 Correct 82 ms 27748 KB Output is correct
8 Correct 97 ms 27904 KB Output is correct
9 Correct 86 ms 28156 KB Output is correct
10 Correct 97 ms 32532 KB Output is correct
11 Correct 103 ms 31740 KB Output is correct
12 Correct 17 ms 14804 KB Output is correct
13 Execution timed out 3557 ms 36788 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #11
17.5 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 14788 KB Output is correct
2 Correct 21 ms 14816 KB Output is correct
3 Correct 28 ms 14848 KB Output is correct
4 Correct 21 ms 14804 KB Output is correct
5 Correct 29 ms 15108 KB Output is correct
6 Correct 28 ms 14832 KB Output is correct
7 Correct 20 ms 14800 KB Output is correct
8 Correct 75 ms 27132 KB Output is correct
9 Correct 74 ms 27132 KB Output is correct
10 Correct 18 ms 14800 KB Output is correct
11 Correct 77 ms 35584 KB Output is correct
12 Correct 96 ms 36128 KB Output is correct
13 Correct 78 ms 35580 KB Output is correct
14 Correct 18 ms 14800 KB Output is correct
15 Correct 69 ms 27132 KB Output is correct
16 Correct 80 ms 27648 KB Output is correct
17 Correct 115 ms 28260 KB Output is correct
18 Correct 86 ms 28016 KB Output is correct
19 Correct 90 ms 32508 KB Output is correct
20 Correct 100 ms 31932 KB Output is correct
21 Correct 81 ms 27180 KB Output is correct
22 Correct 78 ms 27392 KB Output is correct
23 Correct 88 ms 27584 KB Output is correct
24 Correct 83 ms 27644 KB Output is correct
25 Correct 96 ms 29704 KB Output is correct
26 Correct 80 ms 27136 KB Output is correct
27 Correct 78 ms 26920 KB Output is correct

Subtask #12
0 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 14788 KB Output is correct
2 Correct 21 ms 14816 KB Output is correct
3 Correct 28 ms 14848 KB Output is correct
4 Correct 21 ms 14804 KB Output is correct
5 Correct 29 ms 15108 KB Output is correct
6 Correct 28 ms 14832 KB Output is correct
7 Correct 20 ms 14800 KB Output is correct
8 Correct 75 ms 27132 KB Output is correct
9 Correct 74 ms 27132 KB Output is correct
10 Correct 18 ms 14800 KB Output is correct
11 Correct 77 ms 35584 KB Output is correct
12 Correct 96 ms 36128 KB Output is correct
13 Correct 78 ms 35580 KB Output is correct
14 Correct 18 ms 14800 KB Output is correct
15 Correct 69 ms 27132 KB Output is correct
16 Correct 80 ms 27648 KB Output is correct
17 Correct 115 ms 28260 KB Output is correct
18 Correct 86 ms 28016 KB Output is correct
19 Correct 90 ms 32508 KB Output is correct
20 Correct 100 ms 31932 KB Output is correct
21 Correct 81 ms 27180 KB Output is correct
22 Correct 78 ms 27392 KB Output is correct
23 Correct 88 ms 27584 KB Output is correct
24 Correct 83 ms 27644 KB Output is correct
25 Correct 96 ms 29704 KB Output is correct
26 Correct 80 ms 27136 KB Output is correct
27 Correct 78 ms 26920 KB Output is correct
28 Correct 19 ms 14792 KB Output is correct
29 Correct 35 ms 15376 KB Output is correct
30 Correct 27 ms 15208 KB Output is correct
31 Correct 148 ms 16392 KB Output is correct
32 Correct 121 ms 16644 KB Output is correct
33 Correct 27 ms 16392 KB Output is correct
34 Correct 20 ms 15760 KB Output is correct
35 Correct 89 ms 31012 KB Output is correct
36 Correct 68 ms 30464 KB Output is correct
37 Correct 72 ms 30712 KB Output is correct
38 Correct 18 ms 15572 KB Output is correct
39 Execution timed out 3571 ms 39528 KB Time limit exceeded
40 Halted 0 ms 0 KB -