oj.uz

답안 #910131

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
910131 2024-01-17T23:45:40 Z MinaRagy06 Inside information (BOI21_servers) C++17
70 / 100
 3500 ms 93608 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[2][18][N];
int st[N], en[N], curt;
void dfs(int i, int par, int part) {
	bl[0][0][i] = {par, part, part};
	bl[1][0][i] = {par, part, part};
	for (int j = 1; j < 18; j++) {
		bl[0][j][i] = bl[0][j - 1][i];
		auto [lst, lstt, mx] = bl[0][j][i];
		if (lstt <= bl[0][0][lst][1]) {
			bl[0][j][i] = bl[0][j - 1][lst];
			bl[0][j][i][2] = max(bl[0][j][i][2], mx);
		}
	}
	for (int j = 1; j < 18; j++) {
		bl[1][j][i] = bl[1][j - 1][i];
		auto [lst, lstt, mx] = bl[1][j][i];
		if (lstt >= bl[1][0][lst][1]) {
			bl[1][j][i] = bl[1][j - 1][lst];
			bl[1][j][i][2] = max(bl[1][j][i][2], mx);
		}
	}
	st[i] = curt++;
	for (auto [nxt, t, nxtidx] : adj[i]) {
		if (nxt == par) continue;
		dfs(nxt, i, t);
	}
	en[i] = curt;
}
bool lca(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[t][17][a][0];
	if (!lca(high, b)) {
		return {int(1e9), 0};
	}
	if (a == high || lca(a, b)) {
		return {int(-1e9), (t == 1? 1 : -1) * int(1e9)};
	}
	for (int j = 17; j >= 0; j--) {
		if (!lca(bl[t][j][a][0], b) && !lca(bl[t][j][a][0], high)) {
			mx = max(mx, bl[t][j][a][2]);
			a = bl[t][j][a][0];
		}
	}
	return {max(mx, bl[t][0][a][2]), bl[t][0][a][1]};
}
vector<array<int, 3>> curadj[N];
vector<int> dp[N];
int lst;
int solve(int i, int par) {
	if (~dp[i][par]) return dp[i][par];
	int prv = -1;
	if (par < SZ(adj[i])) prv = adj[i][par][1];
	dp[i][par] = 1;
	for (int j = 0; j < SZ(adj[i]); j++) {
		auto [nxt, t, nxtidx] = adj[i][j];
		if (t > lst) break;
		if (j == par || prv >= t) continue;
		dp[i][par] += solve(nxt, nxtidx);
	}
	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 = 250;
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) {
// 			for (auto [a, b, t] : upd) {
// 				int x = curadj[b].size(), y = curadj[a].size();
// 				curadj[a].push_back({b, t, x});
// 				curadj[b].push_back({a, t, y});
// 			}
			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];
			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
// 			cout << i << endl;
			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) {
				ans += checkpath(x, b, t - 1, 0) || checkpath(x, a, t - 1, 0);
			}
#ifdef MINA
// 			cout << i << endl;
			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';
#endif
	return 0;
}

Compilation message

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

Subtask #1
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 68436 KB Output is correct
2 Correct 41 ms 68876 KB Output is correct
3 Correct 50 ms 68972 KB Output is correct
4 Correct 49 ms 68948 KB Output is correct
5 Correct 42 ms 68896 KB Output is correct
6 Correct 71 ms 68952 KB Output is correct

Subtask #2
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 68436 KB Output is correct
2 Correct 41 ms 68876 KB Output is correct
3 Correct 50 ms 68972 KB Output is correct
4 Correct 49 ms 68948 KB Output is correct
5 Correct 42 ms 68896 KB Output is correct
6 Correct 71 ms 68952 KB Output is correct
7 Correct 53 ms 68436 KB Output is correct
8 Correct 209 ms 68688 KB Output is correct
9 Correct 516 ms 69020 KB Output is correct
10 Correct 239 ms 68960 KB Output is correct
11 Correct 298 ms 69040 KB Output is correct
12 Correct 778 ms 69172 KB Output is correct

