oj.uz

답안 #911103

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
911103 2024-01-18T12:57:54 Z MinaRagy06 Inside information (BOI21_servers) C++17
70 / 100
 3500 ms 88616 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 = 650;
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 30 ms 16220 KB Output is correct
2 Correct 36 ms 18776 KB Output is correct
3 Correct 38 ms 19060 KB Output is correct
4 Correct 36 ms 19028 KB Output is correct
5 Correct 34 ms 19028 KB Output is correct
6 Correct 47 ms 18992 KB Output is correct

Subtask #2
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 16220 KB Output is correct
2 Correct 36 ms 18776 KB Output is correct
3 Correct 38 ms 19060 KB Output is correct
4 Correct 36 ms 19028 KB Output is correct
5 Correct 34 ms 19028 KB Output is correct
6 Correct 47 ms 18992 KB Output is correct
7 Correct 44 ms 16216 KB Output is correct
8 Correct 495 ms 19088 KB Output is correct
9 Correct 702 ms 19076 KB Output is correct
10 Correct 357 ms 19088 KB Output is correct
11 Correct 76 ms 19024 KB Output is correct
12 Correct 307 ms 19452 KB Output is correct

Subtask #3
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 16208 KB Output is correct
2 Correct 290 ms 82440 KB Output is correct
3 Correct 302 ms 82476 KB Output is correct

Subtask #4
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 16208 KB Output is correct
2 Correct 290 ms 82440 KB Output is correct
3 Correct 302 ms 82476 KB Output is correct
4 Correct 54 ms 16216 KB Output is correct
5 Correct 1052 ms 88004 KB Output is correct
6 Correct 999 ms 88544 KB Output is correct
7 Correct 1345 ms 88616 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 16212 KB Output is correct
2 Correct 262 ms 86332 KB Output is correct
3 Correct 270 ms 86300 KB Output is correct
4 Correct 311 ms 86248 KB Output is correct

Subtask #6
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 16212 KB Output is correct
2 Correct 262 ms 86332 KB Output is correct
3 Correct 270 ms 86300 KB Output is correct
4 Correct 311 ms 86248 KB Output is correct
5 Correct 29 ms 16220 KB Output is correct
6 Correct 430 ms 86228 KB Output is correct
7 Correct 1374 ms 86544 KB Output is correct
8 Correct 571 ms 86104 KB Output is correct
9 Correct 608 ms 86172 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 16216 KB Output is correct
2 Correct 237 ms 82512 KB Output is correct
3 Correct 278 ms 82512 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 16216 KB Output is correct
2 Correct 237 ms 82512 KB Output is correct
3 Correct 278 ms 82512 KB Output is correct
4 Correct 37 ms 16620 KB Output is correct
5 Correct 1355 ms 82516 KB Output is correct
6 Correct 522 ms 82600 KB Output is correct

Subtask #9
12.5 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 16292 KB Output is correct
2 Correct 259 ms 86204 KB Output is correct
3 Correct 281 ms 86300 KB Output is correct
4 Correct 321 ms 86200 KB Output is correct
5 Correct 30 ms 16220 KB Output is correct
6 Correct 237 ms 82576 KB Output is correct
7 Correct 281 ms 82516 KB Output is correct
8 Correct 296 ms 82996 KB Output is correct
9 Correct 371 ms 83008 KB Output is correct
10 Correct 432 ms 85004 KB Output is correct
11 Correct 436 ms 84052 KB Output is correct

