oj.uz

답안 #269767

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
269767 2020-08-17T09:58:07 Z anubhavdhar 경주 (Race) (IOI11_race) C++14
100 / 100
 1810 ms 52328 KB 
#include<bits/stdc++.h>

 #include "race.h"

#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ff first 
#define ss second
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pii>
#define vll vector<pll>
#define FOR(i,N) for(i=0;i<(N);++i)
#define FORe(i,N) for(i=1;i<=(N);++i)
#define FORr(i,a,b) for(i=(a);i<(b);++i)
#define FORrev(i,N) for(i=(N);i>=0;--i)
#define F0R(i,N) for(int i=0;i<(N);++i)
#define F0Re(i,N) for(int i=1;i<=(N);++i)
#define F0Rr(i,a,b) for(ll i=(a);i<(b);++i)
#define F0Rrev(i,N) for(int i=(N);i>=0;--i)
#define all(v) (v).begin(),(v).end()
#define dbgLine cerr<<" LINE : "<<__LINE__<<"\n"
#define ldd long double

using namespace std;
/*
const int Alp = 26;
const int __PRECISION = 9;
const int inf = 1e9 + 8;

const ldd PI = acos(-1);
const ldd EPS = 1e-7;

const ll MOD = 1e9 + 7;
const ll MAXN = 2e5 + 5;
const ll ROOTN = 320;
const ll LOGN = 18;
const ll INF = 1e18 + 1022;
*/

#define MAXN 200005
#define inf 1000000009

int best_path(int N, int K, int H[][2], int L[]);


vll g[MAXN];
bool centroid_marked[MAXN];
int subtree[MAXN], K, tmpans, ans;
map<ll,int> road, final;

int dfs_init(int a, int par)
{
	subtree[a] = 1;
	for(pll bb : g[a])
		if(bb.ff != par and !centroid_marked[bb.ff])
			subtree[a] += dfs_init(bb.ff, a);
	return subtree[a];
}

int getCentroid(int a, int par, int n)
{
	bool is_centroid = (n - subtree[a] <= n/2);
	int hvy = -1;
	for(pll bb : g[a])
		if(bb.ff != par and !centroid_marked[bb.ff])
		{
			is_centroid = is_centroid && (subtree[bb.ff] <= n/2);
			if(hvy == -1 || subtree[hvy] < subtree[bb.ff]) hvy = bb.ff;
		}
	if(is_centroid)
		return a;
	return getCentroid(hvy, a, n);
}

void calc(int a, int par, int dist, int lev)
{
	for(pll bb : g[a])
		if(bb.ff != par and !centroid_marked[bb.ff])
			calc(bb.ff, a, bb.ss + dist, lev+1);
	if(road.find(dist) != road.end()) road[dist] = min(road[dist], lev); else road[dist] = lev;
}

void dcmp(int root)
{
	final.clear();
	final[0] = 0;
	tmpans = inf;
	int n = dfs_init(root, -1);
	int cen = getCentroid(root, -1, n);
	centroid_marked[cen] = true;
	// cout<<"cen = "<<cen<<"\n";
	for(pll bb : g[cen])
		if(!centroid_marked[bb.ff])
		{
			road.clear();
			calc(bb.ff, cen, bb.ss, 1);
			for(map<ll, int> :: iterator it = road.begin() ; it != road.end(); ++it)
				if(final.find(K-(it->ff)) != final.end()) tmpans = min(tmpans, final[K - (it->ff)] + it->ss);
			for(map<ll, int> :: iterator it = road.begin() ; it != road.end(); ++it)
				if(final.find((it->ff)) != final.end()) final[(it->ff)] = min(final[(it->ff)], it->ss);else final[(it->ff)] = it->ss;
		}
	// cout<<"here we have \n";
	// if(cen == 17 or cen == 13)
		// for(map<ll, int> :: iterator it = final.begin() ; it != final.end(); ++it)
			// cout<<"final["<<(it->ff)<<"] = "<<(it->ss)<<'\n';
	ans = min(ans, tmpans);
	// if(tmpans != inf)
	// 	cerr<<"found tmpans = "<<tmpans<<" when cen  = "<<cen<<'\n';
	for(pll bb : g[cen])
		if(!centroid_marked[bb.ff])
			dcmp(bb.ff);
	// cout<<"tmpans = "<<tmpans<<'\n';
}

int best_path(int NN,int KK,int H[][2],int L[])
{
	K = KK;
	F0R(i, NN)
		centroid_marked[i] = false;
	F0R(i, NN-1)
		g[H[i][1]].pb(mp(H[i][0], L[i])), g[H[i][0]].pb(mp(H[i][1], L[i]));

	ans = inf;
	dcmp(0);
	return (ans == inf) ? -1 : ans;
}

// signed main()
// {

// 	/*
// 	ios_base::sync_with_stdio(false);
// 	cin.tie(NULL);
// 	cout.tie(NULL);
// 	*/

// 	int N, KK;
// 	cin>>N>>KK;
// 	int H[N-1][2], L[N-1];
// 	F0R(i, N-1)
// 		cin>>H[i][0]>>H[i][1]>>L[i];

// 	cout<<best_path(N, KK, H, L);
	
// 	return 0;
// }
/*
4 3 
0 1 1
1 2 2
1 3 4

11 12
0 1 3
0 2 4
2 3 5
3 4 4
4 5 6 
0 6 3
6 7 2
6 8 5
8 9 6
8 10 7
*/

