oj.uz

답안 #911110

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
911110 2024-01-18T13:02:31 Z MinaRagy06 Inside information (BOI21_servers) C++17
70 / 100
 3500 ms 90740 KB 
#include <bits/stdc++.h>
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 = 600;
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:84:7: warning: unused variable 'S' [-Wunused-variable]
   84 |  auto S = chrono::steady_clock::now().time_since_epoch().count();
      |       ^
servers.cpp:117:5: warning: unused variable 's' [-Wunused-variable]
  117 |  ll s = 0;
      |     ^

Subtask #1
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 16220 KB Output is correct
2 Correct 33 ms 18768 KB Output is correct
3 Correct 39 ms 19028 KB Output is correct
4 Correct 36 ms 19028 KB Output is correct
5 Correct 34 ms 19024 KB Output is correct
6 Correct 40 ms 19024 KB Output is correct

Subtask #2
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 16220 KB Output is correct
2 Correct 33 ms 18768 KB Output is correct
3 Correct 39 ms 19028 KB Output is correct
4 Correct 36 ms 19028 KB Output is correct
5 Correct 34 ms 19024 KB Output is correct
6 Correct 40 ms 19024 KB Output is correct
7 Correct 45 ms 16200 KB Output is correct
8 Correct 335 ms 18880 KB Output is correct
9 Correct 634 ms 19024 KB Output is correct
10 Correct 305 ms 18768 KB Output is correct
11 Correct 233 ms 19040 KB Output is correct
12 Correct 595 ms 19040 KB Output is correct

Subtask #3
2.5 / 2.5

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

Subtask #4
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 16208 KB Output is correct
2 Correct 283 ms 82508 KB Output is correct
3 Correct 290 ms 82440 KB Output is correct
4 Correct 40 ms 16216 KB Output is correct
5 Correct 881 ms 88152 KB Output is correct
6 Correct 933 ms 88476 KB Output is correct
7 Correct 1279 ms 88168 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 16328 KB Output is correct
2 Correct 296 ms 86296 KB Output is correct
3 Correct 262 ms 86356 KB Output is correct
4 Correct 337 ms 86568 KB Output is correct

Subtask #6
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 16328 KB Output is correct
2 Correct 296 ms 86296 KB Output is correct
3 Correct 262 ms 86356 KB Output is correct
4 Correct 337 ms 86568 KB Output is correct
5 Correct 28 ms 16208 KB Output is correct
6 Correct 447 ms 86356 KB Output is correct
7 Correct 1317 ms 86204 KB Output is correct
8 Correct 607 ms 86672 KB Output is correct
9 Correct 612 ms 86356 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 16272 KB Output is correct
2 Correct 235 ms 82516 KB Output is correct
3 Correct 301 ms 82404 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 16272 KB Output is correct
2 Correct 235 ms 82516 KB Output is correct
3 Correct 301 ms 82404 KB Output is correct
4 Correct 37 ms 16208 KB Output is correct
5 Correct 1674 ms 82816 KB Output is correct
6 Correct 566 ms 83024 KB Output is correct

Subtask #9
12.5 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 16220 KB Output is correct
2 Correct 252 ms 86224 KB Output is correct
3 Correct 276 ms 86404 KB Output is correct
4 Correct 332 ms 86396 KB Output is correct
5 Correct 27 ms 16220 KB Output is correct
6 Correct 245 ms 82332 KB Output is correct
7 Correct 284 ms 82512 KB Output is correct
8 Correct 292 ms 83048 KB Output is correct
9 Correct 314 ms 83016 KB Output is correct
10 Correct 447 ms 84772 KB Output is correct
11 Correct 434 ms 84048 KB Output is correct

