oj.uz

Submission #133502

# Submission time Handle Problem Language Result Execution time Memory
133502 2019-07-20T23:41:47 Z KieranHorgan Race (IOI11_race) C++17
100 / 100
 631 ms 30796 KB 
#include "race.h"
#include <bits/stdc++.h>
using namespace std;

int n, k;
vector<pair<int,int>> AdjList[200005];
bitset<200005> marked;
int sz[200005];

int getSz(int u, int p) {
	sz[u] = 1;
	for(auto v: AdjList[u]) {
		if(v.first==p) continue;
		if(marked[v.first]) continue;
		sz[u] += getSz(v.first, u);
	}
	return sz[u];
}

int getCentroid(int u, int p, int compSz) {
	if(sz[u]*2 < compSz)
		return -1;
	for(auto v: AdjList[u]) {
		if(v.first==p) continue;
		if(marked[v.first]) continue;
		if(sz[v.first]*2 > compSz)
			return getCentroid(v.first, u, compSz);
	}
	return u;
}

int dp[1000005];
int ans = 1<<29;

void checkSecondLeg(int u, int p, int d, int l) {
	ans = min(ans, l + dp[k-d]);
	for(auto v: AdjList[u]) {
		if(v.first==p) continue;
		if(marked[v.first]) continue;
		if(d+v.second > k) continue;
		checkSecondLeg(v.first, u, d+v.second, l+1);
	}
}
void markFirstLeg(int u, int p, int d, int l) {
	dp[d] = min(dp[d], l);
	for(auto v: AdjList[u]) {
		if(v.first==p) continue;
		if(marked[v.first]) continue;
		if(d+v.second > k) continue;
		markFirstLeg(v.first, u, d+v.second, l+1);
	}
}
void unmarkFirstLeg(int u, int p, int d, int l) {
	dp[d] = 1<<29;
	for(auto v: AdjList[u]) {
		if(v.first==p) continue;
		if(marked[v.first]) continue;
		if(d+v.second > k) continue;
		unmarkFirstLeg(v.first, u, d+v.second, l+1);
	}
}

bitset<200005> vis;
void markVis(int u, int p) {
	vis[u] = 1;
	for(auto v: AdjList[u]) {
		if(v.first == p)
			continue;
		if(marked[v.first])
			continue;
		if(vis[v.first])
			continue;
		markVis(v.first, u);
	}
}
void unmarkVis(int u, int p) {
	vis[u] = 0;
	for(auto v: AdjList[u]) {
		if(v.first == p)
			continue;
		if(marked[v.first])
			continue;
		unmarkVis(v.first, u);
	}
}

bitset<200005> inQ;

void doDecomp(int u) {
	getSz(u, -1);

	int centre = getCentroid(u, -1, sz[u]);

	for(auto v: AdjList[centre]) {
		if(marked[v.first])
			continue;
		if(v.second > k) continue;
		checkSecondLeg(v.first, centre, v.second, 1);
		markFirstLeg(v.first, centre, v.second, 1);
	}
	for(auto v: AdjList[centre]) {
		if(marked[v.first])
			continue;
		if(v.second > k) continue;
		unmarkFirstLeg(v.first, centre, v.second, 1);
	}
	dp[0] = 0;
	marked[centre]=1;

	for(auto v: AdjList[centre]) {
		if(marked[v.first])
			continue;
		doDecomp(v.first);
	}
}

