oj.uz

답안 #910180

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
910180 2024-01-18T01:04:37 Z MinaRagy06 Inside information (BOI21_servers) C++17
70 / 100
 3500 ms 88696 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 = 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) {
			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 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 29 ms 16220 KB Output is correct
2 Correct 34 ms 18780 KB Output is correct
3 Correct 42 ms 19032 KB Output is correct
4 Correct 38 ms 18800 KB Output is correct
5 Correct 49 ms 19120 KB Output is correct
6 Correct 41 ms 19028 KB Output is correct

Subtask #2
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 16220 KB Output is correct
2 Correct 34 ms 18780 KB Output is correct
3 Correct 42 ms 19032 KB Output is correct
4 Correct 38 ms 18800 KB Output is correct
5 Correct 49 ms 19120 KB Output is correct
6 Correct 41 ms 19028 KB Output is correct
7 Correct 42 ms 16208 KB Output is correct
8 Correct 165 ms 18768 KB Output is correct
9 Correct 324 ms 19108 KB Output is correct
10 Correct 156 ms 19084 KB Output is correct
11 Correct 71 ms 19036 KB Output is correct
12 Correct 222 ms 19140 KB Output is correct

Subtask #3
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 16168 KB Output is correct
2 Correct 452 ms 82440 KB Output is correct
3 Correct 393 ms 82504 KB Output is correct

Subtask #4
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 16168 KB Output is correct
2 Correct 452 ms 82440 KB Output is correct
3 Correct 393 ms 82504 KB Output is correct
4 Correct 51 ms 16212 KB Output is correct
5 Correct 2208 ms 88156 KB Output is correct
6 Correct 2001 ms 88480 KB Output is correct
7 Correct 2207 ms 88360 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 16220 KB Output is correct
2 Correct 403 ms 86384 KB Output is correct
3 Correct 381 ms 86184 KB Output is correct
4 Correct 476 ms 86392 KB Output is correct

Subtask #6
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 16220 KB Output is correct
2 Correct 403 ms 86384 KB Output is correct
3 Correct 381 ms 86184 KB Output is correct
4 Correct 476 ms 86392 KB Output is correct
5 Correct 35 ms 16212 KB Output is correct
6 Correct 504 ms 86396 KB Output is correct
7 Correct 1396 ms 86372 KB Output is correct
8 Correct 587 ms 86084 KB Output is correct
9 Correct 508 ms 86484 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 16212 KB Output is correct
2 Correct 358 ms 82456 KB Output is correct
3 Correct 440 ms 82512 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 16212 KB Output is correct
2 Correct 358 ms 82456 KB Output is correct
3 Correct 440 ms 82512 KB Output is correct
4 Correct 38 ms 16212 KB Output is correct
5 Correct 1283 ms 82592 KB Output is correct
6 Correct 612 ms 82516 KB Output is correct

Subtask #9
12.5 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 16212 KB Output is correct
2 Correct 425 ms 86208 KB Output is correct
3 Correct 362 ms 86260 KB Output is correct
4 Correct 447 ms 86296 KB Output is correct
5 Correct 32 ms 16216 KB Output is correct
6 Correct 332 ms 82516 KB Output is correct
7 Correct 429 ms 82496 KB Output is correct
8 Correct 382 ms 83032 KB Output is correct
9 Correct 433 ms 82960 KB Output is correct
10 Correct 718 ms 84560 KB Output is correct
11 Correct 671 ms 84048 KB Output is correct

Subtask #10
0 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 16212 KB Output is correct
2 Correct 425 ms 86208 KB Output is correct
3 Correct 362 ms 86260 KB Output is correct
4 Correct 447 ms 86296 KB Output is correct
5 Correct 32 ms 16216 KB Output is correct
6 Correct 332 ms 82516 KB Output is correct
7 Correct 429 ms 82496 KB Output is correct
8 Correct 382 ms 83032 KB Output is correct
9 Correct 433 ms 82960 KB Output is correct
10 Correct 718 ms 84560 KB Output is correct
11 Correct 671 ms 84048 KB Output is correct
12 Correct 43 ms 16212 KB Output is correct
13 Correct 502 ms 86096 KB Output is correct
14 Correct 1614 ms 86348 KB Output is correct
15 Correct 555 ms 86096 KB Output is correct
16 Correct 577 ms 86160 KB Output is correct
17 Correct 39 ms 16212 KB Output is correct
18 Correct 1196 ms 82588 KB Output is correct
19 Correct 586 ms 82736 KB Output is correct
20 Correct 710 ms 82976 KB Output is correct
21 Correct 724 ms 83028 KB Output is correct
22 Correct 2788 ms 84316 KB Output is correct
23 Execution timed out 3518 ms 84824 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #11
17.5 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 16220 KB Output is correct
2 Correct 36 ms 18768 KB Output is correct
3 Correct 42 ms 19024 KB Output is correct
4 Correct 50 ms 19024 KB Output is correct
5 Correct 36 ms 18912 KB Output is correct
6 Correct 48 ms 18960 KB Output is correct
7 Correct 31 ms 16220 KB Output is correct
8 Correct 419 ms 82436 KB Output is correct
9 Correct 384 ms 82584 KB Output is correct
10 Correct 26 ms 16288 KB Output is correct
11 Correct 344 ms 86380 KB Output is correct
12 Correct 348 ms 86352 KB Output is correct
13 Correct 409 ms 86456 KB Output is correct
14 Correct 29 ms 16212 KB Output is correct
15 Correct 335 ms 82516 KB Output is correct
16 Correct 393 ms 82540 KB Output is correct
17 Correct 371 ms 83028 KB Output is correct
18 Correct 409 ms 82980 KB Output is correct
19 Correct 643 ms 84616 KB Output is correct
20 Correct 620 ms 84048 KB Output is correct
21 Correct 384 ms 82464 KB Output is correct
22 Correct 375 ms 82520 KB Output is correct
23 Correct 395 ms 83280 KB Output is correct
24 Correct 418 ms 83284 KB Output is correct
25 Correct 401 ms 83212 KB Output is correct
26 Correct 466 ms 82016 KB Output is correct
27 Correct 444 ms 82168 KB Output is correct

Subtask #12
0 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 16220 KB Output is correct
2 Correct 36 ms 18768 KB Output is correct
3 Correct 42 ms 19024 KB Output is correct
4 Correct 50 ms 19024 KB Output is correct
5 Correct 36 ms 18912 KB Output is correct
6 Correct 48 ms 18960 KB Output is correct
7 Correct 31 ms 16220 KB Output is correct
8 Correct 419 ms 82436 KB Output is correct
9 Correct 384 ms 82584 KB Output is correct
10 Correct 26 ms 16288 KB Output is correct
11 Correct 344 ms 86380 KB Output is correct
12 Correct 348 ms 86352 KB Output is correct
13 Correct 409 ms 86456 KB Output is correct
14 Correct 29 ms 16212 KB Output is correct
15 Correct 335 ms 82516 KB Output is correct
16 Correct 393 ms 82540 KB Output is correct
17 Correct 371 ms 83028 KB Output is correct
18 Correct 409 ms 82980 KB Output is correct
19 Correct 643 ms 84616 KB Output is correct
20 Correct 620 ms 84048 KB Output is correct
21 Correct 384 ms 82464 KB Output is correct
22 Correct 375 ms 82520 KB Output is correct
23 Correct 395 ms 83280 KB Output is correct
24 Correct 418 ms 83284 KB Output is correct
25 Correct 401 ms 83212 KB Output is correct
26 Correct 466 ms 82016 KB Output is correct
27 Correct 444 ms 82168 KB Output is correct
28 Correct 43 ms 16216 KB Output is correct
29 Correct 157 ms 18768 KB Output is correct
30 Correct 321 ms 18868 KB Output is correct
31 Correct 160 ms 18772 KB Output is correct
32 Correct 71 ms 19024 KB Output is correct
33 Correct 218 ms 19156 KB Output is correct
34 Correct 40 ms 16180 KB Output is correct
35 Correct 1280 ms 88328 KB Output is correct
36 Correct 1219 ms 88696 KB Output is correct
37 Correct 1437 ms 88244 KB Output is correct
38 Correct 30 ms 16220 KB Output is correct
39 Correct 444 ms 86292 KB Output is correct
40 Correct 1330 ms 86644 KB Output is correct
41 Correct 515 ms 86100 KB Output is correct
42 Correct 508 ms 86100 KB Output is correct
43 Correct 41 ms 16216 KB Output is correct
44 Correct 1119 ms 82584 KB Output is correct
45 Correct 483 ms 82520 KB Output is correct
46 Correct 570 ms 82912 KB Output is correct
47 Correct 533 ms 83116 KB Output is correct
48 Correct 2343 ms 84004 KB Output is correct
49 Execution timed out 3520 ms 85292 KB Time limit exceeded
50 Halted 0 ms 0 KB -