답안 #100399

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
100399	2019-03-10T22:41:11 Z	SuperJumbo	경주 (Race) (IOI11_race)	C++14	43 / 100	3000 ms	31992 KB

race

#include <bits/stdc++.h>
#define NMAX 500000
#define inf (INT_MAX>>2)
#define ll long long
#define add push_back
#define mp make_pair
#include "race.h"
using namespace std;
vector<vector<pair<int,int>>> g;
int tot, k, ans; 
int sz[NMAX], cen[NMAX];
unordered_map<int,int> all,sub;
 
void dfs(int node,int par){
    sz[node] = 1;
    for(auto e:g[node]){
    	int x = e.first;
        if(x == par || cen[x] )continue;
        dfs(x,node);
        sz[node] += sz[x];
    }
    tot = max(tot,sz[node]);
}
int centroid(int node,int par){
    for(auto e:g[node]){
    	int x = e.first;
        if(x!=par && sz[x]> tot/2 && !cen[x]){
            return centroid(x,node);
        }
    }
    cen[node] = 1;
    return node;
}
void dfs2(int node, int par, int cc, int len){
	if(len == k) ans = min(ans, cc);
	if(len >= k) return;
	if(all[k-len]) ans = min(ans,all[k-len]+cc);
	if(!sub[len])  sub[len] = cc;
	sub[len] = min(sub[len],cc);
	for(auto e:g[node]){
		int x = e.first;
		if(!cen[x] && x != par)
			dfs2(x,node,cc+1,len + e.second);
	}
 
 
}
void dcmp(int node,int par){
    tot = 0;
    dfs(node,par);
    int c = centroid(node,par);
    all.clear();
    for(auto e :g[c]){
    	int x  = e.first;
    	if(cen[x])continue;
    	sub.clear();
    	dfs2(x,c,1,e.second);
    	for(auto u:sub) 
    		all[u.first] = all[u.first] == 0 ? u.second : min(all[u.first],u.second);
    }
    for(auto e:g[c]){
    	int x = e.first;
    	if(!cen[x]) dcmp(x,c);
    }
}
int best_path(int n,int K,int h[][2] ,int L[]) {
	k  = K;
    g.resize(n);
    for(int i = 0 ;i<n-1;i++){
    	int u = h[i][0], v = h[i][1];
        g[u].add(mp(v,L[i]));g[v].add(mp(u,L[i]));
    }
    memset(cen,0,sizeof(cen));
    ans = inf;
    dcmp(0,-1);
  	ans = ans == inf ? -1: ans;
    return ans;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
22.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	2304 KB	Output is correct
2	Correct	3 ms	2304 KB	Output is correct
3	Correct	3 ms	2304 KB	Output is correct
4	Correct	3 ms	2304 KB	Output is correct
5	Correct	3 ms	2304 KB	Output is correct
6	Correct	3 ms	2304 KB	Output is correct
7	Correct	4 ms	2304 KB	Output is correct
8	Correct	3 ms	2304 KB	Output is correct
9	Correct	3 ms	2304 KB	Output is correct
10	Correct	3 ms	2304 KB	Output is correct
11	Correct	3 ms	2276 KB	Output is correct
12	Correct	3 ms	2304 KB	Output is correct
13	Correct	4 ms	2276 KB	Output is correct
14	Correct	3 ms	2304 KB	Output is correct
15	Correct	4 ms	2304 KB	Output is correct
16	Correct	4 ms	2304 KB	Output is correct
17	Correct	5 ms	2304 KB	Output is correct
18	Correct	4 ms	2304 KB	Output is correct
19	Correct	248 ms	9996 KB	Output is correct
20	Correct	274 ms	11284 KB	Output is correct
21	Correct	277 ms	11256 KB	Output is correct
22	Correct	308 ms	11256 KB	Output is correct
23	Correct	154 ms	11512 KB	Output is correct
24	Correct	107 ms	11384 KB	Output is correct
25	Correct	275 ms	14024 KB	Output is correct
26	Correct	179 ms	17016 KB	Output is correct
27	Correct	314 ms	20600 KB	Output is correct
28	Correct	556 ms	31992 KB	Output is correct
29	Correct	602 ms	31128 KB	Output is correct
30	Correct	413 ms	20472 KB	Output is correct
31	Correct	355 ms	20604 KB	Output is correct
32	Correct	345 ms	20728 KB	Output is correct
33	Correct	624 ms	19420 KB	Output is correct
34	Correct	330 ms	20300 KB	Output is correct

Subtask #4
0 / 57.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	2304 KB	Output is correct
2	Correct	3 ms	2304 KB	Output is correct
3	Correct	3 ms	2304 KB	Output is correct
4	Correct	3 ms	2304 KB	Output is correct
5	Correct	3 ms	2304 KB	Output is correct
6	Correct	3 ms	2304 KB	Output is correct
7	Correct	4 ms	2304 KB	Output is correct
8	Correct	3 ms	2304 KB	Output is correct
9	Correct	3 ms	2304 KB	Output is correct
10	Correct	3 ms	2304 KB	Output is correct
11	Correct	3 ms	2276 KB	Output is correct
12	Correct	3 ms	2304 KB	Output is correct
13	Correct	4 ms	2276 KB	Output is correct
14	Correct	3 ms	2304 KB	Output is correct
15	Correct	4 ms	2304 KB	Output is correct
16	Correct	4 ms	2304 KB	Output is correct
17	Correct	5 ms	2304 KB	Output is correct
18	Correct	4 ms	2304 KB	Output is correct
19	Correct	3 ms	2304 KB	Output is correct
20	Correct	5 ms	2304 KB	Output is correct
21	Correct	5 ms	2432 KB	Output is correct
22	Correct	4 ms	2432 KB	Output is correct
23	Correct	5 ms	2432 KB	Output is correct
24	Correct	6 ms	2432 KB	Output is correct
25	Correct	6 ms	2432 KB	Output is correct
26	Correct	5 ms	2432 KB	Output is correct
27	Correct	5 ms	2304 KB	Output is correct
28	Correct	5 ms	2432 KB	Output is correct
29	Correct	6 ms	2432 KB	Output is correct
30	Correct	6 ms	2432 KB	Output is correct
31	Correct	7 ms	2432 KB	Output is correct
32	Correct	6 ms	2432 KB	Output is correct
33	Correct	7 ms	2432 KB	Output is correct
34	Correct	5 ms	2304 KB	Output is correct
35	Correct	5 ms	2432 KB	Output is correct
36	Correct	5 ms	2432 KB	Output is correct
37	Correct	6 ms	2432 KB	Output is correct
38	Correct	8 ms	2432 KB	Output is correct
39	Correct	248 ms	9996 KB	Output is correct
40	Correct	274 ms	11284 KB	Output is correct
41	Correct	277 ms	11256 KB	Output is correct
42	Correct	308 ms	11256 KB	Output is correct
43	Correct	154 ms	11512 KB	Output is correct
44	Correct	107 ms	11384 KB	Output is correct
45	Correct	275 ms	14024 KB	Output is correct
46	Correct	179 ms	17016 KB	Output is correct
47	Correct	314 ms	20600 KB	Output is correct
48	Correct	556 ms	31992 KB	Output is correct
49	Correct	602 ms	31128 KB	Output is correct
50	Correct	413 ms	20472 KB	Output is correct
51	Correct	355 ms	20604 KB	Output is correct
52	Correct	345 ms	20728 KB	Output is correct
53	Correct	624 ms	19420 KB	Output is correct
54	Correct	330 ms	20300 KB	Output is correct
55	Correct	54 ms	3512 KB	Output is correct
56	Correct	20 ms	3200 KB	Output is correct
57	Correct	200 ms	11512 KB	Output is correct
58	Correct	62 ms	11116 KB	Output is correct
59	Execution timed out	3013 ms	25092 KB	Time limit exceeded
60	Halted	0 ms	0 KB	-

답안 #100399

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 12.0 / 12.0

Subtask #3 22.0 / 22.0

Subtask #4 0 / 57.0

Subtask #1
9.0 / 9.0

Subtask #2
12.0 / 12.0

Subtask #3
22.0 / 22.0

Subtask #4
0 / 57.0