oj.uz

Submission #47056

# Submission time Handle Problem Language Result Execution time Memory
47056 2018-04-27T04:45:47 Z wzy Race (IOI11_race) C++11
100 / 100
 869 ms 96700 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pii pair<int,int>
#define F first
#define S second
int n ,k ;
vector<pii> adj[200005];
long long ans = (long long) 1e18;
int sz[200005];
int dp[200005];
map<long long, int> tree[200005];
void pre_dfs(int x , int y){
	sz[x] = 1;
	dp[x] = dp[y]  + 1;
	for(int i = 0 ; i < adj[x].size() ; i++){
		pii v = adj[x][i];
		if(v.F == y) continue;
		pre_dfs(v.F, x);
		sz[x] += sz[v.F];
	}
	int maxxi = -1 , optmaxi = 0;
	for(int i = 0 ; i < adj[x].size() ; i++){
		pii v = adj[x][i];
		if(v.F == y){
			continue;
		}
		if(sz[v.F] >= maxxi){
			optmaxi = i;
			maxxi = sz[v.F];
		}
	}
	if(x == y || adj[x].size() > 1)
	swap(adj[x][0] , adj[x][optmaxi]);
}

void solve(int x , int y , long long d){
	if(adj[x].size() == 1 && adj[x][0].F == y){
		tree[x][d] = dp[x];
		if(d == k) ans = min(ans , (long long) dp[x]);
	}
	else{
		solve(adj[x][0].F , x , d + adj[x][0].S);
		swap(tree[x] , tree[adj[x][0].F]);
		for(int j = 1 ; j < adj[x].size() ; j++){
			pii v = adj[x][j];
			if(v.F == y) continue;
			solve(v.F , x , v.S + d);
			long long opt = k + 2*d;
			queue<pii> q;
			for(auto p : tree[v.F]){
				if(tree[x].count(opt - p.F)){
					ans = min(ans , (long long) p.S + tree[x][opt-p.F]- 2*dp[x]);
				}
				q.push(p);
			}
			while(!q.empty()){
				pii p = q.front();
				q.pop();
				if(tree[x].count(p.F)) tree[x][p.F] = min(tree[x][p.F] , p.S);
				else
				tree[x][p.F] = p.S;
			}
			tree[v.F].clear();
		}
		if(tree[x].count(d)) tree[x][d] = min(tree[x][d] , dp[x]);
		else tree[x][d] = dp[x];
		if(tree[x].count(d + k)){ ans = min(ans , (long long) tree[x][d+k] - dp[x]);}
	}
}


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 x , y , z;
		scanf("%d%d%d" , &x , &y , &z);
		adj[H[i][0]].pb(pii(H[i][1],L[i]));
		adj[H[i][1]].pb(pii(H[i][0],L[i]));
	}
	dp[0] = -1;
	pre_dfs(0 , 0);
	solve(0 , 0 , 0);
	if(ans == (long long) 1e18) return -1;
	else return ans;

}

Compilation message

