oj.uz

답안 #911105

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
911105 2024-01-18T12:58:52 Z MinaRagy06 Inside information (BOI21_servers) C++17
70 / 100
 3500 ms 89944 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 = 620;
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

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 17008 KB Output is correct
2 Correct 38 ms 20052 KB Output is correct
3 Correct 42 ms 20048 KB Output is correct
4 Correct 57 ms 20320 KB Output is correct
5 Correct 36 ms 20248 KB Output is correct
6 Correct 61 ms 20048 KB Output is correct

Subtask #2
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 17008 KB Output is correct
2 Correct 38 ms 20052 KB Output is correct
3 Correct 42 ms 20048 KB Output is correct
4 Correct 57 ms 20320 KB Output is correct
5 Correct 36 ms 20248 KB Output is correct
6 Correct 61 ms 20048 KB Output is correct
7 Correct 42 ms 16964 KB Output is correct
8 Correct 316 ms 19804 KB Output is correct
9 Correct 658 ms 20096 KB Output is correct
10 Correct 299 ms 19836 KB Output is correct
11 Correct 152 ms 19824 KB Output is correct
12 Correct 484 ms 19996 KB Output is correct

Subtask #3
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 16916 KB Output is correct
2 Correct 319 ms 84208 KB Output is correct
3 Correct 328 ms 84300 KB Output is correct

Subtask #4
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 16916 KB Output is correct
2 Correct 319 ms 84208 KB Output is correct
3 Correct 328 ms 84300 KB Output is correct
4 Correct 47 ms 16812 KB Output is correct
5 Correct 954 ms 89944 KB Output is correct
6 Correct 958 ms 89724 KB Output is correct
7 Correct 1453 ms 89488 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 16976 KB Output is correct
2 Correct 308 ms 88436 KB Output is correct
3 Correct 284 ms 88532 KB Output is correct
4 Correct 334 ms 88400 KB Output is correct

Subtask #6
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 16976 KB Output is correct
2 Correct 308 ms 88436 KB Output is correct
3 Correct 284 ms 88532 KB Output is correct
4 Correct 334 ms 88400 KB Output is correct
5 Correct 33 ms 16788 KB Output is correct
6 Correct 471 ms 87892 KB Output is correct
7 Correct 1384 ms 88196 KB Output is correct
8 Correct 580 ms 87632 KB Output is correct
9 Correct 577 ms 87700 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 16976 KB Output is correct
2 Correct 247 ms 84308 KB Output is correct
3 Correct 278 ms 84252 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 16976 KB Output is correct
2 Correct 247 ms 84308 KB Output is correct
3 Correct 278 ms 84252 KB Output is correct
4 Correct 39 ms 16980 KB Output is correct
5 Correct 1260 ms 84496 KB Output is correct
6 Correct 498 ms 84256 KB Output is correct

Subtask #9
12.5 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 16976 KB Output is correct
2 Correct 273 ms 88112 KB Output is correct
3 Correct 271 ms 88144 KB Output is correct
4 Correct 343 ms 88144 KB Output is correct
5 Correct 29 ms 16976 KB Output is correct
6 Correct 242 ms 84372 KB Output is correct
7 Correct 285 ms 84308 KB Output is correct
8 Correct 283 ms 84688 KB Output is correct
9 Correct 347 ms 84776 KB Output is correct
10 Correct 467 ms 86608 KB Output is correct
11 Correct 452 ms 86076 KB Output is correct

Subtask #10
0 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 16976 KB Output is correct
2 Correct 273 ms 88112 KB Output is correct
3 Correct 271 ms 88144 KB Output is correct
4 Correct 343 ms 88144 KB Output is correct
5 Correct 29 ms 16976 KB Output is correct
6 Correct 242 ms 84372 KB Output is correct
7 Correct 285 ms 84308 KB Output is correct
8 Correct 283 ms 84688 KB Output is correct
9 Correct 347 ms 84776 KB Output is correct
10 Correct 467 ms 86608 KB Output is correct
11 Correct 452 ms 86076 KB Output is correct
12 Correct 30 ms 17016 KB Output is correct
13 Correct 455 ms 88048 KB Output is correct
14 Correct 1388 ms 88132 KB Output is correct
15 Correct 609 ms 87716 KB Output is correct
16 Correct 613 ms 87488 KB Output is correct
17 Correct 51 ms 17128 KB Output is correct
18 Correct 1350 ms 84376 KB Output is correct
19 Correct 583 ms 84480 KB Output is correct
20 Correct 546 ms 84704 KB Output is correct
21 Correct 590 ms 84580 KB Output is correct
22 Execution timed out 3536 ms 85688 KB Time limit exceeded
23 Halted 0 ms 0 KB -

