oj.uz

Submission #911100

# Submission time Handle Problem Language Result Execution time Memory
911100 2024-01-18T12:54:38 Z MinaRagy06 Inside information (BOI21_servers) C++17
82.5 / 100
 3500 ms 90948 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;
vector<array<int, 3>> adj[N];
//0: increasing, 1: decreasing, {ancestor, last weight}
array<int, 3> bl[N][LOG][2];
int st[N], en[N], curt;
void dfs(int i, int par, int part) {
	bl[i][0][0] = {par, part, part};
	bl[i][0][1] = {par, part, part};
	for (int j = 1; j < LOG; j++) {
		{
			bl[i][j][0] = bl[i][j - 1][0];
			auto [lst, lstt, mx] = bl[i][j][0];
			if (lstt <= bl[lst][0][0][1]) {
				bl[i][j][0] = bl[lst][j - 1][0];
				bl[i][j][0][2] = max(bl[i][j][0][2], mx);
			}
		}
		{
			bl[i][j][1] = bl[i][j - 1][1];
			auto [lst, lstt, mx] = bl[i][j][1];
			if (lstt >= bl[lst][0][1][1]) {
				bl[i][j][1] = bl[lst][j - 1][1];
				bl[i][j][1][2] = max(bl[i][j][1][2], mx);
			}
		}
	}
	st[i] = curt++;
	for (auto [nxt, t, nxtidx] : adj[i]) {
		if (nxt == par) continue;
		dfs(nxt, i, t);
	}
	en[i] = curt;
}
bool isanc(int l, int b) {
	if (st[l] <= st[b] && en[b] <= en[l]) {
		return 1;
	}
	return 0;
}
array<int, 2> check(int t, int a, int b) {
	int mx = -1e9, high = bl[a][LOG - 1][t][0];
	if (!isanc(high, b)) {
		return {int(1e9), 0};
	}
	if (a == high || isanc(a, b)) {
		return {int(-1e9), (t == 1? 1 : -1) * int(1e9)};
	}
	for (int j = LOG - 1; j >= 0; j--) {
		if (!isanc(bl[a][j][t][0], b)) {
			mx = max(mx, bl[a][j][t][2]);
			a = bl[a][j][t][0];
		}
	}
	return {max(mx, bl[a][0][t][2]), bl[a][0][t][1]};
}
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];
}
bool checkpath(int a, int b, int t, bool x) {
	array<int, 2> l = check(x, a, b), r = check(!x, b, a);
	if (l[0] <= t && r[0] <= t && (l[1] == r[1] || (x ^ (l[1] < r[1]))) ) {
		return 1;
	} else {
		return 0;
	}
}
const int B = 600;
int main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	auto S = chrono::steady_clock::now().time_since_epoch().count();
	int n, q;
	cin >> n >> q;
	q += n - 1;
	pair<char, vector<int>> v[q];
	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, 1, 0);
	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;
	ll s = 0;
	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);
			upd.push_back({a, b, i});
		} else if (v[i].first == 'Q') {
			int a = v[i].second[0], b = v[i].second[1];
#ifdef MINA
			s += (checkpath(a, b, i, 1));
#else
			cout << (checkpath(a, b, i, 1)? "yes\n" : "no\n");
#endif
		} else {
			int x = v[i].second[0];
			int ans = solve(x, adj[x].size());
			for (auto [a, b, t] : upd) {
				if (isanc(b, x)) {
					array<int, 2> val = check(0, x, b);
					ans += val[0] <= t - 1;
				} else if (isanc(a, x)) {
					array<int, 2> val = check(0, x, a);
					ans += val[0] <= t - 1;
				} else {
					ans += checkpath(x, a, t - 1, 0);
				}
			}
#ifdef MINA
			s += ans;
#else
			cout << ans << '\n';
#endif
		}
	}
#ifdef MINA
	cout << s << '\n';
	auto E = chrono::steady_clock::now().time_since_epoch().count();
	cout << (E - S) / 1e9 << "s\n";
#endif
	return 0;
}

Compilation message

servers.cpp: In function 'int main()':
servers.cpp:85:7: warning: unused variable 'S' [-Wunused-variable]
   85 |  auto S = chrono::steady_clock::now().time_since_epoch().count();
      |       ^
servers.cpp:118:5: warning: unused variable 's' [-Wunused-variable]
  118 |  ll s = 0;
      |     ^

Subtask #1
2.5 / 2.5

# Verdict Execution time Memory Grader output
1 Correct 30 ms 17488 KB Output is correct
2 Correct 35 ms 20312 KB Output is correct
3 Correct 39 ms 20308 KB Output is correct
4 Correct 36 ms 20316 KB Output is correct
5 Correct 35 ms 20304 KB Output is correct
6 Correct 48 ms 20308 KB Output is correct

