oj.uz

Submission #296020

# Submission time Handle Problem Language Result Execution time Memory
296020 2020-09-10T07:44:32 Z khangal Race (IOI11_race) C++14
100 / 100
 614 ms 45924 KB 
#include<bits/stdc++.h>
#include "race.h"

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<ll,ll> pl;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define po pop_back
#define pb push_back
#define mk make_pair
#define mt make_tuple
#define lw lower_bound
#define up upper_bound
#define ff first
#define ss second
#define BOOST ios_base::sync_with_stdio(); cin.tie(0); cout.tie(0)
#define MOD 1000000007
#define MAX 1e18
#define MIN -1e18
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define per(i,a,b) for(ll i=b;i>=a;i--)
#define con continue
#define freopen freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define PI 3.14159265358979323846264338327950288419716939937510582097494459230781640628
#define read(x) scanf("%lld",&x);
#define print(x) printf("%lld ",x);
#define endl '\n';
typedef tree<ll , null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_multi_set;
typedef tree<ll , null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
// template< typename T>
// using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
ll n,m,ans,mid,mn,mx,cnt,T,sum,h1,h2,e[1234567],b,c[1234567],d[1<<20],k,i,j,l,r,h,a[1234567],w,x,y,z,t,xx,yy;
bool used[1234567];
pl p[1234567];
vector<pl> v[123456],vec,vv1,vv2,vpl,vp;
string s1,s;
ll sz[1234567];
// ll tr[5234567],par[1234567],maxx,arr[1234567];
ll dx[4]={-1,1,0,0},dy[4]={0,0,-1,1},c1[123][123];
map<ll,ll> mp;
ll son[1234567],arr[1234567],node,dist[1234567];
void init(ll node , ll par){
	son[node] = 1;
	for(auto &u : v[node]){
		ll x = u.ff;
		if(used[x] || x == par) continue;
		init(x,node); 
		son[node] += son[x];
	}
}
 
ll findcen(ll node, ll sz){
	for(auto  &p : v[node]){
		int x = p.ff;
		if(used[x] || son[x] > son[node]) continue;
		if(son[x]*2 >= sz) return findcen(x , sz);
	}
	return node;
}
 
void dfs(ll node, ll par=-1, ll lvl=0, ll cnt=0){
	for(auto &p : v[node]){
		ll x,c; 
		x = p.ff;
		c = p.ss;
		if(x == par || used[x]) continue;
		dfs(x , node , lvl + c , cnt+1);
	}
	if(0<lvl && lvl<=k){
		vpl.pb({lvl, cnt});
	}
}
 