Subtask #1
9.0 / 9.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4992 KB Output is correct
2 Correct 5 ms 4992 KB Output is correct
3 Correct 5 ms 4992 KB Output is correct
4 Correct 5 ms 4992 KB Output is correct
5 Correct 5 ms 5024 KB Output is correct
6 Correct 4 ms 5012 KB Output is correct
7 Correct 5 ms 5120 KB Output is correct
8 Correct 5 ms 4992 KB Output is correct
9 Correct 4 ms 5120 KB Output is correct
10 Correct 4 ms 4992 KB Output is correct
11 Correct 5 ms 5120 KB Output is correct
12 Correct 4 ms 4992 KB Output is correct
13 Correct 4 ms 5024 KB Output is correct
14 Correct 4 ms 4992 KB Output is correct
15 Correct 4 ms 4992 KB Output is correct
16 Correct 4 ms 4992 KB Output is correct
17 Correct 4 ms 5120 KB Output is correct
18 Correct 4 ms 4992 KB Output is correct
19 Correct 408 ms 13304 KB Output is correct
20 Correct 361 ms 13228 KB Output is correct
21 Correct 373 ms 13244 KB Output is correct
22 Correct 489 ms 13200 KB Output is correct
23 Correct 833 ms 13688 KB Output is correct
24 Correct 232 ms 12940 KB Output is correct
25 Correct 327 ms 19704 KB Output is correct
26 Correct 123 ms 19064 KB Output is correct
27 Correct 485 ms 22320 KB Output is correct
28 Correct 1775 ms 52180 KB Output is correct
29 Correct 1810 ms 52100 KB Output is correct
30 Correct 518 ms 22336 KB Output is correct
31 Correct 530 ms 22284 KB Output is correct
32 Correct 570 ms 22392 KB Output is correct
33 Correct 844 ms 21112 KB Output is correct
34 Correct 1619 ms 37468 KB Output is correct

Subtask #4
57.0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4992 KB Output is correct
2 Correct 5 ms 4992 KB Output is correct
3 Correct 5 ms 4992 KB Output is correct
4 Correct 5 ms 4992 KB Output is correct
5 Correct 5 ms 5024 KB Output is correct
6 Correct 4 ms 5012 KB Output is correct
7 Correct 5 ms 5120 KB Output is correct
8 Correct 5 ms 4992 KB Output is correct
9 Correct 4 ms 5120 KB Output is correct
10 Correct 4 ms 4992 KB Output is correct
11 Correct 5 ms 5120 KB Output is correct
12 Correct 4 ms 4992 KB Output is correct
13 Correct 4 ms 5024 KB Output is correct
14 Correct 4 ms 4992 KB Output is correct
15 Correct 4 ms 4992 KB Output is correct
16 Correct 4 ms 4992 KB Output is correct
17 Correct 4 ms 5120 KB Output is correct
18 Correct 4 ms 4992 KB Output is correct
19 Correct 4 ms 4992 KB Output is correct
20 Correct 5 ms 5024 KB Output is correct
21 Correct 6 ms 5120 KB Output is correct
22 Correct 7 ms 5248 KB Output is correct
23 Correct 7 ms 5248 KB Output is correct
24 Correct 7 ms 5248 KB Output is correct
25 Correct 6 ms 5248 KB Output is correct
26 Correct 6 ms 5248 KB Output is correct
27 Correct 5 ms 5120 KB Output is correct
28 Correct 8 ms 5248 KB Output is correct
29 Correct 6 ms 5120 KB Output is correct
30 Correct 11 ms 5248 KB Output is correct
31 Correct 8 ms 5248 KB Output is correct
32 Correct 9 ms 5248 KB Output is correct
33 Correct 7 ms 5248 KB Output is correct
34 Correct 7 ms 5248 KB Output is correct
35 Correct 8 ms 5248 KB Output is correct
36 Correct 7 ms 5120 KB Output is correct
37 Correct 8 ms 5120 KB Output is correct
38 Correct 8 ms 5120 KB Output is correct
39 Correct 408 ms 13304 KB Output is correct
40 Correct 361 ms 13228 KB Output is correct
41 Correct 373 ms 13244 KB Output is correct
42 Correct 489 ms 13200 KB Output is correct
43 Correct 833 ms 13688 KB Output is correct
44 Correct 232 ms 12940 KB Output is correct
45 Correct 327 ms 19704 KB Output is correct
46 Correct 123 ms 19064 KB Output is correct
47 Correct 485 ms 22320 KB Output is correct
48 Correct 1775 ms 52180 KB Output is correct
49 Correct 1810 ms 52100 KB Output is correct
50 Correct 518 ms 22336 KB Output is correct
51 Correct 530 ms 22284 KB Output is correct
52 Correct 570 ms 22392 KB Output is correct
53 Correct 844 ms 21112 KB Output is correct
54 Correct 1619 ms 37468 KB Output is correct
55 Correct 38 ms 6400 KB Output is correct
56 Correct 21 ms 5888 KB Output is correct
57 Correct 177 ms 13560 KB Output is correct
58 Correct 71 ms 12520 KB Output is correct
59 Correct 616 ms 27000 KB Output is correct
60 Correct 1736 ms 50992 KB Output is correct
61 Correct 588 ms 24240 KB Output is correct
62 Correct 543 ms 22392 KB Output is correct
63 Correct 578 ms 22480 KB Output is correct
64 Correct 1639 ms 31012 KB Output is correct
65 Correct 1427 ms 35680 KB Output is correct
66 Correct 1679 ms 52328 KB Output is correct
67 Correct 221 ms 21508 KB Output is correct
68 Correct 787 ms 32888 KB Output is correct
69 Correct 852 ms 33144 KB Output is correct
70 Correct 750 ms 31736 KB Output is correct