oj.uz

답안 #910130

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
910130 2024-01-17T23:44:17 Z MinaRagy06 Inside information (BOI21_servers) C++17
70 / 100
 3500 ms 93364 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 = 300;
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 36 ms 68444 KB Output is correct
2 Correct 55 ms 68868 KB Output is correct
3 Correct 46 ms 68944 KB Output is correct
4 Correct 46 ms 68944 KB Output is correct
5 Correct 40 ms 68952 KB Output is correct
6 Correct 46 ms 68916 KB Output is correct

Subtask #2
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 68444 KB Output is correct
2 Correct 55 ms 68868 KB Output is correct
3 Correct 46 ms 68944 KB Output is correct
4 Correct 46 ms 68944 KB Output is correct
5 Correct 40 ms 68952 KB Output is correct
6 Correct 46 ms 68916 KB Output is correct
7 Correct 61 ms 68296 KB Output is correct
8 Correct 238 ms 68700 KB Output is correct
9 Correct 561 ms 69220 KB Output is correct
10 Correct 301 ms 68964 KB Output is correct
11 Correct 130 ms 68944 KB Output is correct
12 Correct 453 ms 68948 KB Output is correct

Subtask #3
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 68436 KB Output is correct
2 Correct 509 ms 85440 KB Output is correct
3 Correct 500 ms 85252 KB Output is correct

Subtask #4
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 68436 KB Output is correct
2 Correct 509 ms 85440 KB Output is correct
3 Correct 500 ms 85252 KB Output is correct
4 Correct 56 ms 68436 KB Output is correct
5 Correct 3140 ms 85692 KB Output is correct
6 Correct 1830 ms 85860 KB Output is correct
7 Correct 2484 ms 85812 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 68432 KB Output is correct
2 Correct 381 ms 89424 KB Output is correct
3 Correct 374 ms 89168 KB Output is correct
4 Correct 386 ms 89240 KB Output is correct

Subtask #6
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 68432 KB Output is correct
2 Correct 381 ms 89424 KB Output is correct
3 Correct 374 ms 89168 KB Output is correct
4 Correct 386 ms 89240 KB Output is correct
5 Correct 38 ms 68432 KB Output is correct
6 Correct 557 ms 89460 KB Output is correct
7 Correct 1478 ms 92944 KB Output is correct
8 Correct 694 ms 88916 KB Output is correct
9 Correct 657 ms 88976 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 68436 KB Output is correct
2 Correct 341 ms 85476 KB Output is correct
3 Correct 413 ms 85304 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 68436 KB Output is correct
2 Correct 341 ms 85476 KB Output is correct
3 Correct 413 ms 85304 KB Output is correct
4 Correct 49 ms 68432 KB Output is correct
5 Correct 1591 ms 85584 KB Output is correct
6 Correct 580 ms 85444 KB Output is correct

Subtask #9
12.5 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 68436 KB Output is correct
2 Correct 398 ms 89164 KB Output is correct
3 Correct 386 ms 88988 KB Output is correct
4 Correct 390 ms 89100 KB Output is correct
5 Correct 36 ms 68428 KB Output is correct
6 Correct 366 ms 85168 KB Output is correct
7 Correct 404 ms 85332 KB Output is correct
8 Correct 430 ms 86096 KB Output is correct
9 Correct 478 ms 85844 KB Output is correct
10 Correct 740 ms 87356 KB Output is correct
11 Correct 757 ms 86864 KB Output is correct

