oj.uz

Submission #133501

# Submission time Handle Problem Language Result Execution time Memory
133501 2019-07-20T23:33:36 Z KieranHorgan Race (IOI11_race) C++17
31 / 100
 705 ms 27768 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;

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;

	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;

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

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

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4984 KB Output is correct
2 Correct 8 ms 5112 KB Output is correct
3 Correct 6 ms 5112 KB Output is correct
4 Correct 6 ms 5112 KB Output is correct
5 Correct 6 ms 4984 KB Output is correct
6 Correct 6 ms 5112 KB Output is correct
7 Correct 6 ms 5068 KB Output is correct
8 Correct 6 ms 5112 KB Output is correct
9 Correct 6 ms 5112 KB Output is correct
10 Correct 6 ms 5112 KB Output is correct
11 Correct 6 ms 5112 KB Output is correct
12 Correct 6 ms 5112 KB Output is correct
13 Correct 6 ms 4984 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 5112 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4984 KB Output is correct
2 Correct 8 ms 5112 KB Output is correct
3 Correct 6 ms 5112 KB Output is correct
4 Correct 6 ms 5112 KB Output is correct
5 Correct 6 ms 4984 KB Output is correct
6 Correct 6 ms 5112 KB Output is correct
7 Correct 6 ms 5068 KB Output is correct
8 Correct 6 ms 5112 KB Output is correct
9 Correct 6 ms 5112 KB Output is correct
10 Correct 6 ms 5112 KB Output is correct
11 Correct 6 ms 5112 KB Output is correct
12 Correct 6 ms 5112 KB Output is correct
13 Correct 6 ms 4984 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 5112 KB Output is correct
19 Correct 7 ms 5112 KB Output is correct
20 Correct 6 ms 5112 KB Output is correct
21 Correct 8 ms 5112 KB Output is correct
22 Incorrect 12 ms 8696 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4984 KB Output is correct
2 Correct 8 ms 5112 KB Output is correct
3 Correct 6 ms 5112 KB Output is correct
4 Correct 6 ms 5112 KB Output is correct
5 Correct 6 ms 4984 KB Output is correct
6 Correct 6 ms 5112 KB Output is correct
7 Correct 6 ms 5068 KB Output is correct
8 Correct 6 ms 5112 KB Output is correct
9 Correct 6 ms 5112 KB Output is correct
10 Correct 6 ms 5112 KB Output is correct
11 Correct 6 ms 5112 KB Output is correct
12 Correct 6 ms 5112 KB Output is correct
13 Correct 6 ms 4984 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 5112 KB Output is correct
19 Correct 206 ms 10884 KB Output is correct
20 Correct 169 ms 10872 KB Output is correct
21 Correct 177 ms 10744 KB Output is correct
22 Correct 148 ms 10844 KB Output is correct
23 Correct 107 ms 11128 KB Output is correct
24 Correct 81 ms 11200 KB Output is correct
25 Correct 210 ms 13576 KB Output is correct
26 Correct 137 ms 16508 KB Output is correct
27 Correct 253 ms 16332 KB Output is correct
28 Correct 635 ms 27768 KB Output is correct
29 Correct 705 ms 26744 KB Output is correct
30 Correct 267 ms 16376 KB Output is correct
31 Correct 349 ms 16376 KB Output is correct
32 Correct 402 ms 16504 KB Output is correct
33 Correct 485 ms 15340 KB Output is correct
34 Correct 477 ms 15228 KB Output is correct

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4984 KB Output is correct
2 Correct 8 ms 5112 KB Output is correct
3 Correct 6 ms 5112 KB Output is correct
4 Correct 6 ms 5112 KB Output is correct
5 Correct 6 ms 4984 KB Output is correct
6 Correct 6 ms 5112 KB Output is correct
7 Correct 6 ms 5068 KB Output is correct
8 Correct 6 ms 5112 KB Output is correct
9 Correct 6 ms 5112 KB Output is correct
10 Correct 6 ms 5112 KB Output is correct
11 Correct 6 ms 5112 KB Output is correct
12 Correct 6 ms 5112 KB Output is correct
13 Correct 6 ms 4984 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 5112 KB Output is correct
19 Correct 7 ms 5112 KB Output is correct
20 Correct 6 ms 5112 KB Output is correct
21 Correct 8 ms 5112 KB Output is correct
22 Incorrect 12 ms 8696 KB Output isn't correct
23 Halted 0 ms 0 KB -