oj.uz

Submission #863610

# Submission time Handle Problem Language Result Execution time Memory
863610 2023-10-20T15:46:03 Z Mizo_Compiler Inside information (BOI21_servers) C++14
55 / 100
 3500 ms 36608 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+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);
	}
}

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;
	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";
		}
	}
}

Compilation message

servers.cpp: In function 'void dfs_sz(int, int)':
servers.cpp:39:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   39 |  for (auto &[v, t] : adj[u]) {
      |             ^
servers.cpp: In function 'int centroid(int, int, int)':
servers.cpp:47:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   47 |  for (auto &[v, t] : adj[u]) {
      |             ^
servers.cpp: In function 'void init(int, int)':
servers.cpp:67:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   67 |  for (auto &[v, t] : adj[u]) {
      |             ^
servers.cpp: In function 'void dfs(int, int, int)':
servers.cpp:116:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  116 |  for (auto &[v, t] : adj[u]) {
      |             ^
servers.cpp: In function 'void dfs2(int, int, int)':
servers.cpp:126:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  126 |  for (auto &[v, t] : adj[u]) {
      |             ^
servers.cpp: In function 'void cen(int)':
servers.cpp:136:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  136 |  for (auto &[v, t] : adj[u]) {
      |             ^
servers.cpp:148:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  148 |  for (auto &[v, t] : adj[u]) {
      |             ^
servers.cpp: In function 'int main()':
servers.cpp:193:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  193 |  for (auto &[op, u, v] : qr) {
      |             ^

Subtask #1
2.5 / 2.5

# Verdict Execution time Memory Grader output
1 Correct 18 ms 14796 KB Output is correct
2 Correct 22 ms 14816 KB Output is correct
3 Correct 29 ms 14848 KB Output is correct
4 Correct 21 ms 14812 KB Output is correct
5 Correct 31 ms 15096 KB Output is correct
6 Correct 30 ms 14832 KB Output is correct

Subtask #2
2.5 / 2.5

# Verdict Execution time Memory Grader output
1 Correct 18 ms 14796 KB Output is correct
2 Correct 22 ms 14816 KB Output is correct
3 Correct 29 ms 14848 KB Output is correct
4 Correct 21 ms 14812 KB Output is correct
5 Correct 31 ms 15096 KB Output is correct
6 Correct 30 ms 14832 KB Output is correct
7 Correct 19 ms 14804 KB Output is correct
8 Correct 41 ms 15364 KB Output is correct
9 Correct 28 ms 15372 KB Output is correct
10 Correct 128 ms 15376 KB Output is correct
11 Correct 127 ms 15872 KB Output is correct
12 Correct 27 ms 15376 KB Output is correct

Subtask #3
2.5 / 2.5

# Verdict Execution time Memory Grader output
1 Correct 20 ms 14800 KB Output is correct
2 Correct 76 ms 27200 KB Output is correct
3 Correct 75 ms 27264 KB Output is correct

Subtask #4
2.5 / 2.5

# Verdict Execution time Memory Grader output
1 Correct 20 ms 14800 KB Output is correct
2 Correct 76 ms 27200 KB Output is correct
3 Correct 75 ms 27264 KB Output is correct
4 Correct 20 ms 14804 KB Output is correct
5 Correct 97 ms 28408 KB Output is correct
6 Correct 71 ms 28880 KB Output is correct
7 Correct 75 ms 28664 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 14800 KB Output is correct
2 Correct 91 ms 35584 KB Output is correct
3 Correct 80 ms 35768 KB Output is correct
4 Correct 79 ms 35580 KB Output is correct

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 14800 KB Output is correct
2 Correct 91 ms 35584 KB Output is correct
3 Correct 80 ms 35768 KB Output is correct
4 Correct 79 ms 35580 KB Output is correct
5 Correct 21 ms 14800 KB Output is correct
6 Execution timed out 3517 ms 36604 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 14792 KB Output is correct
2 Correct 69 ms 27376 KB Output is correct
3 Correct 80 ms 27648 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 14792 KB Output is correct
2 Correct 69 ms 27376 KB Output is correct
3 Correct 80 ms 27648 KB Output is correct
4 Correct 19 ms 14804 KB Output is correct
5 Execution timed out 3538 ms 28608 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #9
12.5 / 12.5

# Verdict Execution time Memory Grader output
1 Correct 18 ms 14772 KB Output is correct
2 Correct 81 ms 35580 KB Output is correct
3 Correct 80 ms 35576 KB Output is correct
4 Correct 79 ms 35840 KB Output is correct
5 Correct 20 ms 14800 KB Output is correct
6 Correct 70 ms 27224 KB Output is correct
7 Correct 89 ms 27640 KB Output is correct
8 Correct 105 ms 27956 KB Output is correct
9 Correct 84 ms 28052 KB Output is correct
10 Correct 88 ms 32508 KB Output is correct
11 Correct 99 ms 31740 KB Output is correct

Subtask #10
0 / 12.5

# Verdict Execution time Memory Grader output
1 Correct 18 ms 14772 KB Output is correct
2 Correct 81 ms 35580 KB Output is correct
3 Correct 80 ms 35576 KB Output is correct
4 Correct 79 ms 35840 KB Output is correct
5 Correct 20 ms 14800 KB Output is correct
6 Correct 70 ms 27224 KB Output is correct
7 Correct 89 ms 27640 KB Output is correct
8 Correct 105 ms 27956 KB Output is correct
9 Correct 84 ms 28052 KB Output is correct
10 Correct 88 ms 32508 KB Output is correct
11 Correct 99 ms 31740 KB Output is correct
12 Correct 18 ms 14800 KB Output is correct
13 Execution timed out 3567 ms 36608 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #11
17.5 / 17.5

# Verdict Execution time Memory Grader output
1 Correct 21 ms 14800 KB Output is correct
2 Correct 23 ms 14812 KB Output is correct
3 Correct 32 ms 14968 KB Output is correct
4 Correct 33 ms 14792 KB Output is correct
5 Correct 31 ms 15120 KB Output is correct
6 Correct 30 ms 14832 KB Output is correct
7 Correct 20 ms 14740 KB Output is correct
8 Correct 87 ms 27092 KB Output is correct
9 Correct 93 ms 27132 KB Output is correct
10 Correct 23 ms 14800 KB Output is correct
11 Correct 81 ms 35580 KB Output is correct
12 Correct 87 ms 35620 KB Output is correct
13 Correct 100 ms 35556 KB Output is correct
14 Correct 20 ms 14800 KB Output is correct
15 Correct 90 ms 27180 KB Output is correct
16 Correct 94 ms 27664 KB Output is correct
17 Correct 98 ms 28088 KB Output is correct
18 Correct 90 ms 28160 KB Output is correct
19 Correct 89 ms 32504 KB Output is correct
20 Correct 100 ms 31740 KB Output is correct
21 Correct 76 ms 27232 KB Output is correct
22 Correct 78 ms 27388 KB Output is correct
23 Correct 82 ms 27628 KB Output is correct
24 Correct 80 ms 27640 KB Output is correct
25 Correct 85 ms 29440 KB Output is correct
26 Correct 82 ms 27412 KB Output is correct
27 Correct 74 ms 27132 KB Output is correct

Subtask #12
0 / 17.5

# Verdict Execution time Memory Grader output
1 Correct 21 ms 14800 KB Output is correct
2 Correct 23 ms 14812 KB Output is correct
3 Correct 32 ms 14968 KB Output is correct
4 Correct 33 ms 14792 KB Output is correct
5 Correct 31 ms 15120 KB Output is correct
6 Correct 30 ms 14832 KB Output is correct
7 Correct 20 ms 14740 KB Output is correct
8 Correct 87 ms 27092 KB Output is correct
9 Correct 93 ms 27132 KB Output is correct
10 Correct 23 ms 14800 KB Output is correct
11 Correct 81 ms 35580 KB Output is correct
12 Correct 87 ms 35620 KB Output is correct
13 Correct 100 ms 35556 KB Output is correct
14 Correct 20 ms 14800 KB Output is correct
15 Correct 90 ms 27180 KB Output is correct
16 Correct 94 ms 27664 KB Output is correct
17 Correct 98 ms 28088 KB Output is correct
18 Correct 90 ms 28160 KB Output is correct
19 Correct 89 ms 32504 KB Output is correct
20 Correct 100 ms 31740 KB Output is correct
21 Correct 76 ms 27232 KB Output is correct
22 Correct 78 ms 27388 KB Output is correct
23 Correct 82 ms 27628 KB Output is correct
24 Correct 80 ms 27640 KB Output is correct
25 Correct 85 ms 29440 KB Output is correct
26 Correct 82 ms 27412 KB Output is correct
27 Correct 74 ms 27132 KB Output is correct
28 Correct 18 ms 14804 KB Output is correct
29 Correct 41 ms 15108 KB Output is correct
30 Correct 28 ms 15368 KB Output is correct
31 Correct 132 ms 15360 KB Output is correct
32 Correct 129 ms 15620 KB Output is correct
33 Correct 28 ms 15376 KB Output is correct
34 Correct 22 ms 14720 KB Output is correct
35 Correct 89 ms 28424 KB Output is correct
36 Correct 65 ms 28884 KB Output is correct
37 Correct 72 ms 28676 KB Output is correct
38 Correct 17 ms 14748 KB Output is correct
39 Execution timed out 3520 ms 36572 KB Time limit exceeded
40 Halted 0 ms 0 KB -