Subtask #10
0 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 16220 KB Output is correct
2 Correct 252 ms 86224 KB Output is correct
3 Correct 276 ms 86404 KB Output is correct
4 Correct 332 ms 86396 KB Output is correct
5 Correct 27 ms 16220 KB Output is correct
6 Correct 245 ms 82332 KB Output is correct
7 Correct 284 ms 82512 KB Output is correct
8 Correct 292 ms 83048 KB Output is correct
9 Correct 314 ms 83016 KB Output is correct
10 Correct 447 ms 84772 KB Output is correct
11 Correct 434 ms 84048 KB Output is correct
12 Correct 29 ms 16216 KB Output is correct
13 Correct 436 ms 86200 KB Output is correct
14 Correct 1369 ms 86772 KB Output is correct
15 Correct 778 ms 86476 KB Output is correct
16 Correct 657 ms 86364 KB Output is correct
17 Correct 39 ms 16216 KB Output is correct
18 Correct 1797 ms 82628 KB Output is correct
19 Correct 543 ms 85328 KB Output is correct
20 Correct 812 ms 85888 KB Output is correct
21 Correct 597 ms 85972 KB Output is correct
22 Correct 3168 ms 87008 KB Output is correct
23 Execution timed out 3553 ms 88264 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #11
17.5 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 17244 KB Output is correct
2 Correct 38 ms 20308 KB Output is correct
3 Correct 41 ms 20388 KB Output is correct
4 Correct 37 ms 20308 KB Output is correct
5 Correct 34 ms 20308 KB Output is correct
6 Correct 41 ms 20312 KB Output is correct
7 Correct 35 ms 17488 KB Output is correct
8 Correct 296 ms 85556 KB Output is correct
9 Correct 300 ms 85252 KB Output is correct
10 Correct 26 ms 17232 KB Output is correct
11 Correct 271 ms 89608 KB Output is correct
12 Correct 335 ms 90020 KB Output is correct
13 Correct 293 ms 89532 KB Output is correct
14 Correct 28 ms 17044 KB Output is correct
15 Correct 248 ms 85876 KB Output is correct
16 Correct 279 ms 85812 KB Output is correct
17 Correct 279 ms 86328 KB Output is correct
18 Correct 313 ms 86120 KB Output is correct
19 Correct 442 ms 88004 KB Output is correct
20 Correct 434 ms 87456 KB Output is correct
21 Correct 288 ms 85916 KB Output is correct
22 Correct 286 ms 85904 KB Output is correct
23 Correct 320 ms 86548 KB Output is correct
24 Correct 310 ms 86572 KB Output is correct
25 Correct 306 ms 86464 KB Output is correct
26 Correct 332 ms 85324 KB Output is correct
27 Correct 319 ms 85584 KB Output is correct

Subtask #12
0 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 17244 KB Output is correct
2 Correct 38 ms 20308 KB Output is correct
3 Correct 41 ms 20388 KB Output is correct
4 Correct 37 ms 20308 KB Output is correct
5 Correct 34 ms 20308 KB Output is correct
6 Correct 41 ms 20312 KB Output is correct
7 Correct 35 ms 17488 KB Output is correct
8 Correct 296 ms 85556 KB Output is correct
9 Correct 300 ms 85252 KB Output is correct
10 Correct 26 ms 17232 KB Output is correct
11 Correct 271 ms 89608 KB Output is correct
12 Correct 335 ms 90020 KB Output is correct
13 Correct 293 ms 89532 KB Output is correct
14 Correct 28 ms 17044 KB Output is correct
15 Correct 248 ms 85876 KB Output is correct
16 Correct 279 ms 85812 KB Output is correct
17 Correct 279 ms 86328 KB Output is correct
18 Correct 313 ms 86120 KB Output is correct
19 Correct 442 ms 88004 KB Output is correct
20 Correct 434 ms 87456 KB Output is correct
21 Correct 288 ms 85916 KB Output is correct
22 Correct 286 ms 85904 KB Output is correct
23 Correct 320 ms 86548 KB Output is correct
24 Correct 310 ms 86572 KB Output is correct
25 Correct 306 ms 86464 KB Output is correct
26 Correct 332 ms 85324 KB Output is correct
27 Correct 319 ms 85584 KB Output is correct
28 Correct 41 ms 17232 KB Output is correct
29 Correct 349 ms 20068 KB Output is correct
30 Correct 647 ms 20200 KB Output is correct
31 Correct 328 ms 19916 KB Output is correct
32 Correct 233 ms 20052 KB Output is correct
33 Correct 594 ms 20276 KB Output is correct
34 Correct 40 ms 17244 KB Output is correct
35 Correct 943 ms 90740 KB Output is correct
36 Correct 951 ms 90052 KB Output is correct
37 Correct 1370 ms 90088 KB Output is correct
38 Correct 29 ms 17240 KB Output is correct
39 Correct 452 ms 89084 KB Output is correct
40 Correct 1329 ms 89376 KB Output is correct
41 Correct 599 ms 88672 KB Output is correct
42 Correct 610 ms 88940 KB Output is correct
43 Correct 38 ms 17236 KB Output is correct
44 Correct 1681 ms 85688 KB Output is correct
45 Correct 549 ms 85520 KB Output is correct
46 Correct 795 ms 86112 KB Output is correct
47 Correct 625 ms 85944 KB Output is correct
48 Correct 3106 ms 87036 KB Output is correct
49 Execution timed out 3544 ms 88216 KB Time limit exceeded
50 Halted 0 ms 0 KB -