oj.uz

답안 #133503

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
133503 2019-07-20T23:44:17 Z KieranHorgan 경주 (Race) (IOI11_race) C++17
100 / 100
 614 ms 28000 KB 
#pragma GCC optimize("Ofast")
#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);
	}
}

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);

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

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5112 KB Output is correct
2 Correct 7 ms 5112 KB Output is correct
3 Correct 7 ms 5112 KB Output is correct
4 Correct 6 ms 4988 KB Output is correct
5 Correct 6 ms 4980 KB Output is correct
6 Correct 7 ms 5112 KB Output is correct
7 Correct 6 ms 4984 KB Output is correct
8 Correct 6 ms 4984 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 5112 KB Output is correct
12 Correct 6 ms 4984 KB Output is correct
13 Correct 7 ms 5112 KB Output is correct
14 Correct 6 ms 4984 KB Output is correct
15 Correct 6 ms 4984 KB Output is correct
16 Correct 6 ms 5112 KB Output is correct
17 Correct 6 ms 4988 KB Output is correct
18 Correct 6 ms 4984 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5112 KB Output is correct
2 Correct 7 ms 5112 KB Output is correct
3 Correct 7 ms 5112 KB Output is correct
4 Correct 6 ms 4988 KB Output is correct
5 Correct 6 ms 4980 KB Output is correct
6 Correct 7 ms 5112 KB Output is correct
7 Correct 6 ms 4984 KB Output is correct
8 Correct 6 ms 4984 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 5112 KB Output is correct
12 Correct 6 ms 4984 KB Output is correct
13 Correct 7 ms 5112 KB Output is correct
14 Correct 6 ms 4984 KB Output is correct
15 Correct 6 ms 4984 KB Output is correct
16 Correct 6 ms 5112 KB Output is correct
17 Correct 6 ms 4988 KB Output is correct
18 Correct 6 ms 4984 KB Output is correct
19 Correct 6 ms 4984 KB Output is correct
20 Correct 6 ms 5112 KB Output is correct
21 Correct 7 ms 5112 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 8568 KB Output is correct
25 Correct 10 ms 8372 KB Output is correct
26 Correct 8 ms 6392 KB Output is correct
27 Correct 9 ms 8184 KB Output is correct
28 Correct 8 ms 5884 KB Output is correct
29 Correct 8 ms 6392 KB Output is correct
30 Correct 8 ms 6520 KB Output is correct
31 Correct 9 ms 7672 KB Output is correct
32 Correct 10 ms 7828 KB Output is correct
33 Correct 10 ms 8184 KB Output is correct
34 Correct 9 ms 7388 KB Output is correct
35 Correct 10 ms 8260 KB Output is correct
36 Correct 10 ms 8696 KB Output is correct
37 Correct 10 ms 8184 KB Output is correct
38 Correct 9 ms 7116 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5112 KB Output is correct
2 Correct 7 ms 5112 KB Output is correct
3 Correct 7 ms 5112 KB Output is correct
4 Correct 6 ms 4988 KB Output is correct
5 Correct 6 ms 4980 KB Output is correct
6 Correct 7 ms 5112 KB Output is correct
7 Correct 6 ms 4984 KB Output is correct
8 Correct 6 ms 4984 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 5112 KB Output is correct
12 Correct 6 ms 4984 KB Output is correct
13 Correct 7 ms 5112 KB Output is correct
14 Correct 6 ms 4984 KB Output is correct
15 Correct 6 ms 4984 KB Output is correct
16 Correct 6 ms 5112 KB Output is correct
17 Correct 6 ms 4988 KB Output is correct
18 Correct 6 ms 4984 KB Output is correct
19 Correct 186 ms 11516 KB Output is correct
20 Correct 170 ms 11512 KB Output is correct
21 Correct 190 ms 11460 KB Output is correct
22 Correct 169 ms 11640 KB Output is correct
23 Correct 101 ms 11768 KB Output is correct
24 Correct 78 ms 11640 KB Output is correct
25 Correct 181 ms 12832 KB Output is correct
26 Correct 113 ms 14496 KB Output is correct
27 Correct 219 ms 16888 KB Output is correct
28 Correct 356 ms 23384 KB Output is correct
29 Correct 339 ms 24072 KB Output is correct
30 Correct 217 ms 18652 KB Output is correct
31 Correct 248 ms 18720 KB Output is correct
32 Correct 247 ms 18756 KB Output is correct
33 Correct 302 ms 17364 KB Output is correct
34 Correct 348 ms 18224 KB Output is correct

