oj.uz

답안 #910148

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
910148 2024-01-18T00:23:21 Z MinaRagy06 Inside information (BOI21_servers) C++17
70 / 100
 3500 ms 87144 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[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];
	dp[i][par] = 1;
	for (int j = (par == SZ(adj[i])? 0 : par + 1); j < SZ(adj[i]); j++) {
		auto [nxt, t, nxtidx] = adj[i][j];
		if (t > lst) break;
		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 = 440;
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: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 28 ms 16200 KB Output is correct
2 Correct 37 ms 18796 KB Output is correct
3 Correct 43 ms 19028 KB Output is correct
4 Correct 34 ms 19032 KB Output is correct
5 Correct 32 ms 19024 KB Output is correct
6 Correct 40 ms 19036 KB Output is correct

Subtask #2
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 16200 KB Output is correct
2 Correct 37 ms 18796 KB Output is correct
3 Correct 43 ms 19028 KB Output is correct
4 Correct 34 ms 19032 KB Output is correct
5 Correct 32 ms 19024 KB Output is correct
6 Correct 40 ms 19036 KB Output is correct
7 Correct 40 ms 16212 KB Output is correct
8 Correct 219 ms 18768 KB Output is correct
9 Correct 485 ms 19024 KB Output is correct
10 Correct 238 ms 18960 KB Output is correct
11 Correct 57 ms 19052 KB Output is correct
12 Correct 202 ms 19024 KB Output is correct

Subtask #3
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 16348 KB Output is correct
2 Correct 317 ms 82436 KB Output is correct
3 Correct 320 ms 82440 KB Output is correct

Subtask #4
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 16348 KB Output is correct
2 Correct 317 ms 82436 KB Output is correct
3 Correct 320 ms 82440 KB Output is correct
4 Correct 40 ms 16620 KB Output is correct
5 Correct 1181 ms 83044 KB Output is correct
6 Correct 705 ms 82844 KB Output is correct
7 Correct 1006 ms 82932 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 16220 KB Output is correct
2 Correct 304 ms 86372 KB Output is correct
3 Correct 286 ms 86356 KB Output is correct
4 Correct 359 ms 86612 KB Output is correct

Subtask #6
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 16220 KB Output is correct
2 Correct 304 ms 86372 KB Output is correct
3 Correct 286 ms 86356 KB Output is correct
4 Correct 359 ms 86612 KB Output is correct
5 Correct 27 ms 16220 KB Output is correct
6 Correct 460 ms 86052 KB Output is correct
7 Correct 1319 ms 87100 KB Output is correct
8 Correct 588 ms 86620 KB Output is correct
9 Correct 578 ms 86228 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 16464 KB Output is correct
2 Correct 260 ms 82444 KB Output is correct
3 Correct 307 ms 82516 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 16464 KB Output is correct
2 Correct 260 ms 82444 KB Output is correct
3 Correct 307 ms 82516 KB Output is correct
4 Correct 36 ms 16212 KB Output is correct
5 Correct 1114 ms 82700 KB Output is correct
6 Correct 451 ms 82512 KB Output is correct

Subtask #9
12.5 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 16220 KB Output is correct
2 Correct 297 ms 86232 KB Output is correct
3 Correct 315 ms 86584 KB Output is correct
4 Correct 382 ms 86108 KB Output is correct
5 Correct 28 ms 16180 KB Output is correct
6 Correct 270 ms 82544 KB Output is correct
7 Correct 301 ms 82444 KB Output is correct
8 Correct 301 ms 82948 KB Output is correct
9 Correct 339 ms 83024 KB Output is correct
10 Correct 502 ms 84844 KB Output is correct
11 Correct 504 ms 84520 KB Output is correct

Subtask #10
0 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 16220 KB Output is correct
2 Correct 297 ms 86232 KB Output is correct
3 Correct 315 ms 86584 KB Output is correct
4 Correct 382 ms 86108 KB Output is correct
5 Correct 28 ms 16180 KB Output is correct
6 Correct 270 ms 82544 KB Output is correct
7 Correct 301 ms 82444 KB Output is correct
8 Correct 301 ms 82948 KB Output is correct
9 Correct 339 ms 83024 KB Output is correct
10 Correct 502 ms 84844 KB Output is correct
11 Correct 504 ms 84520 KB Output is correct
12 Correct 28 ms 16212 KB Output is correct
13 Correct 464 ms 86172 KB Output is correct
14 Correct 1329 ms 87144 KB Output is correct
15 Correct 588 ms 86404 KB Output is correct
16 Correct 589 ms 86096 KB Output is correct
17 Correct 39 ms 16212 KB Output is correct
18 Correct 1116 ms 82700 KB Output is correct
19 Correct 449 ms 82512 KB Output is correct
20 Correct 530 ms 82808 KB Output is correct
21 Correct 514 ms 82996 KB Output is correct
22 Correct 2772 ms 85124 KB Output is correct
23 Execution timed out 3589 ms 85168 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #11
17.5 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 16220 KB Output is correct
2 Correct 33 ms 18768 KB Output is correct
3 Correct 40 ms 18996 KB Output is correct
4 Correct 35 ms 19024 KB Output is correct
5 Correct 31 ms 19120 KB Output is correct
6 Correct 39 ms 19028 KB Output is correct
7 Correct 31 ms 16208 KB Output is correct
8 Correct 322 ms 82436 KB Output is correct
9 Correct 339 ms 82436 KB Output is correct
10 Correct 26 ms 16216 KB Output is correct
11 Correct 317 ms 86448 KB Output is correct
12 Correct 284 ms 86288 KB Output is correct
13 Correct 339 ms 86100 KB Output is correct
14 Correct 26 ms 16220 KB Output is correct
15 Correct 264 ms 82516 KB Output is correct
16 Correct 309 ms 83024 KB Output is correct
17 Correct 318 ms 83024 KB Output is correct
18 Correct 358 ms 83320 KB Output is correct
19 Correct 498 ms 84704 KB Output is correct
20 Correct 515 ms 84448 KB Output is correct
21 Correct 324 ms 82572 KB Output is correct
22 Correct 334 ms 82544 KB Output is correct
23 Correct 331 ms 83280 KB Output is correct
24 Correct 339 ms 83284 KB Output is correct
25 Correct 347 ms 83272 KB Output is correct
26 Correct 377 ms 82140 KB Output is correct
27 Correct 350 ms 81952 KB Output is correct

Subtask #12
0 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 16220 KB Output is correct
2 Correct 33 ms 18768 KB Output is correct
3 Correct 40 ms 18996 KB Output is correct
4 Correct 35 ms 19024 KB Output is correct
5 Correct 31 ms 19120 KB Output is correct
6 Correct 39 ms 19028 KB Output is correct
7 Correct 31 ms 16208 KB Output is correct
8 Correct 322 ms 82436 KB Output is correct
9 Correct 339 ms 82436 KB Output is correct
10 Correct 26 ms 16216 KB Output is correct
11 Correct 317 ms 86448 KB Output is correct
12 Correct 284 ms 86288 KB Output is correct
13 Correct 339 ms 86100 KB Output is correct
14 Correct 26 ms 16220 KB Output is correct
15 Correct 264 ms 82516 KB Output is correct
16 Correct 309 ms 83024 KB Output is correct
17 Correct 318 ms 83024 KB Output is correct
18 Correct 358 ms 83320 KB Output is correct
19 Correct 498 ms 84704 KB Output is correct
20 Correct 515 ms 84448 KB Output is correct
21 Correct 324 ms 82572 KB Output is correct
22 Correct 334 ms 82544 KB Output is correct
23 Correct 331 ms 83280 KB Output is correct
24 Correct 339 ms 83284 KB Output is correct
25 Correct 347 ms 83272 KB Output is correct
26 Correct 377 ms 82140 KB Output is correct
27 Correct 350 ms 81952 KB Output is correct
28 Correct 42 ms 16220 KB Output is correct
29 Correct 216 ms 18768 KB Output is correct
30 Correct 495 ms 19028 KB Output is correct
31 Correct 233 ms 18772 KB Output is correct
32 Correct 57 ms 19028 KB Output is correct
33 Correct 202 ms 19028 KB Output is correct
34 Correct 40 ms 16176 KB Output is correct
35 Correct 1184 ms 82692 KB Output is correct
36 Correct 688 ms 82692 KB Output is correct
37 Correct 1073 ms 82832 KB Output is correct
38 Correct 28 ms 16216 KB Output is correct
39 Correct 454 ms 86092 KB Output is correct
40 Correct 1290 ms 86992 KB Output is correct
41 Correct 592 ms 86376 KB Output is correct
42 Correct 586 ms 86292 KB Output is correct
43 Correct 36 ms 16548 KB Output is correct
44 Correct 1114 ms 82600 KB Output is correct
45 Correct 449 ms 82524 KB Output is correct
46 Correct 515 ms 82768 KB Output is correct
47 Correct 502 ms 83024 KB Output is correct
48 Correct 2693 ms 84636 KB Output is correct
49 Execution timed out 3522 ms 85488 KB Time limit exceeded
50 Halted 0 ms 0 KB -