Subtask #2
2.5 / 2.5

# Verdict Execution time Memory Grader output
1 Correct 30 ms 17488 KB Output is correct
2 Correct 35 ms 20312 KB Output is correct
3 Correct 39 ms 20308 KB Output is correct
4 Correct 36 ms 20316 KB Output is correct
5 Correct 35 ms 20304 KB Output is correct
6 Correct 48 ms 20308 KB Output is correct
7 Correct 42 ms 17044 KB Output is correct
8 Correct 310 ms 19796 KB Output is correct
9 Correct 614 ms 20040 KB Output is correct
10 Correct 278 ms 20052 KB Output is correct
11 Correct 199 ms 20048 KB Output is correct
12 Correct 607 ms 20396 KB Output is correct

Subtask #3
2.5 / 2.5

# Verdict Execution time Memory Grader output
1 Correct 31 ms 17112 KB Output is correct
2 Correct 290 ms 85620 KB Output is correct
3 Correct 285 ms 85304 KB Output is correct

Subtask #4
2.5 / 2.5

# Verdict Execution time Memory Grader output
1 Correct 31 ms 17112 KB Output is correct
2 Correct 290 ms 85620 KB Output is correct
3 Correct 285 ms 85304 KB Output is correct
4 Correct 40 ms 17264 KB Output is correct
5 Correct 873 ms 90808 KB Output is correct
6 Correct 1120 ms 90112 KB Output is correct
7 Correct 1374 ms 90080 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 17304 KB Output is correct
2 Correct 288 ms 89680 KB Output is correct
3 Correct 263 ms 89652 KB Output is correct
4 Correct 310 ms 89464 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 17304 KB Output is correct
2 Correct 288 ms 89680 KB Output is correct
3 Correct 263 ms 89652 KB Output is correct
4 Correct 310 ms 89464 KB Output is correct
5 Correct 30 ms 17240 KB Output is correct
6 Correct 450 ms 89484 KB Output is correct
7 Correct 1358 ms 89316 KB Output is correct
8 Correct 594 ms 88824 KB Output is correct
9 Correct 628 ms 88760 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 17164 KB Output is correct
2 Correct 257 ms 85748 KB Output is correct
3 Correct 292 ms 85724 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 17164 KB Output is correct
2 Correct 257 ms 85748 KB Output is correct
3 Correct 292 ms 85724 KB Output is correct
4 Correct 39 ms 17252 KB Output is correct
5 Correct 1687 ms 85720 KB Output is correct
6 Correct 479 ms 85324 KB Output is correct

Subtask #9
12.5 / 12.5

# Verdict Execution time Memory Grader output
1 Correct 28 ms 17244 KB Output is correct
2 Correct 327 ms 89648 KB Output is correct
3 Correct 305 ms 89584 KB Output is correct
4 Correct 383 ms 89384 KB Output is correct
5 Correct 36 ms 17252 KB Output is correct
6 Correct 254 ms 85708 KB Output is correct
7 Correct 292 ms 85704 KB Output is correct
8 Correct 290 ms 86204 KB Output is correct
9 Correct 336 ms 86548 KB Output is correct
10 Correct 439 ms 87888 KB Output is correct
11 Correct 448 ms 87520 KB Output is correct

Subtask #10
12.5 / 12.5

# Verdict Execution time Memory Grader output
1 Correct 28 ms 17244 KB Output is correct
2 Correct 327 ms 89648 KB Output is correct
3 Correct 305 ms 89584 KB Output is correct
4 Correct 383 ms 89384 KB Output is correct
5 Correct 36 ms 17252 KB Output is correct
6 Correct 254 ms 85708 KB Output is correct
7 Correct 292 ms 85704 KB Output is correct
8 Correct 290 ms 86204 KB Output is correct
9 Correct 336 ms 86548 KB Output is correct
10 Correct 439 ms 87888 KB Output is correct
11 Correct 448 ms 87520 KB Output is correct
12 Correct 29 ms 17236 KB Output is correct
13 Correct 446 ms 89084 KB Output is correct
14 Correct 1355 ms 89344 KB Output is correct
15 Correct 560 ms 88924 KB Output is correct
16 Correct 569 ms 88904 KB Output is correct
17 Correct 38 ms 17236 KB Output is correct
18 Correct 1643 ms 85696 KB Output is correct
19 Correct 497 ms 85332 KB Output is correct
20 Correct 704 ms 85848 KB Output is correct
21 Correct 555 ms 86104 KB Output is correct
22 Correct 3084 ms 86704 KB Output is correct
23 Correct 3442 ms 87808 KB Output is correct
24 Correct 1572 ms 88720 KB Output is correct

