oj.uz

답안 #1113010

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1113010 2024-11-15T11:40:20 Z akzytr 경주 (Race) (IOI11_race) C++17
43 / 100
 3000 ms 96584 KB 
#include "race.h"
#include <bits/stdc++.h>
#define ve vector
#define pb push_back
#define ar array
#define ll long long
using namespace std;

const int MAXN = 3e5;
const int MAXK = 2e6 + 1;
set<int> adj[MAXN];
map<ar<int, 2>, int> w;

int K;
int ANS = 1e9;

int BOOK = 1;

int sub[MAXN];
int A[MAXK];
int BOOK_K[MAXK];

void find_size(int x, int p) {
	sub[x] = 1;
	for(int i : adj[x]) {
		if(i != p) {
			find_size(i, x);
			sub[x] += sub[i];
		}
	}
}
int find_centroid(int x, int p, int n) {
	for(int i : adj[x]) {
		if(sub[i] > n / 2 && i != p) {
			return find_centroid(i, x, n);
		}
	}
	return x;
}

void dfs(int x, int p, int we, int num_edge, bool upd) {
	if(we > K) {
		return;
	}
	if(upd) {
		if(BOOK_K[we] != BOOK) {
			BOOK_K[we] = BOOK;
			A[we] = num_edge;
		} else {
			A[we] = min(A[we], num_edge);
		}
	} else {
		if(BOOK_K[K - we] == BOOK) {
			ANS = min(ANS, num_edge + A[K - we]);
		}
	}

	for(int i : adj[x]) {
		if(i != p && we + w[{i, x}] <= K) {
			dfs(i, x, we + w[{i, x}], num_edge + 1, upd);
		}
	}
}
void process_centroid(int x) {
	BOOK++;
	A[0] = 0;
	BOOK_K[0] = BOOK;

	for(int i : adj[x]) {
		dfs(i, x, w[{i, x}], 1, false);
		dfs(i, x, w[{i, x}], 1, true);
	}
}

void decompo(int x, int p) {
	find_size(x, p);
	int centroid = find_centroid(x, p, sub[x]);
	process_centroid(centroid);

	for(int i : adj[centroid]) {
		adj[i].erase(centroid);
		decompo(i, x);
	}
}