Subtask #3
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 68332 KB Output is correct
2 Correct 527 ms 85252 KB Output is correct
3 Correct 518 ms 85268 KB Output is correct

Subtask #4
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 68332 KB Output is correct
2 Correct 527 ms 85252 KB Output is correct
3 Correct 518 ms 85268 KB Output is correct
4 Correct 61 ms 68264 KB Output is correct
5 Correct 3402 ms 85908 KB Output is correct
6 Correct 2044 ms 85728 KB Output is correct
7 Correct 2591 ms 85548 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 68272 KB Output is correct
2 Correct 407 ms 89172 KB Output is correct
3 Correct 413 ms 89136 KB Output is correct
4 Correct 418 ms 88916 KB Output is correct

Subtask #6
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 68272 KB Output is correct
2 Correct 407 ms 89172 KB Output is correct
3 Correct 413 ms 89136 KB Output is correct
4 Correct 418 ms 88916 KB Output is correct
5 Correct 39 ms 68436 KB Output is correct
6 Correct 547 ms 89212 KB Output is correct
7 Correct 1657 ms 93608 KB Output is correct
8 Correct 630 ms 89000 KB Output is correct
9 Correct 624 ms 88812 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 68440 KB Output is correct
2 Correct 382 ms 85780 KB Output is correct
3 Correct 448 ms 85280 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 68440 KB Output is correct
2 Correct 382 ms 85780 KB Output is correct
3 Correct 448 ms 85280 KB Output is correct
4 Correct 53 ms 68432 KB Output is correct
5 Correct 1498 ms 85192 KB Output is correct
6 Correct 575 ms 85132 KB Output is correct

Subtask #9
12.5 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 68436 KB Output is correct
2 Correct 401 ms 89436 KB Output is correct
3 Correct 433 ms 89368 KB Output is correct
4 Correct 398 ms 89104 KB Output is correct
5 Correct 36 ms 68332 KB Output is correct
6 Correct 395 ms 85388 KB Output is correct
7 Correct 424 ms 85276 KB Output is correct
8 Correct 440 ms 85840 KB Output is correct
9 Correct 512 ms 85868 KB Output is correct
10 Correct 811 ms 87636 KB Output is correct
11 Correct 797 ms 87216 KB Output is correct

Subtask #10
0 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 68436 KB Output is correct
2 Correct 401 ms 89436 KB Output is correct
3 Correct 433 ms 89368 KB Output is correct
4 Correct 398 ms 89104 KB Output is correct
5 Correct 36 ms 68332 KB Output is correct
6 Correct 395 ms 85388 KB Output is correct
7 Correct 424 ms 85276 KB Output is correct
8 Correct 440 ms 85840 KB Output is correct
9 Correct 512 ms 85868 KB Output is correct
10 Correct 811 ms 87636 KB Output is correct
11 Correct 797 ms 87216 KB Output is correct
12 Correct 40 ms 68432 KB Output is correct
13 Correct 531 ms 89040 KB Output is correct
14 Correct 1614 ms 93316 KB Output is correct
15 Correct 654 ms 88968 KB Output is correct
16 Correct 640 ms 88820 KB Output is correct
17 Correct 50 ms 68300 KB Output is correct
18 Correct 1484 ms 85484 KB Output is correct
19 Correct 585 ms 85328 KB Output is correct
20 Correct 738 ms 85952 KB Output is correct
21 Correct 647 ms 85588 KB Output is correct
22 Correct 3037 ms 88644 KB Output is correct
23 Execution timed out 3563 ms 89172 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #11
17.5 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 68328 KB Output is correct
2 Correct 42 ms 68948 KB Output is correct
3 Correct 48 ms 69088 KB Output is correct
4 Correct 45 ms 68952 KB Output is correct
5 Correct 42 ms 68944 KB Output is correct
6 Correct 49 ms 68936 KB Output is correct
7 Correct 38 ms 68432 KB Output is correct
8 Correct 536 ms 85244 KB Output is correct
9 Correct 537 ms 85256 KB Output is correct
10 Correct 34 ms 68444 KB Output is correct
11 Correct 406 ms 89180 KB Output is correct
12 Correct 413 ms 89132 KB Output is correct
13 Correct 420 ms 89168 KB Output is correct
14 Correct 37 ms 68436 KB Output is correct
15 Correct 391 ms 85436 KB Output is correct
16 Correct 453 ms 85332 KB Output is correct
17 Correct 443 ms 85848 KB Output is correct
18 Correct 514 ms 86144 KB Output is correct
19 Correct 829 ms 87640 KB Output is correct
20 Correct 786 ms 86968 KB Output is correct
21 Correct 529 ms 85188 KB Output is correct
22 Correct 558 ms 85460 KB Output is correct
23 Correct 499 ms 86024 KB Output is correct
24 Correct 502 ms 86096 KB Output is correct
25 Correct 510 ms 86220 KB Output is correct
26 Correct 596 ms 85584 KB Output is correct
27 Correct 546 ms 84816 KB Output is correct