int best_path(int N, int K, int H[][2], int L[]) {
	n = N;
	k = K;
	for(int i = 0; i < N-1; i++) {
		AdjList[H[i][0]].push_back({H[i][1], L[i]});
		AdjList[H[i][1]].push_back({H[i][0], L[i]});
	}

	ans = 1<<29;

	for(int i = 1; i <= K; i++)
		dp[i] = 1<<29;
	dp[0] = 0;

	doDecomp(0);

	queue<int> q;
	// q.push(0);
	while(!q.empty()) {
		int u = q.front();
		q.pop();

		getSz(u, -1);

		int centre = getCentroid(u, -1, sz[u]);

		for(auto v: AdjList[centre]) {
			if(marked[v.first])
				continue;
			if(v.second > k) continue;
			checkSecondLeg(v.first, centre, v.second, 1);
			markFirstLeg(v.first, centre, v.second, 1);
		}
		for(auto v: AdjList[centre]) {
			if(marked[v.first])
				continue;
			if(v.second > k) continue;
			unmarkFirstLeg(v.first, centre, v.second, 1);
		}
		dp[0] = 0;
		marked[centre]=1;

		for(auto v: AdjList[centre]) {
			if(marked[v.first])
				continue;
			q.push(v.first);
		}
	}

	if(ans == 1<<29)
		ans = -1;
	return ans;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 6 ms 5112 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 6 ms 5112 KB Output is correct
5 Correct 6 ms 5116 KB Output is correct
6 Correct 6 ms 5112 KB Output is correct
7 Correct 6 ms 5112 KB Output is correct
8 Correct 6 ms 4988 KB Output is correct
9 Correct 6 ms 5112 KB Output is correct
10 Correct 6 ms 4984 KB Output is correct
11 Correct 6 ms 4984 KB Output is correct
12 Correct 6 ms 5112 KB Output is correct
13 Correct 6 ms 5112 KB Output is correct
14 Correct 6 ms 5112 KB Output is correct
15 Correct 6 ms 5112 KB Output is correct
16 Correct 6 ms 5112 KB Output is correct
17 Correct 6 ms 5112 KB Output is correct
18 Correct 6 ms 4984 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 6 ms 5112 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 6 ms 5112 KB Output is correct
5 Correct 6 ms 5116 KB Output is correct
6 Correct 6 ms 5112 KB Output is correct
7 Correct 6 ms 5112 KB Output is correct
8 Correct 6 ms 4988 KB Output is correct
9 Correct 6 ms 5112 KB Output is correct
10 Correct 6 ms 4984 KB Output is correct
11 Correct 6 ms 4984 KB Output is correct
12 Correct 6 ms 5112 KB Output is correct
13 Correct 6 ms 5112 KB Output is correct
14 Correct 6 ms 5112 KB Output is correct
15 Correct 6 ms 5112 KB Output is correct
16 Correct 6 ms 5112 KB Output is correct
17 Correct 6 ms 5112 KB Output is correct
18 Correct 6 ms 4984 KB Output is correct
19 Correct 6 ms 5092 KB Output is correct
20 Correct 6 ms 4984 KB Output is correct
21 Correct 7 ms 5088 KB Output is correct
22 Correct 10 ms 8696 KB Output is correct
23 Correct 10 ms 8056 KB Output is correct
24 Correct 10 ms 8440 KB Output is correct
25 Correct 10 ms 8440 KB Output is correct
26 Correct 9 ms 6520 KB Output is correct
27 Correct 9 ms 8188 KB Output is correct
28 Correct 8 ms 5880 KB Output is correct
29 Correct 8 ms 6392 KB Output is correct
30 Correct 8 ms 6520 KB Output is correct
31 Correct 10 ms 7800 KB Output is correct
32 Correct 10 ms 7928 KB Output is correct
33 Correct 10 ms 8184 KB Output is correct
34 Correct 9 ms 7416 KB Output is correct
35 Correct 12 ms 8312 KB Output is correct
36 Correct 10 ms 8696 KB Output is correct
37 Correct 11 ms 8184 KB Output is correct
38 Correct 10 ms 7160 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 6 ms 5112 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 6 ms 5112 KB Output is correct
5 Correct 6 ms 5116 KB Output is correct
6 Correct 6 ms 5112 KB Output is correct
7 Correct 6 ms 5112 KB Output is correct
8 Correct 6 ms 4988 KB Output is correct
9 Correct 6 ms 5112 KB Output is correct
10 Correct 6 ms 4984 KB Output is correct
11 Correct 6 ms 4984 KB Output is correct
12 Correct 6 ms 5112 KB Output is correct
13 Correct 6 ms 5112 KB Output is correct
14 Correct 6 ms 5112 KB Output is correct
15 Correct 6 ms 5112 KB Output is correct
16 Correct 6 ms 5112 KB Output is correct
17 Correct 6 ms 5112 KB Output is correct
18 Correct 6 ms 4984 KB Output is correct
19 Correct 168 ms 10296 KB Output is correct
20 Correct 166 ms 10360 KB Output is correct
21 Correct 184 ms 10396 KB Output is correct
22 Correct 171 ms 10444 KB Output is correct
23 Correct 105 ms 10616 KB Output is correct
24 Correct 75 ms 10476 KB Output is correct
25 Correct 176 ms 13188 KB Output is correct
26 Correct 136 ms 15992 KB Output is correct
27 Correct 216 ms 15928 KB Output is correct
28 Correct 331 ms 27004 KB Output is correct
29 Correct 342 ms 25976 KB Output is correct
30 Correct 204 ms 15888 KB Output is correct
31 Correct 204 ms 15872 KB Output is correct
32 Correct 235 ms 15736 KB Output is correct
33 Correct 303 ms 14684 KB Output is correct
34 Correct 257 ms 14684 KB Output is correct

Subtask #4
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 6 ms 5112 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 6 ms 5112 KB Output is correct
5 Correct 6 ms 5116 KB Output is correct
6 Correct 6 ms 5112 KB Output is correct
7 Correct 6 ms 5112 KB Output is correct
8 Correct 6 ms 4988 KB Output is correct
9 Correct 6 ms 5112 KB Output is correct
10 Correct 6 ms 4984 KB Output is correct
11 Correct 6 ms 4984 KB Output is correct
12 Correct 6 ms 5112 KB Output is correct
13 Correct 6 ms 5112 KB Output is correct
14 Correct 6 ms 5112 KB Output is correct
15 Correct 6 ms 5112 KB Output is correct
16 Correct 6 ms 5112 KB Output is correct
17 Correct 6 ms 5112 KB Output is correct
18 Correct 6 ms 4984 KB Output is correct
19 Correct 6 ms 5092 KB Output is correct
20 Correct 6 ms 4984 KB Output is correct
21 Correct 7 ms 5088 KB Output is correct
22 Correct 10 ms 8696 KB Output is correct
23 Correct 10 ms 8056 KB Output is correct
24 Correct 10 ms 8440 KB Output is correct
25 Correct 10 ms 8440 KB Output is correct
26 Correct 9 ms 6520 KB Output is correct
27 Correct 9 ms 8188 KB Output is correct
28 Correct 8 ms 5880 KB Output is correct
29 Correct 8 ms 6392 KB Output is correct
30 Correct 8 ms 6520 KB Output is correct
31 Correct 10 ms 7800 KB Output is correct
32 Correct 10 ms 7928 KB Output is correct
33 Correct 10 ms 8184 KB Output is correct
34 Correct 9 ms 7416 KB Output is correct
35 Correct 12 ms 8312 KB Output is correct
36 Correct 10 ms 8696 KB Output is correct
37 Correct 11 ms 8184 KB Output is correct
38 Correct 10 ms 7160 KB Output is correct
39 Correct 168 ms 10296 KB Output is correct
40 Correct 166 ms 10360 KB Output is correct
41 Correct 184 ms 10396 KB Output is correct
42 Correct 171 ms 10444 KB Output is correct
43 Correct 105 ms 10616 KB Output is correct
44 Correct 75 ms 10476 KB Output is correct
45 Correct 176 ms 13188 KB Output is correct
46 Correct 136 ms 15992 KB Output is correct
47 Correct 216 ms 15928 KB Output is correct
48 Correct 331 ms 27004 KB Output is correct
49 Correct 342 ms 25976 KB Output is correct
50 Correct 204 ms 15888 KB Output is correct
51 Correct 204 ms 15872 KB Output is correct
52 Correct 235 ms 15736 KB Output is correct
53 Correct 303 ms 14684 KB Output is correct
54 Correct 257 ms 14684 KB Output is correct
55 Correct 17 ms 5752 KB Output is correct
56 Correct 19 ms 5624 KB Output is correct
57 Correct 103 ms 10968 KB Output is correct
58 Correct 47 ms 10988 KB Output is correct
59 Correct 137 ms 17276 KB Output is correct
60 Correct 589 ms 30796 KB Output is correct
61 Correct 226 ms 16120 KB Output is correct
62 Correct 247 ms 19960 KB Output is correct
63 Correct 346 ms 20044 KB Output is correct
64 Correct 631 ms 18040 KB Output is correct
65 Correct 254 ms 16120 KB Output is correct
66 Correct 565 ms 28508 KB Output is correct
67 Correct 148 ms 20324 KB Output is correct
68 Correct 362 ms 20168 KB Output is correct
69 Correct 351 ms 20344 KB Output is correct
70 Correct 296 ms 19832 KB Output is correct