oj.uz

답안 #863672

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
863672 2023-10-20T17:06:54 Z Mizo_Compiler Inside information (BOI21_servers) C++17
50 / 100
 111 ms 34832 KB 
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
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], ans[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) {
		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)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);
	}
	for (auto &x : ar)upd(x, -1);
  	ar.clear();
	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;
  	int cc = 0;
	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});
          	cc++;
			adj[u].pb({v, cc});
			adj[v].pb({u, cc});
		} 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(cc);
			qr.pb({2, u, cc});
		}
	}
	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 23 ms 12768 KB Output is correct
3 Correct 29 ms 13056 KB Output is correct
4 Correct 21 ms 13012 KB Output is correct
5 Correct 30 ms 13280 KB Output is correct
6 Correct 33 ms 12788 KB Output is correct

Subtask #2
0 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 12752 KB Output is correct
2 Correct 23 ms 12768 KB Output is correct
3 Correct 29 ms 13056 KB Output is correct
4 Correct 21 ms 13012 KB Output is correct
5 Correct 30 ms 13280 KB Output is correct
6 Correct 33 ms 12788 KB Output is correct
7 Incorrect 19 ms 12752 KB Extra information in the output file
8 Halted 0 ms 0 KB -

Subtask #3
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 12756 KB Output is correct
2 Correct 92 ms 26424 KB Output is correct
3 Correct 76 ms 26224 KB Output is correct

Subtask #4
0 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 12756 KB Output is correct
2 Correct 92 ms 26424 KB Output is correct
3 Correct 76 ms 26224 KB Output is correct
4 Incorrect 20 ms 12756 KB Extra information in the output file
5 Halted 0 ms 0 KB -

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 12748 KB Output is correct
2 Correct 93 ms 34588 KB Output is correct
3 Correct 85 ms 34752 KB Output is correct
4 Correct 80 ms 34732 KB Output is correct

Subtask #6
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 12748 KB Output is correct
2 Correct 93 ms 34588 KB Output is correct
3 Correct 85 ms 34752 KB Output is correct
4 Correct 80 ms 34732 KB Output is correct
5 Incorrect 17 ms 12708 KB Extra information in the output file
6 Halted 0 ms 0 KB -

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 12748 KB Output is correct
2 Correct 75 ms 26104 KB Output is correct
3 Correct 87 ms 26616 KB Output is correct

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 12748 KB Output is correct
2 Correct 75 ms 26104 KB Output is correct
3 Correct 87 ms 26616 KB Output is correct
4 Incorrect 18 ms 12756 KB Extra information in the output file
5 Halted 0 ms 0 KB -

Subtask #9
12.5 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 12752 KB Output is correct
2 Correct 88 ms 34832 KB Output is correct
3 Correct 89 ms 34740 KB Output is correct
4 Correct 81 ms 34592 KB Output is correct
5 Correct 18 ms 12752 KB Output is correct
6 Correct 88 ms 26336 KB Output is correct
7 Correct 86 ms 26736 KB Output is correct
8 Correct 107 ms 27128 KB Output is correct
9 Correct 89 ms 27132 KB Output is correct
10 Correct 101 ms 31484 KB Output is correct
11 Correct 106 ms 31108 KB Output is correct

Subtask #10
0 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 12752 KB Output is correct
2 Correct 88 ms 34832 KB Output is correct
3 Correct 89 ms 34740 KB Output is correct
4 Correct 81 ms 34592 KB Output is correct
5 Correct 18 ms 12752 KB Output is correct
6 Correct 88 ms 26336 KB Output is correct
7 Correct 86 ms 26736 KB Output is correct
8 Correct 107 ms 27128 KB Output is correct
9 Correct 89 ms 27132 KB Output is correct
10 Correct 101 ms 31484 KB Output is correct
11 Correct 106 ms 31108 KB Output is correct
12 Incorrect 18 ms 12756 KB Extra information in the output file
13 Halted 0 ms 0 KB -

Subtask #11
17.5 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 12752 KB Output is correct
2 Correct 22 ms 12768 KB Output is correct
3 Correct 32 ms 13056 KB Output is correct
4 Correct 24 ms 12868 KB Output is correct
5 Correct 30 ms 13316 KB Output is correct
6 Correct 30 ms 13040 KB Output is correct
7 Correct 20 ms 12748 KB Output is correct
8 Correct 84 ms 26108 KB Output is correct
9 Correct 85 ms 26616 KB Output is correct
10 Correct 18 ms 12748 KB Output is correct
11 Correct 83 ms 34812 KB Output is correct
12 Correct 90 ms 34812 KB Output is correct
13 Correct 80 ms 34812 KB Output is correct
14 Correct 19 ms 12760 KB Output is correct
15 Correct 75 ms 26252 KB Output is correct
16 Correct 82 ms 26668 KB Output is correct
17 Correct 98 ms 27148 KB Output is correct
18 Correct 90 ms 27132 KB Output is correct
19 Correct 109 ms 31484 KB Output is correct
20 Correct 111 ms 30952 KB Output is correct
21 Correct 81 ms 26112 KB Output is correct
22 Correct 89 ms 26428 KB Output is correct
23 Correct 82 ms 26616 KB Output is correct
24 Correct 86 ms 26620 KB Output is correct
25 Correct 91 ms 28380 KB Output is correct
26 Correct 96 ms 26156 KB Output is correct
27 Correct 87 ms 26120 KB Output is correct

Subtask #12
0 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 12752 KB Output is correct
2 Correct 22 ms 12768 KB Output is correct
3 Correct 32 ms 13056 KB Output is correct
4 Correct 24 ms 12868 KB Output is correct
5 Correct 30 ms 13316 KB Output is correct
6 Correct 30 ms 13040 KB Output is correct
7 Correct 20 ms 12748 KB Output is correct
8 Correct 84 ms 26108 KB Output is correct
9 Correct 85 ms 26616 KB Output is correct
10 Correct 18 ms 12748 KB Output is correct
11 Correct 83 ms 34812 KB Output is correct
12 Correct 90 ms 34812 KB Output is correct
13 Correct 80 ms 34812 KB Output is correct
14 Correct 19 ms 12760 KB Output is correct
15 Correct 75 ms 26252 KB Output is correct
16 Correct 82 ms 26668 KB Output is correct
17 Correct 98 ms 27148 KB Output is correct
18 Correct 90 ms 27132 KB Output is correct
19 Correct 109 ms 31484 KB Output is correct
20 Correct 111 ms 30952 KB Output is correct
21 Correct 81 ms 26112 KB Output is correct
22 Correct 89 ms 26428 KB Output is correct
23 Correct 82 ms 26616 KB Output is correct
24 Correct 86 ms 26620 KB Output is correct
25 Correct 91 ms 28380 KB Output is correct
26 Correct 96 ms 26156 KB Output is correct
27 Correct 87 ms 26120 KB Output is correct
28 Incorrect 18 ms 12788 KB Extra information in the output file
29 Halted 0 ms 0 KB -