Subtask #12
0 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 68328 KB Output is correct
2 Correct 42 ms 68948 KB Output is correct
3 Correct 48 ms 69088 KB Output is correct
4 Correct 45 ms 68952 KB Output is correct
5 Correct 42 ms 68944 KB Output is correct
6 Correct 49 ms 68936 KB Output is correct
7 Correct 38 ms 68432 KB Output is correct
8 Correct 536 ms 85244 KB Output is correct
9 Correct 537 ms 85256 KB Output is correct
10 Correct 34 ms 68444 KB Output is correct
11 Correct 406 ms 89180 KB Output is correct
12 Correct 413 ms 89132 KB Output is correct
13 Correct 420 ms 89168 KB Output is correct
14 Correct 37 ms 68436 KB Output is correct
15 Correct 391 ms 85436 KB Output is correct
16 Correct 453 ms 85332 KB Output is correct
17 Correct 443 ms 85848 KB Output is correct
18 Correct 514 ms 86144 KB Output is correct
19 Correct 829 ms 87640 KB Output is correct
20 Correct 786 ms 86968 KB Output is correct
21 Correct 529 ms 85188 KB Output is correct
22 Correct 558 ms 85460 KB Output is correct
23 Correct 499 ms 86024 KB Output is correct
24 Correct 502 ms 86096 KB Output is correct
25 Correct 510 ms 86220 KB Output is correct
26 Correct 596 ms 85584 KB Output is correct
27 Correct 546 ms 84816 KB Output is correct
28 Correct 62 ms 68564 KB Output is correct
29 Correct 204 ms 68784 KB Output is correct
30 Correct 474 ms 69104 KB Output is correct
31 Correct 238 ms 68916 KB Output is correct
32 Correct 259 ms 68948 KB Output is correct
33 Correct 814 ms 69052 KB Output is correct
34 Correct 59 ms 68692 KB Output is correct
35 Correct 3454 ms 85552 KB Output is correct
36 Correct 2114 ms 85724 KB Output is correct
37 Correct 3227 ms 85444 KB Output is correct
38 Correct 39 ms 68364 KB Output is correct
39 Correct 574 ms 89060 KB Output is correct
40 Correct 1660 ms 93116 KB Output is correct
41 Correct 709 ms 88760 KB Output is correct
42 Correct 711 ms 88776 KB Output is correct
43 Correct 53 ms 68360 KB Output is correct
44 Correct 1590 ms 85328 KB Output is correct
45 Correct 650 ms 85196 KB Output is correct
46 Correct 816 ms 85852 KB Output is correct
47 Correct 708 ms 85792 KB Output is correct
48 Correct 3472 ms 88496 KB Output is correct
49 Execution timed out 3532 ms 89132 KB Time limit exceeded
50 Halted 0 ms 0 KB -