Subtask #11
17.5 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 17360 KB Output is correct
2 Correct 37 ms 19792 KB Output is correct
3 Correct 62 ms 19928 KB Output is correct
4 Correct 40 ms 19920 KB Output is correct
5 Correct 37 ms 19912 KB Output is correct
6 Correct 58 ms 19976 KB Output is correct
7 Correct 36 ms 16936 KB Output is correct
8 Correct 325 ms 84304 KB Output is correct
9 Correct 315 ms 84272 KB Output is correct
10 Correct 35 ms 17028 KB Output is correct
11 Correct 332 ms 87972 KB Output is correct
12 Correct 335 ms 88368 KB Output is correct
13 Correct 356 ms 87892 KB Output is correct
14 Correct 32 ms 17068 KB Output is correct
15 Correct 297 ms 84336 KB Output is correct
16 Correct 302 ms 84408 KB Output is correct
17 Correct 304 ms 85016 KB Output is correct
18 Correct 341 ms 84664 KB Output is correct
19 Correct 475 ms 86728 KB Output is correct
20 Correct 483 ms 86032 KB Output is correct
21 Correct 341 ms 84652 KB Output is correct
22 Correct 335 ms 84592 KB Output is correct
23 Correct 336 ms 84928 KB Output is correct
24 Correct 359 ms 84944 KB Output is correct
25 Correct 352 ms 84988 KB Output is correct
26 Correct 426 ms 84008 KB Output is correct
27 Correct 352 ms 84008 KB Output is correct

Subtask #12
0 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 17360 KB Output is correct
2 Correct 37 ms 19792 KB Output is correct
3 Correct 62 ms 19928 KB Output is correct
4 Correct 40 ms 19920 KB Output is correct
5 Correct 37 ms 19912 KB Output is correct
6 Correct 58 ms 19976 KB Output is correct
7 Correct 36 ms 16936 KB Output is correct
8 Correct 325 ms 84304 KB Output is correct
9 Correct 315 ms 84272 KB Output is correct
10 Correct 35 ms 17028 KB Output is correct
11 Correct 332 ms 87972 KB Output is correct
12 Correct 335 ms 88368 KB Output is correct
13 Correct 356 ms 87892 KB Output is correct
14 Correct 32 ms 17068 KB Output is correct
15 Correct 297 ms 84336 KB Output is correct
16 Correct 302 ms 84408 KB Output is correct
17 Correct 304 ms 85016 KB Output is correct
18 Correct 341 ms 84664 KB Output is correct
19 Correct 475 ms 86728 KB Output is correct
20 Correct 483 ms 86032 KB Output is correct
21 Correct 341 ms 84652 KB Output is correct
22 Correct 335 ms 84592 KB Output is correct
23 Correct 336 ms 84928 KB Output is correct
24 Correct 359 ms 84944 KB Output is correct
25 Correct 352 ms 84988 KB Output is correct
26 Correct 426 ms 84008 KB Output is correct
27 Correct 352 ms 84008 KB Output is correct
28 Correct 43 ms 16976 KB Output is correct
29 Correct 312 ms 19576 KB Output is correct
30 Correct 619 ms 19828 KB Output is correct
31 Correct 330 ms 19536 KB Output is correct
32 Correct 182 ms 20040 KB Output is correct
33 Correct 643 ms 19940 KB Output is correct
34 Correct 40 ms 17032 KB Output is correct
35 Correct 877 ms 89592 KB Output is correct
36 Correct 867 ms 89416 KB Output is correct
37 Correct 1313 ms 89600 KB Output is correct
38 Correct 31 ms 16980 KB Output is correct
39 Correct 438 ms 87888 KB Output is correct
40 Correct 1423 ms 88312 KB Output is correct
41 Correct 580 ms 87728 KB Output is correct
42 Correct 573 ms 86100 KB Output is correct
43 Correct 57 ms 16208 KB Output is correct
44 Correct 1293 ms 82856 KB Output is correct
45 Correct 506 ms 82500 KB Output is correct
46 Correct 551 ms 82768 KB Output is correct
47 Correct 577 ms 83044 KB Output is correct
48 Correct 3328 ms 84364 KB Output is correct
49 Execution timed out 3534 ms 84968 KB Time limit exceeded
50 Halted 0 ms 0 KB -