int best_path(int N, int Ked, int H[][2], int L[]) {
	fill(A, A + MAXK, 0);
	fill(BOOK_K, BOOK_K + MAXK, 0);
	for(int i = 0; i < N - 1; i++) {
		int a, b;
		a = H[i][0];
		b = H[i][1];

		adj[a].insert(b);
		adj[b].insert(a);
		w[{a, b}] = L[i];
		w[{b, a}] = L[i];
	}
	K = Ked;
	decompo(0, -1);
	if(ANS != 1e9) {
		return ANS;
	}
	return -1;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 34896 KB Output is correct
2 Correct 11 ms 34896 KB Output is correct
3 Correct 11 ms 34896 KB Output is correct
4 Correct 12 ms 34896 KB Output is correct
5 Correct 13 ms 32848 KB Output is correct
6 Correct 11 ms 34896 KB Output is correct
7 Correct 13 ms 34896 KB Output is correct
8 Correct 13 ms 31272 KB Output is correct
9 Correct 14 ms 31312 KB Output is correct
10 Correct 11 ms 34896 KB Output is correct
11 Correct 13 ms 34896 KB Output is correct
12 Correct 12 ms 34896 KB Output is correct
13 Correct 13 ms 33020 KB Output is correct
14 Correct 13 ms 32848 KB Output is correct
15 Correct 15 ms 34896 KB Output is correct
16 Correct 14 ms 34896 KB Output is correct
17 Correct 13 ms 34896 KB Output is correct
18 Correct 12 ms 34896 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 34896 KB Output is correct
2 Correct 11 ms 34896 KB Output is correct
3 Correct 11 ms 34896 KB Output is correct
4 Correct 12 ms 34896 KB Output is correct
5 Correct 13 ms 32848 KB Output is correct
6 Correct 11 ms 34896 KB Output is correct
7 Correct 13 ms 34896 KB Output is correct
8 Correct 13 ms 31272 KB Output is correct
9 Correct 14 ms 31312 KB Output is correct
10 Correct 11 ms 34896 KB Output is correct
11 Correct 13 ms 34896 KB Output is correct
12 Correct 12 ms 34896 KB Output is correct
13 Correct 13 ms 33020 KB Output is correct
14 Correct 13 ms 32848 KB Output is correct
15 Correct 15 ms 34896 KB Output is correct
16 Correct 14 ms 34896 KB Output is correct
17 Correct 13 ms 34896 KB Output is correct
18 Correct 12 ms 34896 KB Output is correct
19 Correct 11 ms 34896 KB Output is correct
20 Correct 17 ms 34896 KB Output is correct
21 Correct 23 ms 33104 KB Output is correct
22 Correct 14 ms 33104 KB Output is correct
23 Correct 15 ms 31568 KB Output is correct
24 Correct 15 ms 31568 KB Output is correct
25 Correct 16 ms 31568 KB Output is correct
26 Correct 19 ms 31568 KB Output is correct
27 Correct 20 ms 31568 KB Output is correct
28 Correct 18 ms 31568 KB Output is correct
29 Correct 16 ms 31472 KB Output is correct
30 Correct 19 ms 31568 KB Output is correct
31 Correct 22 ms 31568 KB Output is correct
32 Correct 22 ms 31736 KB Output is correct
33 Correct 20 ms 31736 KB Output is correct
34 Correct 25 ms 31560 KB Output is correct
35 Correct 20 ms 31568 KB Output is correct
36 Correct 19 ms 31568 KB Output is correct
37 Correct 20 ms 31568 KB Output is correct
38 Correct 22 ms 31576 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 34896 KB Output is correct
2 Correct 11 ms 34896 KB Output is correct
3 Correct 11 ms 34896 KB Output is correct
4 Correct 12 ms 34896 KB Output is correct
5 Correct 13 ms 32848 KB Output is correct
6 Correct 11 ms 34896 KB Output is correct
7 Correct 13 ms 34896 KB Output is correct
8 Correct 13 ms 31272 KB Output is correct
9 Correct 14 ms 31312 KB Output is correct
10 Correct 11 ms 34896 KB Output is correct
11 Correct 13 ms 34896 KB Output is correct
12 Correct 12 ms 34896 KB Output is correct
13 Correct 13 ms 33020 KB Output is correct
14 Correct 13 ms 32848 KB Output is correct
15 Correct 15 ms 34896 KB Output is correct
16 Correct 14 ms 34896 KB Output is correct
17 Correct 13 ms 34896 KB Output is correct
18 Correct 12 ms 34896 KB Output is correct
19 Correct 770 ms 54452 KB Output is correct
20 Correct 727 ms 54452 KB Output is correct
21 Correct 908 ms 56044 KB Output is correct
22 Correct 876 ms 54456 KB Output is correct
23 Correct 346 ms 56040 KB Output is correct
24 Correct 317 ms 54348 KB Output is correct
25 Correct 857 ms 58572 KB Output is correct
26 Correct 618 ms 62192 KB Output is correct
27 Correct 572 ms 77172 KB Output is correct
28 Correct 811 ms 96584 KB Output is correct
29 Correct 704 ms 91976 KB Output is correct
30 Correct 506 ms 80028 KB Output is correct
31 Correct 506 ms 77128 KB Output is correct
32 Correct 848 ms 77264 KB Output is correct
33 Correct 1170 ms 77384 KB Output is correct
34 Correct 605 ms 77364 KB Output is correct

Subtask #4
0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 34896 KB Output is correct
2 Correct 11 ms 34896 KB Output is correct
3 Correct 11 ms 34896 KB Output is correct
4 Correct 12 ms 34896 KB Output is correct
5 Correct 13 ms 32848 KB Output is correct
6 Correct 11 ms 34896 KB Output is correct
7 Correct 13 ms 34896 KB Output is correct
8 Correct 13 ms 31272 KB Output is correct
9 Correct 14 ms 31312 KB Output is correct
10 Correct 11 ms 34896 KB Output is correct
11 Correct 13 ms 34896 KB Output is correct
12 Correct 12 ms 34896 KB Output is correct
13 Correct 13 ms 33020 KB Output is correct
14 Correct 13 ms 32848 KB Output is correct
15 Correct 15 ms 34896 KB Output is correct
16 Correct 14 ms 34896 KB Output is correct
17 Correct 13 ms 34896 KB Output is correct
18 Correct 12 ms 34896 KB Output is correct
19 Correct 11 ms 34896 KB Output is correct
20 Correct 17 ms 34896 KB Output is correct
21 Correct 23 ms 33104 KB Output is correct
22 Correct 14 ms 33104 KB Output is correct
23 Correct 15 ms 31568 KB Output is correct
24 Correct 15 ms 31568 KB Output is correct
25 Correct 16 ms 31568 KB Output is correct
26 Correct 19 ms 31568 KB Output is correct
27 Correct 20 ms 31568 KB Output is correct
28 Correct 18 ms 31568 KB Output is correct
29 Correct 16 ms 31472 KB Output is correct
30 Correct 19 ms 31568 KB Output is correct
31 Correct 22 ms 31568 KB Output is correct
32 Correct 22 ms 31736 KB Output is correct
33 Correct 20 ms 31736 KB Output is correct
34 Correct 25 ms 31560 KB Output is correct
35 Correct 20 ms 31568 KB Output is correct
36 Correct 19 ms 31568 KB Output is correct
37 Correct 20 ms 31568 KB Output is correct
38 Correct 22 ms 31576 KB Output is correct
39 Correct 770 ms 54452 KB Output is correct
40 Correct 727 ms 54452 KB Output is correct
41 Correct 908 ms 56044 KB Output is correct
42 Correct 876 ms 54456 KB Output is correct
43 Correct 346 ms 56040 KB Output is correct
44 Correct 317 ms 54348 KB Output is correct
45 Correct 857 ms 58572 KB Output is correct
46 Correct 618 ms 62192 KB Output is correct
47 Correct 572 ms 77172 KB Output is correct
48 Correct 811 ms 96584 KB Output is correct
49 Correct 704 ms 91976 KB Output is correct
50 Correct 506 ms 80028 KB Output is correct
51 Correct 506 ms 77128 KB Output is correct
52 Correct 848 ms 77264 KB Output is correct
53 Correct 1170 ms 77384 KB Output is correct
54 Correct 605 ms 77364 KB Output is correct
55 Correct 54 ms 33608 KB Output is correct
56 Correct 57 ms 33672 KB Output is correct
57 Correct 574 ms 54468 KB Output is correct
58 Correct 132 ms 54344 KB Output is correct
59 Correct 608 ms 63560 KB Output is correct
60 Execution timed out 3073 ms 92232 KB Time limit exceeded
61 Halted 0 ms 0 KB -