Subtask #10
0 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 68436 KB Output is correct
2 Correct 398 ms 89164 KB Output is correct
3 Correct 386 ms 88988 KB Output is correct
4 Correct 390 ms 89100 KB Output is correct
5 Correct 36 ms 68428 KB Output is correct
6 Correct 366 ms 85168 KB Output is correct
7 Correct 404 ms 85332 KB Output is correct
8 Correct 430 ms 86096 KB Output is correct
9 Correct 478 ms 85844 KB Output is correct
10 Correct 740 ms 87356 KB Output is correct
11 Correct 757 ms 86864 KB Output is correct
12 Correct 39 ms 68436 KB Output is correct
13 Correct 553 ms 89024 KB Output is correct
14 Correct 1523 ms 93236 KB Output is correct
15 Correct 672 ms 88992 KB Output is correct
16 Correct 654 ms 88956 KB Output is correct
17 Correct 51 ms 68244 KB Output is correct
18 Correct 1563 ms 85408 KB Output is correct
19 Correct 563 ms 85304 KB Output is correct
20 Correct 770 ms 85584 KB Output is correct
21 Correct 649 ms 85812 KB Output is correct
22 Correct 3228 ms 88328 KB Output is correct
23 Execution timed out 3569 ms 89508 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #11
17.5 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 68436 KB Output is correct
2 Correct 43 ms 68924 KB Output is correct
3 Correct 51 ms 69048 KB Output is correct
4 Correct 52 ms 68968 KB Output is correct
5 Correct 40 ms 68948 KB Output is correct
6 Correct 50 ms 68944 KB Output is correct
7 Correct 45 ms 68436 KB Output is correct
8 Correct 497 ms 85248 KB Output is correct
9 Correct 542 ms 85420 KB Output is correct
10 Correct 33 ms 68440 KB Output is correct
11 Correct 385 ms 89264 KB Output is correct
12 Correct 378 ms 88968 KB Output is correct
13 Correct 403 ms 89172 KB Output is correct
14 Correct 35 ms 68440 KB Output is correct
15 Correct 344 ms 85260 KB Output is correct
16 Correct 393 ms 85328 KB Output is correct
17 Correct 405 ms 85840 KB Output is correct
18 Correct 483 ms 85784 KB Output is correct
19 Correct 786 ms 87556 KB Output is correct
20 Correct 713 ms 87324 KB Output is correct
21 Correct 498 ms 85456 KB Output is correct
22 Correct 495 ms 85368 KB Output is correct
23 Correct 486 ms 86096 KB Output is correct
24 Correct 454 ms 85928 KB Output is correct
25 Correct 483 ms 86040 KB Output is correct
26 Correct 552 ms 84832 KB Output is correct
27 Correct 503 ms 85048 KB Output is correct

Subtask #12
0 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 68436 KB Output is correct
2 Correct 43 ms 68924 KB Output is correct
3 Correct 51 ms 69048 KB Output is correct
4 Correct 52 ms 68968 KB Output is correct
5 Correct 40 ms 68948 KB Output is correct
6 Correct 50 ms 68944 KB Output is correct
7 Correct 45 ms 68436 KB Output is correct
8 Correct 497 ms 85248 KB Output is correct
9 Correct 542 ms 85420 KB Output is correct
10 Correct 33 ms 68440 KB Output is correct
11 Correct 385 ms 89264 KB Output is correct
12 Correct 378 ms 88968 KB Output is correct
13 Correct 403 ms 89172 KB Output is correct
14 Correct 35 ms 68440 KB Output is correct
15 Correct 344 ms 85260 KB Output is correct
16 Correct 393 ms 85328 KB Output is correct
17 Correct 405 ms 85840 KB Output is correct
18 Correct 483 ms 85784 KB Output is correct
19 Correct 786 ms 87556 KB Output is correct
20 Correct 713 ms 87324 KB Output is correct
21 Correct 498 ms 85456 KB Output is correct
22 Correct 495 ms 85368 KB Output is correct
23 Correct 486 ms 86096 KB Output is correct
24 Correct 454 ms 85928 KB Output is correct
25 Correct 483 ms 86040 KB Output is correct
26 Correct 552 ms 84832 KB Output is correct
27 Correct 503 ms 85048 KB Output is correct
28 Correct 55 ms 68416 KB Output is correct
29 Correct 224 ms 68756 KB Output is correct
30 Correct 544 ms 69204 KB Output is correct
31 Correct 282 ms 68944 KB Output is correct
32 Correct 148 ms 69016 KB Output is correct
33 Correct 456 ms 68948 KB Output is correct
34 Correct 63 ms 68532 KB Output is correct
35 Correct 3222 ms 85660 KB Output is correct
36 Correct 1858 ms 85608 KB Output is correct
37 Correct 2337 ms 85296 KB Output is correct
38 Correct 38 ms 68432 KB Output is correct
39 Correct 545 ms 88956 KB Output is correct
40 Correct 1478 ms 93364 KB Output is correct
41 Correct 664 ms 89144 KB Output is correct
42 Correct 647 ms 89168 KB Output is correct
43 Correct 50 ms 68432 KB Output is correct
44 Correct 1616 ms 85660 KB Output is correct
45 Correct 555 ms 85328 KB Output is correct
46 Correct 758 ms 85796 KB Output is correct
47 Correct 629 ms 85604 KB Output is correct
48 Correct 3292 ms 88448 KB Output is correct
49 Execution timed out 3548 ms 89300 KB Time limit exceeded
50 Halted 0 ms 0 KB -