oj.uz

답안 #910143

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
910143 2024-01-18T00:08:28 Z MinaRagy06 Inside information (BOI21_servers) C++17
67.5 / 100
 3500 ms 90472 KB 
#include <bits/stdc++.h>
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 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];
			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
// 			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) {
				if (isanc(b, x)) {
					ans += checkpath(x, b, t - 1, 0);
				} else {
					ans += 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 45 ms 16212 KB Output is correct
2 Correct 36 ms 18912 KB Output is correct
3 Correct 50 ms 19028 KB Output is correct
4 Correct 55 ms 19024 KB Output is correct
5 Correct 52 ms 19028 KB Output is correct
6 Correct 60 ms 18976 KB Output is correct

Subtask #2
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 45 ms 16212 KB Output is correct
2 Correct 36 ms 18912 KB Output is correct
3 Correct 50 ms 19028 KB Output is correct
4 Correct 55 ms 19024 KB Output is correct
5 Correct 52 ms 19028 KB Output is correct
6 Correct 60 ms 18976 KB Output is correct
7 Correct 44 ms 16216 KB Output is correct
8 Correct 186 ms 18800 KB Output is correct
9 Correct 344 ms 19412 KB Output is correct
10 Correct 204 ms 18860 KB Output is correct
11 Correct 96 ms 19036 KB Output is correct
12 Correct 258 ms 18960 KB Output is correct

Subtask #3
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 16216 KB Output is correct
2 Correct 389 ms 82548 KB Output is correct
3 Correct 453 ms 82444 KB Output is correct

Subtask #4
0 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 16216 KB Output is correct
2 Correct 389 ms 82548 KB Output is correct
3 Correct 453 ms 82444 KB Output is correct
4 Correct 65 ms 16236 KB Output is correct
5 Execution timed out 3558 ms 82536 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 16212 KB Output is correct
2 Correct 411 ms 86356 KB Output is correct
3 Correct 380 ms 86580 KB Output is correct
4 Correct 470 ms 86192 KB Output is correct

Subtask #6
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 16212 KB Output is correct
2 Correct 411 ms 86356 KB Output is correct
3 Correct 380 ms 86580 KB Output is correct
4 Correct 470 ms 86192 KB Output is correct
5 Correct 30 ms 16212 KB Output is correct
6 Correct 496 ms 86092 KB Output is correct
7 Correct 1762 ms 90212 KB Output is correct
8 Correct 721 ms 86396 KB Output is correct
9 Correct 738 ms 86528 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 16220 KB Output is correct
2 Correct 401 ms 82440 KB Output is correct
3 Correct 389 ms 82512 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 16220 KB Output is correct
2 Correct 401 ms 82440 KB Output is correct
3 Correct 389 ms 82512 KB Output is correct
4 Correct 37 ms 16448 KB Output is correct
5 Correct 1305 ms 82628 KB Output is correct
6 Correct 559 ms 82464 KB Output is correct

Subtask #9
12.5 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 16220 KB Output is correct
2 Correct 400 ms 86520 KB Output is correct
3 Correct 416 ms 86280 KB Output is correct
4 Correct 446 ms 86360 KB Output is correct
5 Correct 27 ms 16220 KB Output is correct
6 Correct 365 ms 82424 KB Output is correct
7 Correct 447 ms 82516 KB Output is correct
8 Correct 386 ms 83032 KB Output is correct
9 Correct 471 ms 82948 KB Output is correct
10 Correct 665 ms 84708 KB Output is correct
11 Correct 645 ms 84576 KB Output is correct

Subtask #10
0 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 16220 KB Output is correct
2 Correct 400 ms 86520 KB Output is correct
3 Correct 416 ms 86280 KB Output is correct
4 Correct 446 ms 86360 KB Output is correct
5 Correct 27 ms 16220 KB Output is correct
6 Correct 365 ms 82424 KB Output is correct
7 Correct 447 ms 82516 KB Output is correct
8 Correct 386 ms 83032 KB Output is correct
9 Correct 471 ms 82948 KB Output is correct
10 Correct 665 ms 84708 KB Output is correct
11 Correct 645 ms 84576 KB Output is correct
12 Correct 33 ms 16208 KB Output is correct
13 Correct 513 ms 86356 KB Output is correct
14 Correct 1540 ms 90312 KB Output is correct
15 Correct 635 ms 86124 KB Output is correct
16 Correct 614 ms 86172 KB Output is correct
17 Correct 37 ms 16152 KB Output is correct
18 Correct 1121 ms 82560 KB Output is correct
19 Correct 506 ms 82516 KB Output is correct
20 Correct 636 ms 83040 KB Output is correct
21 Correct 575 ms 83468 KB Output is correct
22 Correct 2410 ms 85992 KB Output is correct
23 Execution timed out 3555 ms 86416 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #11
17.5 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 16220 KB Output is correct
2 Correct 35 ms 19152 KB Output is correct
3 Correct 39 ms 19036 KB Output is correct
4 Correct 39 ms 19036 KB Output is correct
5 Correct 32 ms 19024 KB Output is correct
6 Correct 41 ms 19036 KB Output is correct
7 Correct 35 ms 16204 KB Output is correct
8 Correct 395 ms 82484 KB Output is correct
9 Correct 385 ms 82436 KB Output is correct
10 Correct 26 ms 16216 KB Output is correct
11 Correct 395 ms 86356 KB Output is correct
12 Correct 366 ms 86892 KB Output is correct
13 Correct 409 ms 86100 KB Output is correct
14 Correct 27 ms 16148 KB Output is correct
15 Correct 354 ms 82960 KB Output is correct
16 Correct 382 ms 82432 KB Output is correct
17 Correct 384 ms 82956 KB Output is correct
18 Correct 408 ms 83284 KB Output is correct
19 Correct 615 ms 84524 KB Output is correct
20 Correct 627 ms 84400 KB Output is correct
21 Correct 380 ms 82368 KB Output is correct
22 Correct 380 ms 82584 KB Output is correct
23 Correct 406 ms 83428 KB Output is correct
24 Correct 393 ms 83284 KB Output is correct
25 Correct 420 ms 83228 KB Output is correct
26 Correct 475 ms 82044 KB Output is correct
27 Correct 441 ms 82008 KB Output is correct

Subtask #12
0 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 16220 KB Output is correct
2 Correct 35 ms 19152 KB Output is correct
3 Correct 39 ms 19036 KB Output is correct
4 Correct 39 ms 19036 KB Output is correct
5 Correct 32 ms 19024 KB Output is correct
6 Correct 41 ms 19036 KB Output is correct
7 Correct 35 ms 16204 KB Output is correct
8 Correct 395 ms 82484 KB Output is correct
9 Correct 385 ms 82436 KB Output is correct
10 Correct 26 ms 16216 KB Output is correct
11 Correct 395 ms 86356 KB Output is correct
12 Correct 366 ms 86892 KB Output is correct
13 Correct 409 ms 86100 KB Output is correct
14 Correct 27 ms 16148 KB Output is correct
15 Correct 354 ms 82960 KB Output is correct
16 Correct 382 ms 82432 KB Output is correct
17 Correct 384 ms 82956 KB Output is correct
18 Correct 408 ms 83284 KB Output is correct
19 Correct 615 ms 84524 KB Output is correct
20 Correct 627 ms 84400 KB Output is correct
21 Correct 380 ms 82368 KB Output is correct
22 Correct 380 ms 82584 KB Output is correct
23 Correct 406 ms 83428 KB Output is correct
24 Correct 393 ms 83284 KB Output is correct
25 Correct 420 ms 83228 KB Output is correct
26 Correct 475 ms 82044 KB Output is correct
27 Correct 441 ms 82008 KB Output is correct
28 Correct 41 ms 16212 KB Output is correct
29 Correct 169 ms 19224 KB Output is correct
30 Correct 317 ms 19028 KB Output is correct
31 Correct 173 ms 18748 KB Output is correct
32 Correct 94 ms 19024 KB Output is correct
33 Correct 237 ms 19056 KB Output is correct
34 Correct 40 ms 16212 KB Output is correct
35 Correct 2649 ms 83176 KB Output is correct
36 Correct 1738 ms 83240 KB Output is correct
37 Correct 1865 ms 83548 KB Output is correct
38 Correct 37 ms 16460 KB Output is correct
39 Correct 523 ms 86280 KB Output is correct
40 Correct 1679 ms 90472 KB Output is correct
41 Correct 613 ms 86156 KB Output is correct
42 Correct 621 ms 86176 KB Output is correct
43 Correct 37 ms 16220 KB Output is correct
44 Correct 1122 ms 82808 KB Output is correct
45 Correct 502 ms 82440 KB Output is correct
46 Correct 650 ms 82988 KB Output is correct
47 Correct 565 ms 83196 KB Output is correct
48 Correct 2450 ms 85792 KB Output is correct
49 Execution timed out 3566 ms 86632 KB Time limit exceeded
50 Halted 0 ms 0 KB -