oj.uz

답안 #212446

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
212446 2020-03-23T04:09:42 Z _qVp_ 경주 (Race) (IOI11_race) C++14
21 / 100
 3000 ms 144288 KB 
#include <iostream> 
#include <map>
#include <vector>
using namespace std;

const int MAXN = 2e5 + 10;
const int oo = 1e9;

typedef pair < int, int > II;

int sz[MAXN], depth[MAXN];
long long sum[MAXN];
vector < II > adj[MAXN];
vector < int > vec[MAXN];
map < long long, int > path;
int h[MAXN][2], l[MAXN];
int n, k;
int ans = oo;

void dfs(int u, int p) {
	sz[u] = 1;
	for(int i = 0; i < adj[u].size(); i++) {
		II cur = adj[u][i];
		int v = cur.first, w = cur.second;
		if (v == p)
			continue;
		depth[v] = depth[u] + 1;
		sum[v] = sum[u] + w;
		dfs(v, u);
		sz[u] += sz[v];
	}
}

void add(int u, int k) {
	long long sumNow = sum[u];
	int & temp = path[sumNow]; 
	if (k == -1) {
		path[sumNow] = 0;
	} else {
		int tmp = temp;
		if (tmp == 0)
			tmp = oo;
		temp = min(tmp, depth[u]);
	}
}

void sack(int u, int p, int keep) {
	int szMax = -1, bigChild = -1;
	
	for(int i = 0; i < adj[u].size(); i++) {
		int v = adj[u][i].first;
		if (v == p)
			continue;
		if (sz[v] > szMax) {
			sz[v] = szMax;
			bigChild = v;
		}
	}
	
	for(int i = 0; i < adj[u].size(); i++) {
		int v = adj[u][i].first;
		if (v != bigChild && v != p)
			sack(v, u, 0);
	}
	
	if (bigChild != -1) {
		sack(bigChild, u, 1);
		swap(vec[u], vec[bigChild]);
	}
	
	vec[u].push_back(u);
	add(u, 1);
	if (path[k + sum[u]])
		ans = min(ans, path[k + sum[u]] - depth[u]);
	for(int i = 0; i < adj[u].size(); i++) {
		int v = adj[u][i].first;
		if (v == p || v == bigChild)
			continue;
		for(int j = 0; j < vec[v].size(); j++) {
			int x = vec[v][j];
			long long need = k + sum[u] * 2 - sum[x];
			if (path[need]) 
				ans = min(ans, path[need] + depth[x] - 2 * depth[u]);
		}
		for(int j = 0; j < vec[v].size(); j++) {
			int x = vec[v][j];
			add(x, 1);
			vec[u].push_back(x);
		}
	}
	
	if (!keep) {
		for(int i = 0; i < vec[u].size(); i++) {
			int v = vec[u][i];
			add(v, -1);
		}
	}
	
}

int solve() {
	dfs(0, -1);
	sack(0, -1, 1);
	return (ans == oo ? -1 : ans);
}

int best_path(int N, int K, int H[][2], int L[]) {
	n = N, k = K;
	for(int i = 0; i < n - 1; i++) {
		int u = H[i][0], v = H[i][1], w = L[i];
		adj[u].push_back(II(v, w));
		adj[v].push_back(II(u, w));
	}
	return solve();
}

Compilation message

