답안 #70086 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
70086	2018-08-22T10:24:29 Z	WA_TLE	경주 (Race) (IOI11_race)	C++14	100 / 100	899 ms	100872 KB

race

#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<array>
#include<map>
#include<iomanip>
#include<assert.h>
#include<bitset>
#include<stack>
#include<memory>
using namespace std;
typedef long long int llint;
typedef long double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
/*
cout<<setprecision(20);
cin.tie(0);
ios::sync_with_stdio(false);
*/
const llint mod=1000000000;
const llint big=2.19e15+1;
const long double pai=3.141592653589793238462643383279502884197;
const long double eps=1e-15;
template <class T,class U>bool mineq(T& a,U b){if(a>b){a=b;return true;}return false;}
template <class T,class U>bool maxeq(T& a,U b){if(a<b){a=b;return true;}return false;}
llint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}
llint lcm(llint a,llint b){if(a==0){return b;}return a/gcd(a,b)*b;}
template<class T> void SO(T& ve){sort(ve.begin(),ve.end());}
template<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}
template<class T>llint LBI(vector<T>&ar,T in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}
template<class T>llint UBI(vector<T>&ar,T in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}
//マージテク!
//重心分解!!!
//nlogn!!!!!!
int ans=869120;
int K;
vector<vector<pair<int,int>>>road;
vector<bool>used;
vector<pair<int,int>>mymap;//バージョン、道路数
vector<pair<int,int>>tuivec;//長さ、道路数
int mapban=0;
int nozen;
pair<int,int>gezyu;
vector<pair<int,int>>kizen;
int fizyu(int ter,int per){
	int kos=1,dka=0;
	if(used[ter]){return 1;}
	for(auto it:road[ter]){
		if(it.fir==per){continue;}
		int sor=fizyu(it.fir,ter);
		maxeq(dka,sor);
		kos+=sor;
	}
	maxeq(dka,nozen-kos);
	mineq(gezyu,mp(dka,ter));
	return kos;
}
void dfs(int ter,int per,int dis,int num){
	tuivec.pub(mp(dis,num));
	if(mymap[K-dis].fir==mapban){mineq(ans,num+mymap[K-dis].sec);}
	if(used[ter]){return;}
	for(auto it:road[ter]){
		if(it.fir==per||dis+it.sec>K){continue;}
		dfs(it.fir,ter,dis+it.sec,num+1);
	}
}
int kocot(int ter,int per){
	int kos=1;
	if(used[ter]){return 1;}
	for(auto it:road[ter]){
		if(it.fir==per){continue;}
		kos+=kocot(it.fir,ter);
	}
	return kos;
}
void solve(int ter){
	//terを含む重心を見つけて行います
	if(used[ter]){return;}
	mapban--;
	mymap[0]=mp(mapban,0);
	nozen=kocot(ter,-1);
	gezyu=mp(869120,ter);
	fizyu(ter,-1);
	int zyu=gezyu.sec;//重心に対して何かする
	used[zyu]=1;
	for(auto it:road[zyu]){
		tuivec.clear();
		if(it.sec<K){dfs(it.fir,zyu,it.sec,1);}
		for(auto tui:tuivec){mineq(mymap[tui.fir],mp(mapban,tui.sec));}
	}
	for(auto it:road[zyu]){solve(it.fir);}
}
int best_path(int n,int KK,int H[][2],int L[]){
	tuivec.resize(n);
	K=KK;
	road.res(n);
	used.res(n);
	mymap.res(K+1);
	int i;
	for(i=0;i<n-1;i++){
		if(L[i]==K){return 1;}
		road[H[i][0]].pub(mp(H[i][1],L[i]));
		road[H[i][1]].pub(mp(H[i][0],L[i]));
	}
	solve(0);
	if(ans==869120){return -1;}
	return ans;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
22.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	3 ms	576 KB	Output is correct
3	Correct	3 ms	576 KB	Output is correct
4	Correct	3 ms	576 KB	Output is correct
5	Correct	2 ms	576 KB	Output is correct
6	Correct	3 ms	696 KB	Output is correct
7	Correct	4 ms	696 KB	Output is correct
8	Correct	3 ms	696 KB	Output is correct
9	Correct	3 ms	804 KB	Output is correct
10	Correct	3 ms	832 KB	Output is correct
11	Correct	3 ms	832 KB	Output is correct
12	Correct	3 ms	832 KB	Output is correct
13	Correct	3 ms	832 KB	Output is correct
14	Correct	4 ms	832 KB	Output is correct
15	Correct	3 ms	832 KB	Output is correct
16	Correct	3 ms	832 KB	Output is correct
17	Correct	3 ms	832 KB	Output is correct
18	Correct	4 ms	832 KB	Output is correct
19	Correct	261 ms	10364 KB	Output is correct
20	Correct	232 ms	11840 KB	Output is correct
21	Correct	298 ms	13220 KB	Output is correct
22	Correct	236 ms	14664 KB	Output is correct
23	Correct	40 ms	14664 KB	Output is correct
24	Correct	124 ms	17564 KB	Output is correct
25	Correct	279 ms	21556 KB	Output is correct
26	Correct	126 ms	25796 KB	Output is correct
27	Correct	312 ms	31224 KB	Output is correct
28	Correct	614 ms	45536 KB	Output is correct
29	Correct	674 ms	47728 KB	Output is correct
30	Correct	353 ms	47728 KB	Output is correct
31	Correct	294 ms	47728 KB	Output is correct
32	Correct	376 ms	47728 KB	Output is correct
33	Correct	588 ms	48156 KB	Output is correct
34	Correct	521 ms	51836 KB	Output is correct

Subtask #4
57.0 / 57.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	3 ms	576 KB	Output is correct
3	Correct	3 ms	576 KB	Output is correct
4	Correct	3 ms	576 KB	Output is correct
5	Correct	2 ms	576 KB	Output is correct
6	Correct	3 ms	696 KB	Output is correct
7	Correct	4 ms	696 KB	Output is correct
8	Correct	3 ms	696 KB	Output is correct
9	Correct	3 ms	804 KB	Output is correct
10	Correct	3 ms	832 KB	Output is correct
11	Correct	3 ms	832 KB	Output is correct
12	Correct	3 ms	832 KB	Output is correct
13	Correct	3 ms	832 KB	Output is correct
14	Correct	4 ms	832 KB	Output is correct
15	Correct	3 ms	832 KB	Output is correct
16	Correct	3 ms	832 KB	Output is correct
17	Correct	3 ms	832 KB	Output is correct
18	Correct	4 ms	832 KB	Output is correct
19	Correct	3 ms	832 KB	Output is correct
20	Correct	3 ms	832 KB	Output is correct
21	Correct	5 ms	832 KB	Output is correct
22	Correct	10 ms	8116 KB	Output is correct
23	Correct	8 ms	8116 KB	Output is correct
24	Correct	11 ms	8116 KB	Output is correct
25	Correct	9 ms	8116 KB	Output is correct
26	Correct	5 ms	8116 KB	Output is correct
27	Correct	8 ms	8116 KB	Output is correct
28	Correct	6 ms	8116 KB	Output is correct
29	Correct	6 ms	8116 KB	Output is correct
30	Correct	6 ms	8116 KB	Output is correct
31	Correct	7 ms	8116 KB	Output is correct
32	Correct	8 ms	8116 KB	Output is correct
33	Correct	10 ms	8116 KB	Output is correct
34	Correct	8 ms	8116 KB	Output is correct
35	Correct	10 ms	8116 KB	Output is correct
36	Correct	9 ms	8404 KB	Output is correct
37	Correct	8 ms	8404 KB	Output is correct
38	Correct	7 ms	8404 KB	Output is correct
39	Correct	261 ms	10364 KB	Output is correct
40	Correct	232 ms	11840 KB	Output is correct
41	Correct	298 ms	13220 KB	Output is correct
42	Correct	236 ms	14664 KB	Output is correct
43	Correct	40 ms	14664 KB	Output is correct
44	Correct	124 ms	17564 KB	Output is correct
45	Correct	279 ms	21556 KB	Output is correct
46	Correct	126 ms	25796 KB	Output is correct
47	Correct	312 ms	31224 KB	Output is correct
48	Correct	614 ms	45536 KB	Output is correct
49	Correct	674 ms	47728 KB	Output is correct
50	Correct	353 ms	47728 KB	Output is correct
51	Correct	294 ms	47728 KB	Output is correct
52	Correct	376 ms	47728 KB	Output is correct
53	Correct	588 ms	48156 KB	Output is correct
54	Correct	521 ms	51836 KB	Output is correct
55	Correct	18 ms	51836 KB	Output is correct
56	Correct	16 ms	51836 KB	Output is correct
57	Correct	143 ms	51836 KB	Output is correct
58	Correct	57 ms	51836 KB	Output is correct
59	Correct	147 ms	56040 KB	Output is correct
60	Correct	899 ms	78416 KB	Output is correct
61	Correct	396 ms	78416 KB	Output is correct
62	Correct	370 ms	78416 KB	Output is correct
63	Correct	461 ms	78416 KB	Output is correct
64	Correct	895 ms	78416 KB	Output is correct
65	Correct	430 ms	78416 KB	Output is correct
66	Correct	782 ms	95732 KB	Output is correct
67	Correct	234 ms	95732 KB	Output is correct
68	Correct	490 ms	95732 KB	Output is correct
69	Correct	516 ms	98316 KB	Output is correct
70	Correct	457 ms	100872 KB	Output is correct

답안 #70086

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 12.0 / 12.0

Subtask #3 22.0 / 22.0

Subtask #4 57.0 / 57.0

Subtask #1
9.0 / 9.0

Subtask #2
12.0 / 12.0

Subtask #3
22.0 / 22.0

Subtask #4
57.0 / 57.0