race.cpp: In function 'void pre_dfs(int, int)':
race.cpp:16:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0 ; i < adj[x].size() ; i++){
                  ~~^~~~~~~~~~~~~~~
race.cpp:23:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0 ; i < adj[x].size() ; i++){
                  ~~^~~~~~~~~~~~~~~
race.cpp: In function 'void solve(int, int, long long int)':
race.cpp:45:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int j = 1 ; j < adj[x].size() ; j++){
                   ~~^~~~~~~~~~~~~~~
race.cpp: In function 'int best_path(int, int, int (*)[2], int*)':
race.cpp:77:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d" , &x , &y , &z);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 14456 KB Output is correct
2 Correct 12 ms 14456 KB Output is correct
3 Correct 13 ms 14472 KB Output is correct
4 Correct 12 ms 14520 KB Output is correct
5 Correct 13 ms 14520 KB Output is correct
6 Correct 14 ms 14520 KB Output is correct
7 Correct 13 ms 14540 KB Output is correct
8 Correct 14 ms 14540 KB Output is correct
9 Correct 14 ms 14540 KB Output is correct
10 Correct 13 ms 14588 KB Output is correct
11 Correct 14 ms 14588 KB Output is correct
12 Correct 13 ms 14728 KB Output is correct
13 Correct 14 ms 14728 KB Output is correct
14 Correct 14 ms 14728 KB Output is correct
15 Correct 15 ms 14728 KB Output is correct
16 Correct 16 ms 14728 KB Output is correct
17 Correct 14 ms 14728 KB Output is correct
18 Correct 18 ms 14728 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 14456 KB Output is correct
2 Correct 12 ms 14456 KB Output is correct
3 Correct 13 ms 14472 KB Output is correct
4 Correct 12 ms 14520 KB Output is correct
5 Correct 13 ms 14520 KB Output is correct
6 Correct 14 ms 14520 KB Output is correct
7 Correct 13 ms 14540 KB Output is correct
8 Correct 14 ms 14540 KB Output is correct
9 Correct 14 ms 14540 KB Output is correct
10 Correct 13 ms 14588 KB Output is correct
11 Correct 14 ms 14588 KB Output is correct
12 Correct 13 ms 14728 KB Output is correct
13 Correct 14 ms 14728 KB Output is correct
14 Correct 14 ms 14728 KB Output is correct
15 Correct 15 ms 14728 KB Output is correct
16 Correct 16 ms 14728 KB Output is correct
17 Correct 14 ms 14728 KB Output is correct
18 Correct 18 ms 14728 KB Output is correct
19 Correct 13 ms 14728 KB Output is correct
20 Correct 14 ms 14728 KB Output is correct
21 Correct 15 ms 14780 KB Output is correct
22 Correct 18 ms 14840 KB Output is correct
23 Correct 18 ms 14840 KB Output is correct
24 Correct 16 ms 14840 KB Output is correct
25 Correct 15 ms 14840 KB Output is correct
26 Correct 15 ms 14840 KB Output is correct
27 Correct 16 ms 14840 KB Output is correct
28 Correct 15 ms 14844 KB Output is correct
29 Correct 15 ms 14844 KB Output is correct
30 Correct 18 ms 14844 KB Output is correct
31 Correct 18 ms 14844 KB Output is correct
32 Correct 16 ms 14844 KB Output is correct
33 Correct 16 ms 14844 KB Output is correct
34 Correct 17 ms 14844 KB Output is correct
35 Correct 18 ms 14896 KB Output is correct
36 Correct 17 ms 14896 KB Output is correct
37 Correct 14 ms 14896 KB Output is correct
38 Correct 16 ms 14896 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 14456 KB Output is correct
2 Correct 12 ms 14456 KB Output is correct
3 Correct 13 ms 14472 KB Output is correct
4 Correct 12 ms 14520 KB Output is correct
5 Correct 13 ms 14520 KB Output is correct
6 Correct 14 ms 14520 KB Output is correct
7 Correct 13 ms 14540 KB Output is correct
8 Correct 14 ms 14540 KB Output is correct
9 Correct 14 ms 14540 KB Output is correct
10 Correct 13 ms 14588 KB Output is correct
11 Correct 14 ms 14588 KB Output is correct
12 Correct 13 ms 14728 KB Output is correct
13 Correct 14 ms 14728 KB Output is correct
14 Correct 14 ms 14728 KB Output is correct
15 Correct 15 ms 14728 KB Output is correct
16 Correct 16 ms 14728 KB Output is correct
17 Correct 14 ms 14728 KB Output is correct
18 Correct 18 ms 14728 KB Output is correct
19 Correct 257 ms 20396 KB Output is correct
20 Correct 264 ms 20476 KB Output is correct
21 Correct 211 ms 20476 KB Output is correct
22 Correct 227 ms 20524 KB Output is correct
23 Correct 246 ms 20860 KB Output is correct
24 Correct 231 ms 20860 KB Output is correct
25 Correct 214 ms 36220 KB Output is correct
26 Correct 190 ms 49532 KB Output is correct
27 Correct 415 ms 49532 KB Output is correct
28 Correct 541 ms 96700 KB Output is correct
29 Correct 577 ms 96700 KB Output is correct
30 Correct 398 ms 96700 KB Output is correct
31 Correct 402 ms 96700 KB Output is correct
32 Correct 457 ms 96700 KB Output is correct
33 Correct 459 ms 96700 KB Output is correct
34 Correct 632 ms 96700 KB Output is correct

Subtask #4
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 14456 KB Output is correct
2 Correct 12 ms 14456 KB Output is correct
3 Correct 13 ms 14472 KB Output is correct
4 Correct 12 ms 14520 KB Output is correct
5 Correct 13 ms 14520 KB Output is correct
6 Correct 14 ms 14520 KB Output is correct
7 Correct 13 ms 14540 KB Output is correct
8 Correct 14 ms 14540 KB Output is correct
9 Correct 14 ms 14540 KB Output is correct
10 Correct 13 ms 14588 KB Output is correct
11 Correct 14 ms 14588 KB Output is correct
12 Correct 13 ms 14728 KB Output is correct
13 Correct 14 ms 14728 KB Output is correct
14 Correct 14 ms 14728 KB Output is correct
15 Correct 15 ms 14728 KB Output is correct
16 Correct 16 ms 14728 KB Output is correct
17 Correct 14 ms 14728 KB Output is correct
18 Correct 18 ms 14728 KB Output is correct
19 Correct 13 ms 14728 KB Output is correct
20 Correct 14 ms 14728 KB Output is correct
21 Correct 15 ms 14780 KB Output is correct
22 Correct 18 ms 14840 KB Output is correct
23 Correct 18 ms 14840 KB Output is correct
24 Correct 16 ms 14840 KB Output is correct
25 Correct 15 ms 14840 KB Output is correct
26 Correct 15 ms 14840 KB Output is correct
27 Correct 16 ms 14840 KB Output is correct
28 Correct 15 ms 14844 KB Output is correct
29 Correct 15 ms 14844 KB Output is correct
30 Correct 18 ms 14844 KB Output is correct
31 Correct 18 ms 14844 KB Output is correct
32 Correct 16 ms 14844 KB Output is correct
33 Correct 16 ms 14844 KB Output is correct
34 Correct 17 ms 14844 KB Output is correct
35 Correct 18 ms 14896 KB Output is correct
36 Correct 17 ms 14896 KB Output is correct
37 Correct 14 ms 14896 KB Output is correct
38 Correct 16 ms 14896 KB Output is correct
39 Correct 257 ms 20396 KB Output is correct
40 Correct 264 ms 20476 KB Output is correct
41 Correct 211 ms 20476 KB Output is correct
42 Correct 227 ms 20524 KB Output is correct
43 Correct 246 ms 20860 KB Output is correct
44 Correct 231 ms 20860 KB Output is correct
45 Correct 214 ms 36220 KB Output is correct
46 Correct 190 ms 49532 KB Output is correct
47 Correct 415 ms 49532 KB Output is correct
48 Correct 541 ms 96700 KB Output is correct
49 Correct 577 ms 96700 KB Output is correct
50 Correct 398 ms 96700 KB Output is correct
51 Correct 402 ms 96700 KB Output is correct
52 Correct 457 ms 96700 KB Output is correct
53 Correct 459 ms 96700 KB Output is correct
54 Correct 632 ms 96700 KB Output is correct
55 Correct 40 ms 96700 KB Output is correct
56 Correct 41 ms 96700 KB Output is correct
57 Correct 158 ms 96700 KB Output is correct
58 Correct 141 ms 96700 KB Output is correct
59 Correct 322 ms 96700 KB Output is correct
60 Correct 582 ms 96700 KB Output is correct
61 Correct 523 ms 96700 KB Output is correct
62 Correct 433 ms 96700 KB Output is correct
63 Correct 526 ms 96700 KB Output is correct
64 Correct 807 ms 96700 KB Output is correct
65 Correct 869 ms 96700 KB Output is correct
66 Correct 651 ms 96700 KB Output is correct
67 Correct 417 ms 96700 KB Output is correct
68 Correct 719 ms 96700 KB Output is correct
69 Correct 717 ms 96700 KB Output is correct
70 Correct 686 ms 96700 KB Output is correct