Subtask #4
57.0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5112 KB Output is correct
2 Correct 7 ms 5112 KB Output is correct
3 Correct 7 ms 5112 KB Output is correct
4 Correct 6 ms 4988 KB Output is correct
5 Correct 6 ms 4980 KB Output is correct
6 Correct 7 ms 5112 KB Output is correct
7 Correct 6 ms 4984 KB Output is correct
8 Correct 6 ms 4984 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 5112 KB Output is correct
12 Correct 6 ms 4984 KB Output is correct
13 Correct 7 ms 5112 KB Output is correct
14 Correct 6 ms 4984 KB Output is correct
15 Correct 6 ms 4984 KB Output is correct
16 Correct 6 ms 5112 KB Output is correct
17 Correct 6 ms 4988 KB Output is correct
18 Correct 6 ms 4984 KB Output is correct
19 Correct 6 ms 4984 KB Output is correct
20 Correct 6 ms 5112 KB Output is correct
21 Correct 7 ms 5112 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 8568 KB Output is correct
25 Correct 10 ms 8372 KB Output is correct
26 Correct 8 ms 6392 KB Output is correct
27 Correct 9 ms 8184 KB Output is correct
28 Correct 8 ms 5884 KB Output is correct
29 Correct 8 ms 6392 KB Output is correct
30 Correct 8 ms 6520 KB Output is correct
31 Correct 9 ms 7672 KB Output is correct
32 Correct 10 ms 7828 KB Output is correct
33 Correct 10 ms 8184 KB Output is correct
34 Correct 9 ms 7388 KB Output is correct
35 Correct 10 ms 8260 KB Output is correct
36 Correct 10 ms 8696 KB Output is correct
37 Correct 10 ms 8184 KB Output is correct
38 Correct 9 ms 7116 KB Output is correct
39 Correct 186 ms 11516 KB Output is correct
40 Correct 170 ms 11512 KB Output is correct
41 Correct 190 ms 11460 KB Output is correct
42 Correct 169 ms 11640 KB Output is correct
43 Correct 101 ms 11768 KB Output is correct
44 Correct 78 ms 11640 KB Output is correct
45 Correct 181 ms 12832 KB Output is correct
46 Correct 113 ms 14496 KB Output is correct
47 Correct 219 ms 16888 KB Output is correct
48 Correct 356 ms 23384 KB Output is correct
49 Correct 339 ms 24072 KB Output is correct
50 Correct 217 ms 18652 KB Output is correct
51 Correct 248 ms 18720 KB Output is correct
52 Correct 247 ms 18756 KB Output is correct
53 Correct 302 ms 17364 KB Output is correct
54 Correct 348 ms 18224 KB Output is correct
55 Correct 18 ms 5752 KB Output is correct
56 Correct 20 ms 5752 KB Output is correct
57 Correct 95 ms 11868 KB Output is correct
58 Correct 47 ms 11624 KB Output is correct
59 Correct 113 ms 15352 KB Output is correct
60 Correct 603 ms 28000 KB Output is correct
61 Correct 244 ms 18808 KB Output is correct
62 Correct 261 ms 22536 KB Output is correct
63 Correct 339 ms 22648 KB Output is correct
64 Correct 614 ms 21036 KB Output is correct
65 Correct 256 ms 19576 KB Output is correct
66 Correct 486 ms 27000 KB Output is correct
67 Correct 141 ms 23268 KB Output is correct
68 Correct 330 ms 23500 KB Output is correct
69 Correct 314 ms 23544 KB Output is correct
70 Correct 311 ms 22776 KB Output is correct