race.cpp: In function 'void dfs(int, int)':
race.cpp:22:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < adj[u].size(); i++) {
                 ~~^~~~~~~~~~~~~~~
race.cpp: In function 'void sack(int, int, int)':
race.cpp:50:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < adj[u].size(); i++) {
                 ~~^~~~~~~~~~~~~~~
race.cpp:60:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < adj[u].size(); i++) {
                 ~~^~~~~~~~~~~~~~~
race.cpp:75:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < adj[u].size(); i++) {
                 ~~^~~~~~~~~~~~~~~
race.cpp:79:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int j = 0; j < vec[v].size(); j++) {
                  ~~^~~~~~~~~~~~~~~
race.cpp:85:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int j = 0; j < vec[v].size(); j++) {
                  ~~^~~~~~~~~~~~~~~
race.cpp:93:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 0; i < vec[u].size(); i++) {
                  ~~^~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 9728 KB Output is correct
2 Correct 9 ms 9728 KB Output is correct
3 Correct 9 ms 9728 KB Output is correct
4 Correct 10 ms 9728 KB Output is correct
5 Correct 9 ms 9728 KB Output is correct
6 Correct 9 ms 9856 KB Output is correct
7 Correct 10 ms 9856 KB Output is correct
8 Correct 9 ms 9728 KB Output is correct
9 Correct 9 ms 9856 KB Output is correct
10 Correct 10 ms 9856 KB Output is correct
11 Correct 10 ms 9856 KB Output is correct
12 Correct 9 ms 9728 KB Output is correct
13 Correct 10 ms 9728 KB Output is correct
14 Correct 10 ms 9728 KB Output is correct
15 Correct 10 ms 9728 KB Output is correct
16 Correct 11 ms 9728 KB Output is correct
17 Correct 9 ms 9856 KB Output is correct
18 Correct 9 ms 9856 KB Output is correct
19 Correct 9 ms 9728 KB Output is correct
20 Correct 10 ms 9728 KB Output is correct
21 Correct 13 ms 9960 KB Output is correct
22 Correct 15 ms 10496 KB Output is correct
23 Correct 20 ms 11264 KB Output is correct
24 Correct 16 ms 10624 KB Output is correct
25 Correct 15 ms 10496 KB Output is correct
26 Correct 14 ms 10496 KB Output is correct
27 Correct 11 ms 9856 KB Output is correct
28 Correct 17 ms 10752 KB Output is correct
29 Correct 15 ms 10496 KB Output is correct
30 Correct 14 ms 10368 KB Output is correct
31 Correct 13 ms 10368 KB Output is correct
32 Correct 16 ms 10624 KB Output is correct
33 Correct 16 ms 10624 KB Output is correct
34 Correct 14 ms 10368 KB Output is correct
35 Correct 15 ms 10240 KB Output is correct
36 Correct 11 ms 9984 KB Output is correct
37 Correct 11 ms 9984 KB Output is correct
38 Correct 12 ms 10240 KB Output is correct

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 9728 KB Output is correct
2 Correct 9 ms 9728 KB Output is correct
3 Correct 9 ms 9728 KB Output is correct
4 Correct 10 ms 9728 KB Output is correct
5 Correct 9 ms 9728 KB Output is correct
6 Correct 9 ms 9856 KB Output is correct
7 Correct 10 ms 9856 KB Output is correct
8 Correct 9 ms 9728 KB Output is correct
9 Correct 9 ms 9856 KB Output is correct
10 Correct 10 ms 9856 KB Output is correct
11 Correct 10 ms 9856 KB Output is correct
12 Correct 9 ms 9728 KB Output is correct
13 Correct 10 ms 9728 KB Output is correct
14 Correct 10 ms 9728 KB Output is correct
15 Correct 10 ms 9728 KB Output is correct
16 Correct 11 ms 9728 KB Output is correct
17 Correct 9 ms 9856 KB Output is correct
18 Correct 9 ms 9856 KB Output is correct
19 Correct 415 ms 25156 KB Output is correct
20 Correct 366 ms 24052 KB Output is correct
21 Correct 333 ms 23616 KB Output is correct
22 Correct 416 ms 25460 KB Output is correct
23 Correct 667 ms 26144 KB Output is correct
24 Correct 345 ms 23412 KB Output is correct
25 Correct 99 ms 22772 KB Output is correct
26 Correct 65 ms 27264 KB Output is correct
27 Correct 293 ms 28400 KB Output is correct
28 Correct 374 ms 83052 KB Output is correct
29 Correct 306 ms 68460 KB Output is correct
30 Correct 265 ms 28500 KB Output is correct
31 Correct 273 ms 28448 KB Output is correct
32 Correct 407 ms 30192 KB Output is correct
33 Correct 1141 ms 42376 KB Output is correct
34 Execution timed out 3094 ms 144288 KB Time limit exceeded

Subtask #4
0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 9728 KB Output is correct
2 Correct 9 ms 9728 KB Output is correct
3 Correct 9 ms 9728 KB Output is correct
4 Correct 10 ms 9728 KB Output is correct
5 Correct 9 ms 9728 KB Output is correct
6 Correct 9 ms 9856 KB Output is correct
7 Correct 10 ms 9856 KB Output is correct
8 Correct 9 ms 9728 KB Output is correct
9 Correct 9 ms 9856 KB Output is correct
10 Correct 10 ms 9856 KB Output is correct
11 Correct 10 ms 9856 KB Output is correct
12 Correct 9 ms 9728 KB Output is correct
13 Correct 10 ms 9728 KB Output is correct
14 Correct 10 ms 9728 KB Output is correct
15 Correct 10 ms 9728 KB Output is correct
16 Correct 11 ms 9728 KB Output is correct
17 Correct 9 ms 9856 KB Output is correct
18 Correct 9 ms 9856 KB Output is correct
19 Correct 9 ms 9728 KB Output is correct
20 Correct 10 ms 9728 KB Output is correct
21 Correct 13 ms 9960 KB Output is correct
22 Correct 15 ms 10496 KB Output is correct
23 Correct 20 ms 11264 KB Output is correct
24 Correct 16 ms 10624 KB Output is correct
25 Correct 15 ms 10496 KB Output is correct
26 Correct 14 ms 10496 KB Output is correct
27 Correct 11 ms 9856 KB Output is correct
28 Correct 17 ms 10752 KB Output is correct
29 Correct 15 ms 10496 KB Output is correct
30 Correct 14 ms 10368 KB Output is correct
31 Correct 13 ms 10368 KB Output is correct
32 Correct 16 ms 10624 KB Output is correct
33 Correct 16 ms 10624 KB Output is correct
34 Correct 14 ms 10368 KB Output is correct
35 Correct 15 ms 10240 KB Output is correct
36 Correct 11 ms 9984 KB Output is correct
37 Correct 11 ms 9984 KB Output is correct
38 Correct 12 ms 10240 KB Output is correct
39 Correct 415 ms 25156 KB Output is correct
40 Correct 366 ms 24052 KB Output is correct
41 Correct 333 ms 23616 KB Output is correct
42 Correct 416 ms 25460 KB Output is correct
43 Correct 667 ms 26144 KB Output is correct
44 Correct 345 ms 23412 KB Output is correct
45 Correct 99 ms 22772 KB Output is correct
46 Correct 65 ms 27264 KB Output is correct
47 Correct 293 ms 28400 KB Output is correct
48 Correct 374 ms 83052 KB Output is correct
49 Correct 306 ms 68460 KB Output is correct
50 Correct 265 ms 28500 KB Output is correct
51 Correct 273 ms 28448 KB Output is correct
52 Correct 407 ms 30192 KB Output is correct
53 Correct 1141 ms 42376 KB Output is correct
54 Execution timed out 3094 ms 144288 KB Time limit exceeded