oj.uz

답안 #910166

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
910166 2024-01-18T00:52:40 Z MinaRagy06 Inside information (BOI21_servers) C++17
67.5 / 100
 3500 ms 88944 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;
vector<array<int, 3>> adj[N];
//0: increasing, 1: decreasing, {ancestor, last weight}
array<int, 3> bl[N][18][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 < 18; 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][17][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 = 17; 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 = 100;
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 i = 1; i <= n; i++) {
				for (int j = 0; j <= SZ(adj[i]); j++) {
					dp[i][j] = -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 {
					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

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 16220 KB Output is correct
2 Correct 38 ms 18768 KB Output is correct
3 Correct 40 ms 19028 KB Output is correct
4 Correct 38 ms 18824 KB Output is correct
5 Correct 33 ms 19024 KB Output is correct
6 Correct 53 ms 18984 KB Output is correct

Subtask #2
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 16220 KB Output is correct
2 Correct 38 ms 18768 KB Output is correct
3 Correct 40 ms 19028 KB Output is correct
4 Correct 38 ms 18824 KB Output is correct
5 Correct 33 ms 19024 KB Output is correct
6 Correct 53 ms 18984 KB Output is correct
7 Correct 42 ms 16336 KB Output is correct
8 Correct 80 ms 18904 KB Output is correct
9 Correct 135 ms 19052 KB Output is correct
10 Correct 83 ms 18792 KB Output is correct
11 Correct 82 ms 19024 KB Output is correct
12 Correct 186 ms 19284 KB Output is correct

Subtask #3
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 16624 KB Output is correct
2 Correct 713 ms 82444 KB Output is correct
3 Correct 672 ms 82560 KB Output is correct

Subtask #4
0 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 16624 KB Output is correct
2 Correct 713 ms 82444 KB Output is correct
3 Correct 672 ms 82560 KB Output is correct
4 Correct 45 ms 16220 KB Output is correct
5 Correct 3310 ms 88156 KB Output is correct
6 Execution timed out 3541 ms 88292 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 16208 KB Output is correct
2 Correct 690 ms 86356 KB Output is correct
3 Correct 654 ms 86368 KB Output is correct
4 Correct 713 ms 86360 KB Output is correct

Subtask #6
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 16208 KB Output is correct
2 Correct 690 ms 86356 KB Output is correct
3 Correct 654 ms 86368 KB Output is correct
4 Correct 713 ms 86360 KB Output is correct
5 Correct 30 ms 16220 KB Output is correct
6 Correct 712 ms 86536 KB Output is correct
7 Correct 2522 ms 86348 KB Output is correct
8 Correct 728 ms 86244 KB Output is correct
9 Correct 713 ms 86096 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 16220 KB Output is correct
2 Correct 646 ms 82448 KB Output is correct
3 Correct 673 ms 82464 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 16220 KB Output is correct
2 Correct 646 ms 82448 KB Output is correct
3 Correct 673 ms 82464 KB Output is correct
4 Correct 38 ms 16220 KB Output is correct
5 Correct 1282 ms 82760 KB Output is correct
6 Correct 746 ms 82668 KB Output is correct

Subtask #9
12.5 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 16260 KB Output is correct
2 Correct 644 ms 86376 KB Output is correct
3 Correct 687 ms 86412 KB Output is correct
4 Correct 707 ms 86132 KB Output is correct
5 Correct 27 ms 16208 KB Output is correct
6 Correct 634 ms 82772 KB Output is correct
7 Correct 708 ms 82508 KB Output is correct
8 Correct 675 ms 82932 KB Output is correct
9 Correct 701 ms 83032 KB Output is correct
10 Correct 1349 ms 84680 KB Output is correct
11 Correct 1317 ms 84140 KB Output is correct

Subtask #10
0 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 16260 KB Output is correct
2 Correct 644 ms 86376 KB Output is correct
3 Correct 687 ms 86412 KB Output is correct
4 Correct 707 ms 86132 KB Output is correct
5 Correct 27 ms 16208 KB Output is correct
6 Correct 634 ms 82772 KB Output is correct
7 Correct 708 ms 82508 KB Output is correct
8 Correct 675 ms 82932 KB Output is correct
9 Correct 701 ms 83032 KB Output is correct
10 Correct 1349 ms 84680 KB Output is correct
11 Correct 1317 ms 84140 KB Output is correct
12 Correct 29 ms 16220 KB Output is correct
13 Correct 690 ms 86148 KB Output is correct
14 Correct 2693 ms 86428 KB Output is correct
15 Correct 736 ms 86504 KB Output is correct
16 Correct 747 ms 86516 KB Output is correct
17 Correct 38 ms 16220 KB Output is correct
18 Correct 1210 ms 82548 KB Output is correct
19 Correct 722 ms 82512 KB Output is correct
20 Correct 813 ms 82768 KB Output is correct
21 Correct 804 ms 83024 KB Output is correct
22 Correct 3149 ms 84236 KB Output is correct
23 Execution timed out 3537 ms 84504 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #11
17.5 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 16364 KB Output is correct
2 Correct 36 ms 18824 KB Output is correct
3 Correct 41 ms 19008 KB Output is correct
4 Correct 42 ms 19032 KB Output is correct
5 Correct 34 ms 18940 KB Output is correct
6 Correct 42 ms 18912 KB Output is correct
7 Correct 33 ms 16220 KB Output is correct
8 Correct 668 ms 82524 KB Output is correct
9 Correct 665 ms 82548 KB Output is correct
10 Correct 26 ms 16208 KB Output is correct
11 Correct 655 ms 86352 KB Output is correct
12 Correct 681 ms 86360 KB Output is correct
13 Correct 688 ms 86536 KB Output is correct
14 Correct 28 ms 16220 KB Output is correct
15 Correct 637 ms 82360 KB Output is correct
16 Correct 680 ms 82704 KB Output is correct
17 Correct 667 ms 82948 KB Output is correct
18 Correct 713 ms 83028 KB Output is correct
19 Correct 1315 ms 84648 KB Output is correct
20 Correct 1330 ms 84304 KB Output is correct
21 Correct 664 ms 82368 KB Output is correct
22 Correct 685 ms 82736 KB Output is correct
23 Correct 690 ms 83280 KB Output is correct
24 Correct 691 ms 83548 KB Output is correct
25 Correct 683 ms 83416 KB Output is correct
26 Correct 973 ms 82132 KB Output is correct
27 Correct 945 ms 82000 KB Output is correct

Subtask #12
0 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 16364 KB Output is correct
2 Correct 36 ms 18824 KB Output is correct
3 Correct 41 ms 19008 KB Output is correct
4 Correct 42 ms 19032 KB Output is correct
5 Correct 34 ms 18940 KB Output is correct
6 Correct 42 ms 18912 KB Output is correct
7 Correct 33 ms 16220 KB Output is correct
8 Correct 668 ms 82524 KB Output is correct
9 Correct 665 ms 82548 KB Output is correct
10 Correct 26 ms 16208 KB Output is correct
11 Correct 655 ms 86352 KB Output is correct
12 Correct 681 ms 86360 KB Output is correct
13 Correct 688 ms 86536 KB Output is correct
14 Correct 28 ms 16220 KB Output is correct
15 Correct 637 ms 82360 KB Output is correct
16 Correct 680 ms 82704 KB Output is correct
17 Correct 667 ms 82948 KB Output is correct
18 Correct 713 ms 83028 KB Output is correct
19 Correct 1315 ms 84648 KB Output is correct
20 Correct 1330 ms 84304 KB Output is correct
21 Correct 664 ms 82368 KB Output is correct
22 Correct 685 ms 82736 KB Output is correct
23 Correct 690 ms 83280 KB Output is correct
24 Correct 691 ms 83548 KB Output is correct
25 Correct 683 ms 83416 KB Output is correct
26 Correct 973 ms 82132 KB Output is correct
27 Correct 945 ms 82000 KB Output is correct
28 Correct 46 ms 16208 KB Output is correct
29 Correct 79 ms 18772 KB Output is correct
30 Correct 134 ms 19024 KB Output is correct
31 Correct 82 ms 18820 KB Output is correct
32 Correct 82 ms 19276 KB Output is correct
33 Correct 186 ms 19284 KB Output is correct
34 Correct 41 ms 16348 KB Output is correct
35 Correct 2995 ms 88360 KB Output is correct
36 Correct 3371 ms 88944 KB Output is correct
37 Correct 3359 ms 88660 KB Output is correct
38 Correct 29 ms 16216 KB Output is correct
39 Correct 747 ms 86368 KB Output is correct
40 Correct 2563 ms 86436 KB Output is correct
41 Correct 719 ms 86096 KB Output is correct
42 Correct 747 ms 86276 KB Output is correct
43 Correct 38 ms 16312 KB Output is correct
44 Correct 1244 ms 82764 KB Output is correct
45 Correct 730 ms 82500 KB Output is correct
46 Correct 759 ms 82888 KB Output is correct
47 Correct 773 ms 83140 KB Output is correct
48 Correct 2682 ms 84332 KB Output is correct
49 Execution timed out 3548 ms 84908 KB Time limit exceeded
50 Halted 0 ms 0 KB -