Subtask #10
0 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 16292 KB Output is correct
2 Correct 259 ms 86204 KB Output is correct
3 Correct 281 ms 86300 KB Output is correct
4 Correct 321 ms 86200 KB Output is correct
5 Correct 30 ms 16220 KB Output is correct
6 Correct 237 ms 82576 KB Output is correct
7 Correct 281 ms 82516 KB Output is correct
8 Correct 296 ms 82996 KB Output is correct
9 Correct 371 ms 83008 KB Output is correct
10 Correct 432 ms 85004 KB Output is correct
11 Correct 436 ms 84052 KB Output is correct
12 Correct 30 ms 16220 KB Output is correct
13 Correct 442 ms 86228 KB Output is correct
14 Correct 1380 ms 86776 KB Output is correct
15 Correct 594 ms 85964 KB Output is correct
16 Correct 591 ms 86100 KB Output is correct
17 Correct 38 ms 16212 KB Output is correct
18 Correct 1390 ms 82736 KB Output is correct
19 Correct 508 ms 82756 KB Output is correct
20 Correct 583 ms 82976 KB Output is correct
21 Correct 585 ms 82988 KB Output is correct
22 Correct 3349 ms 84384 KB Output is correct
23 Execution timed out 3514 ms 85068 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #11
17.5 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 16220 KB Output is correct
2 Correct 35 ms 18776 KB Output is correct
3 Correct 39 ms 18992 KB Output is correct
4 Correct 37 ms 19036 KB Output is correct
5 Correct 35 ms 19024 KB Output is correct
6 Correct 40 ms 18984 KB Output is correct
7 Correct 32 ms 16208 KB Output is correct
8 Correct 298 ms 82548 KB Output is correct
9 Correct 317 ms 82488 KB Output is correct
10 Correct 26 ms 16216 KB Output is correct
11 Correct 302 ms 86316 KB Output is correct
12 Correct 306 ms 86156 KB Output is correct
13 Correct 355 ms 86128 KB Output is correct
14 Correct 37 ms 16160 KB Output is correct
15 Correct 261 ms 82516 KB Output is correct
16 Correct 357 ms 82460 KB Output is correct
17 Correct 325 ms 82952 KB Output is correct
18 Correct 342 ms 83120 KB Output is correct
19 Correct 492 ms 84564 KB Output is correct
20 Correct 475 ms 84252 KB Output is correct
21 Correct 335 ms 82512 KB Output is correct
22 Correct 337 ms 82488 KB Output is correct
23 Correct 384 ms 83680 KB Output is correct
24 Correct 336 ms 83268 KB Output is correct
25 Correct 342 ms 83292 KB Output is correct
26 Correct 364 ms 81968 KB Output is correct
27 Correct 328 ms 81956 KB Output is correct

Subtask #12
0 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 16220 KB Output is correct
2 Correct 35 ms 18776 KB Output is correct
3 Correct 39 ms 18992 KB Output is correct
4 Correct 37 ms 19036 KB Output is correct
5 Correct 35 ms 19024 KB Output is correct
6 Correct 40 ms 18984 KB Output is correct
7 Correct 32 ms 16208 KB Output is correct
8 Correct 298 ms 82548 KB Output is correct
9 Correct 317 ms 82488 KB Output is correct
10 Correct 26 ms 16216 KB Output is correct
11 Correct 302 ms 86316 KB Output is correct
12 Correct 306 ms 86156 KB Output is correct
13 Correct 355 ms 86128 KB Output is correct
14 Correct 37 ms 16160 KB Output is correct
15 Correct 261 ms 82516 KB Output is correct
16 Correct 357 ms 82460 KB Output is correct
17 Correct 325 ms 82952 KB Output is correct
18 Correct 342 ms 83120 KB Output is correct
19 Correct 492 ms 84564 KB Output is correct
20 Correct 475 ms 84252 KB Output is correct
21 Correct 335 ms 82512 KB Output is correct
22 Correct 337 ms 82488 KB Output is correct
23 Correct 384 ms 83680 KB Output is correct
24 Correct 336 ms 83268 KB Output is correct
25 Correct 342 ms 83292 KB Output is correct
26 Correct 364 ms 81968 KB Output is correct
27 Correct 328 ms 81956 KB Output is correct
28 Correct 42 ms 16332 KB Output is correct
29 Correct 338 ms 18908 KB Output is correct
30 Correct 705 ms 19068 KB Output is correct
31 Correct 368 ms 18932 KB Output is correct
32 Correct 88 ms 19052 KB Output is correct
33 Correct 307 ms 19284 KB Output is correct
34 Correct 42 ms 16220 KB Output is correct
35 Correct 1117 ms 88100 KB Output is correct
36 Correct 962 ms 88392 KB Output is correct
37 Correct 1338 ms 88416 KB Output is correct
38 Correct 30 ms 16212 KB Output is correct
39 Correct 435 ms 86100 KB Output is correct
40 Correct 1460 ms 86320 KB Output is correct
41 Correct 604 ms 86196 KB Output is correct
42 Correct 593 ms 87508 KB Output is correct
43 Correct 59 ms 16976 KB Output is correct
44 Correct 1424 ms 84424 KB Output is correct
45 Correct 593 ms 84320 KB Output is correct
46 Correct 599 ms 84740 KB Output is correct
47 Correct 583 ms 85000 KB Output is correct
48 Correct 3465 ms 85716 KB Output is correct
49 Execution timed out 3517 ms 86728 KB Time limit exceeded
50 Halted 0 ms 0 KB -