ll solve(ll id){
	init(id,-1);
	id = findcen(id, son[id]); 
	used[id]=true;
	ll ans=1e9;
	for(auto &p : v[id]){
		ll x,c; 
		x = p.ff;
		c = p.ss;
		if(used[x]) continue;
		dfs(x,node,c,1);
		for(auto &u : vpl){
			ll lvl, cnt; 
			lvl = u.ff;
			cnt = u.ss;
			ans = min(ans, cnt + dist[k - lvl]);
		}
		for(auto &u : vpl){
			ll lvl, cnt; 
			lvl = u.ff;
			cnt = u.ss;
			dist[lvl] = min(dist[lvl], cnt);
			vp.pb(u);
		}
		vpl.clear();
	}
	for(auto &u : vp){
		ll lvl = u.ff;
		dist[lvl] = 1e9;
	}
	vp.clear();
	for(auto &p : v[id]){
		ll x = p.ff;
		if(used[x]) continue;
		ans=min(solve(x) , ans);
	}
	return ans;
}
int best_path(int N, int K, int H[][2], int L[]){   
	ans = 1e9;
    n = N;
    k = K;
    for(int i=0;i<N-1;i++){
        v[H[i][0]].pb({H[i][1],L[i]});
        v[H[i][1]].pb({H[i][0],L[i]});
    }
    for(int i=1;i<=k+1;i++)dist[i]=1e9;
    ans = solve(0);
    if(ans == 1e9)return -1;
    else return ans;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3328 KB Output is correct
2 Correct 2 ms 3328 KB Output is correct
3 Correct 3 ms 3328 KB Output is correct
4 Correct 2 ms 3328 KB Output is correct
5 Correct 2 ms 3456 KB Output is correct
6 Correct 2 ms 3328 KB Output is correct
7 Correct 2 ms 3328 KB Output is correct
8 Correct 2 ms 3328 KB Output is correct
9 Correct 3 ms 3328 KB Output is correct
10 Correct 3 ms 3328 KB Output is correct
11 Correct 3 ms 3328 KB Output is correct
12 Correct 3 ms 3236 KB Output is correct
13 Correct 3 ms 3328 KB Output is correct
14 Correct 3 ms 3328 KB Output is correct
15 Correct 2 ms 3328 KB Output is correct
16 Correct 3 ms 3232 KB Output is correct
17 Correct 2 ms 3328 KB Output is correct
18 Correct 2 ms 3328 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3328 KB Output is correct
2 Correct 2 ms 3328 KB Output is correct
3 Correct 3 ms 3328 KB Output is correct
4 Correct 2 ms 3328 KB Output is correct
5 Correct 2 ms 3456 KB Output is correct
6 Correct 2 ms 3328 KB Output is correct
7 Correct 2 ms 3328 KB Output is correct
8 Correct 2 ms 3328 KB Output is correct
9 Correct 3 ms 3328 KB Output is correct
10 Correct 3 ms 3328 KB Output is correct
11 Correct 3 ms 3328 KB Output is correct
12 Correct 3 ms 3236 KB Output is correct
13 Correct 3 ms 3328 KB Output is correct
14 Correct 3 ms 3328 KB Output is correct
15 Correct 2 ms 3328 KB Output is correct
16 Correct 3 ms 3232 KB Output is correct
17 Correct 2 ms 3328 KB Output is correct
18 Correct 2 ms 3328 KB Output is correct
19 Correct 2 ms 3328 KB Output is correct
20 Correct 2 ms 3328 KB Output is correct
21 Correct 3 ms 3456 KB Output is correct
22 Correct 8 ms 10624 KB Output is correct
23 Correct 7 ms 9216 KB Output is correct
24 Correct 7 ms 10112 KB Output is correct
25 Correct 7 ms 9984 KB Output is correct
26 Correct 5 ms 6016 KB Output is correct
27 Correct 7 ms 9600 KB Output is correct
28 Correct 4 ms 4992 KB Output is correct
29 Correct 5 ms 5888 KB Output is correct
30 Correct 5 ms 6272 KB Output is correct
31 Correct 7 ms 8576 KB Output is correct
32 Correct 7 ms 8960 KB Output is correct
33 Correct 7 ms 9472 KB Output is correct
34 Correct 6 ms 7936 KB Output is correct
35 Correct 7 ms 9728 KB Output is correct
36 Correct 8 ms 10624 KB Output is correct
37 Correct 7 ms 9600 KB Output is correct
38 Correct 6 ms 7424 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3328 KB Output is correct
2 Correct 2 ms 3328 KB Output is correct
3 Correct 3 ms 3328 KB Output is correct
4 Correct 2 ms 3328 KB Output is correct
5 Correct 2 ms 3456 KB Output is correct
6 Correct 2 ms 3328 KB Output is correct
7 Correct 2 ms 3328 KB Output is correct
8 Correct 2 ms 3328 KB Output is correct
9 Correct 3 ms 3328 KB Output is correct
10 Correct 3 ms 3328 KB Output is correct
11 Correct 3 ms 3328 KB Output is correct
12 Correct 3 ms 3236 KB Output is correct
13 Correct 3 ms 3328 KB Output is correct
14 Correct 3 ms 3328 KB Output is correct
15 Correct 2 ms 3328 KB Output is correct
16 Correct 3 ms 3232 KB Output is correct
17 Correct 2 ms 3328 KB Output is correct
18 Correct 2 ms 3328 KB Output is correct
19 Correct 191 ms 12252 KB Output is correct
20 Correct 188 ms 12152 KB Output is correct
21 Correct 202 ms 13428 KB Output is correct
22 Correct 168 ms 14448 KB Output is correct
23 Correct 116 ms 12280 KB Output is correct
24 Correct 92 ms 11512 KB Output is correct
25 Correct 166 ms 17016 KB Output is correct
26 Correct 97 ms 19696 KB Output is correct
27 Correct 242 ms 23032 KB Output is correct
28 Correct 468 ms 32632 KB Output is correct
29 Correct 462 ms 32632 KB Output is correct
30 Correct 233 ms 23032 KB Output is correct
31 Correct 239 ms 23032 KB Output is correct
32 Correct 304 ms 23032 KB Output is correct
33 Correct 331 ms 21752 KB Output is correct
34 Correct 373 ms 22520 KB Output is correct

Subtask #4
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3328 KB Output is correct
2 Correct 2 ms 3328 KB Output is correct
3 Correct 3 ms 3328 KB Output is correct
4 Correct 2 ms 3328 KB Output is correct
5 Correct 2 ms 3456 KB Output is correct
6 Correct 2 ms 3328 KB Output is correct
7 Correct 2 ms 3328 KB Output is correct
8 Correct 2 ms 3328 KB Output is correct
9 Correct 3 ms 3328 KB Output is correct
10 Correct 3 ms 3328 KB Output is correct
11 Correct 3 ms 3328 KB Output is correct
12 Correct 3 ms 3236 KB Output is correct
13 Correct 3 ms 3328 KB Output is correct
14 Correct 3 ms 3328 KB Output is correct
15 Correct 2 ms 3328 KB Output is correct
16 Correct 3 ms 3232 KB Output is correct
17 Correct 2 ms 3328 KB Output is correct
18 Correct 2 ms 3328 KB Output is correct
19 Correct 2 ms 3328 KB Output is correct
20 Correct 2 ms 3328 KB Output is correct
21 Correct 3 ms 3456 KB Output is correct
22 Correct 8 ms 10624 KB Output is correct
23 Correct 7 ms 9216 KB Output is correct
24 Correct 7 ms 10112 KB Output is correct
25 Correct 7 ms 9984 KB Output is correct
26 Correct 5 ms 6016 KB Output is correct
27 Correct 7 ms 9600 KB Output is correct
28 Correct 4 ms 4992 KB Output is correct
29 Correct 5 ms 5888 KB Output is correct
30 Correct 5 ms 6272 KB Output is correct
31 Correct 7 ms 8576 KB Output is correct
32 Correct 7 ms 8960 KB Output is correct
33 Correct 7 ms 9472 KB Output is correct
34 Correct 6 ms 7936 KB Output is correct
35 Correct 7 ms 9728 KB Output is correct
36 Correct 8 ms 10624 KB Output is correct
37 Correct 7 ms 9600 KB Output is correct
38 Correct 6 ms 7424 KB Output is correct
39 Correct 191 ms 12252 KB Output is correct
40 Correct 188 ms 12152 KB Output is correct
41 Correct 202 ms 13428 KB Output is correct
42 Correct 168 ms 14448 KB Output is correct
43 Correct 116 ms 12280 KB Output is correct
44 Correct 92 ms 11512 KB Output is correct
45 Correct 166 ms 17016 KB Output is correct
46 Correct 97 ms 19696 KB Output is correct
47 Correct 242 ms 23032 KB Output is correct
48 Correct 468 ms 32632 KB Output is correct
49 Correct 462 ms 32632 KB Output is correct
50 Correct 233 ms 23032 KB Output is correct
51 Correct 239 ms 23032 KB Output is correct
52 Correct 304 ms 23032 KB Output is correct
53 Correct 331 ms 21752 KB Output is correct
54 Correct 373 ms 22520 KB Output is correct
55 Correct 13 ms 4352 KB Output is correct
56 Correct 12 ms 4608 KB Output is correct
57 Correct 94 ms 14828 KB Output is correct
58 Correct 51 ms 14312 KB Output is correct
59 Correct 108 ms 21232 KB Output is correct
60 Correct 528 ms 45924 KB Output is correct
61 Correct 236 ms 23936 KB Output is correct
62 Correct 251 ms 34812 KB Output is correct
63 Correct 324 ms 34844 KB Output is correct
64 Correct 614 ms 32388 KB Output is correct
65 Correct 411 ms 23416 KB Output is correct
66 Correct 572 ms 40952 KB Output is correct
67 Correct 177 ms 35804 KB Output is correct
68 Correct 349 ms 32876 KB Output is correct
69 Correct 346 ms 32800 KB Output is correct
70 Correct 335 ms 32000 KB Output is correct