Subtask #11
17.5 / 17.5

# Verdict Execution time Memory Grader output
1 Correct 31 ms 17236 KB Output is correct
2 Correct 36 ms 20376 KB Output is correct
3 Correct 46 ms 20308 KB Output is correct
4 Correct 45 ms 20304 KB Output is correct
5 Correct 38 ms 20472 KB Output is correct
6 Correct 42 ms 20308 KB Output is correct
7 Correct 32 ms 17220 KB Output is correct
8 Correct 299 ms 85696 KB Output is correct
9 Correct 295 ms 85272 KB Output is correct
10 Correct 27 ms 17260 KB Output is correct
11 Correct 278 ms 89520 KB Output is correct
12 Correct 297 ms 89892 KB Output is correct
13 Correct 359 ms 89680 KB Output is correct
14 Correct 28 ms 17240 KB Output is correct
15 Correct 257 ms 85852 KB Output is correct
16 Correct 284 ms 85840 KB Output is correct
17 Correct 298 ms 86368 KB Output is correct
18 Correct 329 ms 86196 KB Output is correct
19 Correct 450 ms 88248 KB Output is correct
20 Correct 451 ms 87380 KB Output is correct
21 Correct 292 ms 85988 KB Output is correct
22 Correct 304 ms 85880 KB Output is correct
23 Correct 314 ms 86688 KB Output is correct
24 Correct 318 ms 86352 KB Output is correct
25 Correct 317 ms 86360 KB Output is correct
26 Correct 333 ms 85328 KB Output is correct
27 Correct 310 ms 85588 KB Output is correct

Subtask #12
0 / 17.5

# Verdict Execution time Memory Grader output
1 Correct 31 ms 17236 KB Output is correct
2 Correct 36 ms 20376 KB Output is correct
3 Correct 46 ms 20308 KB Output is correct
4 Correct 45 ms 20304 KB Output is correct
5 Correct 38 ms 20472 KB Output is correct
6 Correct 42 ms 20308 KB Output is correct
7 Correct 32 ms 17220 KB Output is correct
8 Correct 299 ms 85696 KB Output is correct
9 Correct 295 ms 85272 KB Output is correct
10 Correct 27 ms 17260 KB Output is correct
11 Correct 278 ms 89520 KB Output is correct
12 Correct 297 ms 89892 KB Output is correct
13 Correct 359 ms 89680 KB Output is correct
14 Correct 28 ms 17240 KB Output is correct
15 Correct 257 ms 85852 KB Output is correct
16 Correct 284 ms 85840 KB Output is correct
17 Correct 298 ms 86368 KB Output is correct
18 Correct 329 ms 86196 KB Output is correct
19 Correct 450 ms 88248 KB Output is correct
20 Correct 451 ms 87380 KB Output is correct
21 Correct 292 ms 85988 KB Output is correct
22 Correct 304 ms 85880 KB Output is correct
23 Correct 314 ms 86688 KB Output is correct
24 Correct 318 ms 86352 KB Output is correct
25 Correct 317 ms 86360 KB Output is correct
26 Correct 333 ms 85328 KB Output is correct
27 Correct 310 ms 85588 KB Output is correct
28 Correct 42 ms 17184 KB Output is correct
29 Correct 289 ms 20008 KB Output is correct
30 Correct 613 ms 20320 KB Output is correct
31 Correct 280 ms 20048 KB Output is correct
32 Correct 199 ms 20152 KB Output is correct
33 Correct 613 ms 20364 KB Output is correct
34 Correct 40 ms 17232 KB Output is correct
35 Correct 940 ms 90948 KB Output is correct
36 Correct 972 ms 90092 KB Output is correct
37 Correct 1368 ms 90112 KB Output is correct
38 Correct 29 ms 17232 KB Output is correct
39 Correct 421 ms 89396 KB Output is correct
40 Correct 1308 ms 89612 KB Output is correct
41 Correct 570 ms 89000 KB Output is correct
42 Correct 567 ms 88824 KB Output is correct
43 Correct 37 ms 17232 KB Output is correct
44 Correct 1627 ms 85396 KB Output is correct
45 Correct 502 ms 85444 KB Output is correct
46 Correct 696 ms 86128 KB Output is correct
47 Correct 551 ms 86236 KB Output is correct
48 Correct 3178 ms 86600 KB Output is correct
49 Execution timed out 3556 ms 88192 KB Time limit exceeded
50 Halted 0 ms 0 KB -