oj.uz

Submission #135776

# Submission time Handle Problem Language Result Execution time Memory
135776 2019-07-24T11:01:50 Z Sorting Race (IOI11_race) C++14
43 / 100
 2996 ms 50208 KB 
#include <bits/stdc++.h>
//#include "race.h"
 
using namespace std;
 
const int N = 2e5 + 7;
const int inf = 1e9;
const int K = 1e6 + 7;
const int T = 1e8;
 
int n, k;
vector <int> adj[N], len[N], adj_c[N], rv;
int sz[N];
 
bool used[N];
 
int find_cnt(int u, int p = -1){
	sz[u] = 1;
 
	for(int to: adj[u]){
		if(p == to || used[to]){
			continue;
		}
 
		sz[u] += find_cnt(to, u);
	}
 
	return sz[u];
}
 
int find_centroid(int u, int cnt, int p = -1){
	for(int to: adj[u]){
		if(to == p || used[to]){
			continue;
		}
 
		if(sz[to] > (cnt / 2)){
			return find_centroid(to, cnt, u);
		}
	}
 
	return u;
}	
 
int root;
 
void decompose(int u, int p = -1){
	int cnt = find_cnt(u);
	int cen = find_centroid(u, cnt);

	//cout << p << " -> " << cen << endl;
 
	if(p != -1){
		adj_c[p].push_back(cen);
	}
	else{
		root = cen;
	}
 
	used[cen] = true;
	for(int to: adj[cen]){
		if(!used[to]){
			decompose(to, cen);
		}
	}
	used[cen] = false;
}
 
int arr[K];
vector<pair<int, int> > vec;

int ans = inf;
 
void solve_k(int u, int pr, int sum, int d){
	if(sum > k){
		return;
	}
 
	vec.push_back({sum, d});
	if(arr[k - sum] != inf){
		ans = min(ans, d + arr[k - sum]);
	}

	for(int i = 0; i < adj[u].size(); i++){
		int to = adj[u][i];
		int l = len[u][i];
 
		if(used[to] || to == pr){
			continue;
		}
 
		solve_k(to, u, sum + l, d + 1);
	}
}

int sum_vec = 0;

clock_t t;

inline float time_passed(){
	return (float)(clock() - t) / (float)CLOCKS_PER_SEC;
}
 
void solve(int u){
	used[u] = true;
	for(int to: adj_c[u]){
		solve(to);
	}
	rv.clear();

	if(time_passed() > (float)2.7){
		return;
	}
	
	for(int i = 0; i < adj[u].size(); i++){
		vec.clear();
		solve_k(adj[u][i], u, len[u][i], 1);

		sum_vec += vec.size();

		for(pair<int, int> p: vec){
			if(arr[p.first] == inf){
				rv.push_back(p.first);
			}
			arr[p.first] = min(arr[p.first], p.second);
		}
	}

	for(int i: rv){
		arr[i] = inf;
	}
	
	used[u] = false;
}


 
int best_path(int _n, int _k, int _h[][2], int _l[]){
 	t = clock();

	n = _n;
	k = _k;
 
	for(int i = 0; i < n - 1; i++){
		adj[_h[i][0]].push_back(_h[i][1]);
		adj[_h[i][1]].push_back(_h[i][0]);
 
		len[_h[i][0]].push_back(_l[i]);
		len[_h[i][1]].push_back(_l[i]);
	}
 
	decompose(0);

	for(int i = 1; i < K; i++){
		arr[i] = inf;
	}
 
	solve(root);

	/*if(sum_vec > T){
		return -21;
	}*/
 
	if(ans == inf){
		return -1;
	}
 
	return ans;
}
 
/*int _h[N][2], _l[N];
 
int main(){
	int _n, _k;
 
	cin >> _n >> _k;
 
	for(int i = 0; i < _n - 1; i++){
		cin >> _h[i][0] >> _h[i][1] >> _l[i];
 	}
 
 	cout << best_path(_n, _k, _h, _l) << "\n";
 
 	return 0;
}*/
/*
10 5
0 1 2
1 2 1
2 3 2 
3 4 3
4 5 1
5 6 5
6 7 1 
7 8 2
8 9 3
*/
/*
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
*/

Compilation message

race.cpp: In function 'void solve_k(int, int, int, int)':
race.cpp:84:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < adj[u].size(); i++){
                 ~~^~~~~~~~~~~~~~~
race.cpp: In function 'void solve(int)':
race.cpp:115:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < adj[u].size(); i++){
                 ~~^~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 18396 KB Output is correct
2 Correct 21 ms 18424 KB Output is correct
3 Correct 22 ms 18296 KB Output is correct
4 Correct 22 ms 18308 KB Output is correct
5 Correct 18 ms 18296 KB Output is correct
6 Correct 18 ms 18296 KB Output is correct
7 Correct 18 ms 18296 KB Output is correct
8 Correct 18 ms 18296 KB Output is correct
9 Correct 18 ms 18296 KB Output is correct
10 Correct 18 ms 18296 KB Output is correct
11 Correct 18 ms 18296 KB Output is correct
12 Correct 18 ms 18296 KB Output is correct
13 Correct 18 ms 18300 KB Output is correct
14 Correct 22 ms 18296 KB Output is correct
15 Correct 18 ms 18296 KB Output is correct
16 Correct 18 ms 18296 KB Output is correct
17 Correct 18 ms 18296 KB Output is correct
18 Correct 18 ms 18296 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 18396 KB Output is correct
2 Correct 21 ms 18424 KB Output is correct
3 Correct 22 ms 18296 KB Output is correct
4 Correct 22 ms 18308 KB Output is correct
5 Correct 18 ms 18296 KB Output is correct
6 Correct 18 ms 18296 KB Output is correct
7 Correct 18 ms 18296 KB Output is correct
8 Correct 18 ms 18296 KB Output is correct
9 Correct 18 ms 18296 KB Output is correct
10 Correct 18 ms 18296 KB Output is correct
11 Correct 18 ms 18296 KB Output is correct
12 Correct 18 ms 18296 KB Output is correct
13 Correct 18 ms 18300 KB Output is correct
14 Correct 22 ms 18296 KB Output is correct
15 Correct 18 ms 18296 KB Output is correct
16 Correct 18 ms 18296 KB Output is correct
17 Correct 18 ms 18296 KB Output is correct
18 Correct 18 ms 18296 KB Output is correct
19 Correct 18 ms 18296 KB Output is correct
20 Correct 18 ms 18424 KB Output is correct
21 Correct 20 ms 18424 KB Output is correct
22 Correct 20 ms 18424 KB Output is correct
23 Correct 20 ms 18424 KB Output is correct
24 Correct 20 ms 18424 KB Output is correct
25 Correct 22 ms 18424 KB Output is correct
26 Correct 20 ms 18424 KB Output is correct
27 Correct 20 ms 18424 KB Output is correct
28 Correct 21 ms 18424 KB Output is correct
29 Correct 21 ms 18424 KB Output is correct
30 Correct 21 ms 18424 KB Output is correct
31 Correct 26 ms 18424 KB Output is correct
32 Correct 24 ms 18424 KB Output is correct
33 Correct 25 ms 18424 KB Output is correct
34 Correct 26 ms 18424 KB Output is correct
35 Correct 24 ms 18460 KB Output is correct
36 Correct 21 ms 18424 KB Output is correct
37 Correct 20 ms 18424 KB Output is correct
38 Correct 22 ms 18552 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 18396 KB Output is correct
2 Correct 21 ms 18424 KB Output is correct
3 Correct 22 ms 18296 KB Output is correct
4 Correct 22 ms 18308 KB Output is correct
5 Correct 18 ms 18296 KB Output is correct
6 Correct 18 ms 18296 KB Output is correct
7 Correct 18 ms 18296 KB Output is correct
8 Correct 18 ms 18296 KB Output is correct
9 Correct 18 ms 18296 KB Output is correct
10 Correct 18 ms 18296 KB Output is correct
11 Correct 18 ms 18296 KB Output is correct
12 Correct 18 ms 18296 KB Output is correct
13 Correct 18 ms 18300 KB Output is correct
14 Correct 22 ms 18296 KB Output is correct
15 Correct 18 ms 18296 KB Output is correct
16 Correct 18 ms 18296 KB Output is correct
17 Correct 18 ms 18296 KB Output is correct
18 Correct 18 ms 18296 KB Output is correct
19 Correct 477 ms 28056 KB Output is correct
20 Correct 470 ms 28116 KB Output is correct
21 Correct 519 ms 28280 KB Output is correct
22 Correct 679 ms 29096 KB Output is correct
23 Correct 298 ms 27872 KB Output is correct
24 Correct 273 ms 27384 KB Output is correct
25 Correct 404 ms 30968 KB Output is correct
26 Correct 283 ms 33840 KB Output is correct
27 Correct 1436 ms 38136 KB Output is correct
28 Correct 877 ms 47668 KB Output is correct
29 Correct 835 ms 46996 KB Output is correct
30 Correct 1478 ms 38052 KB Output is correct
31 Correct 1409 ms 38052 KB Output is correct
32 Correct 1556 ms 37976 KB Output is correct
33 Correct 791 ms 37836 KB Output is correct
34 Correct 715 ms 37808 KB Output is correct

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 18396 KB Output is correct
2 Correct 21 ms 18424 KB Output is correct
3 Correct 22 ms 18296 KB Output is correct
4 Correct 22 ms 18308 KB Output is correct
5 Correct 18 ms 18296 KB Output is correct
6 Correct 18 ms 18296 KB Output is correct
7 Correct 18 ms 18296 KB Output is correct
8 Correct 18 ms 18296 KB Output is correct
9 Correct 18 ms 18296 KB Output is correct
10 Correct 18 ms 18296 KB Output is correct
11 Correct 18 ms 18296 KB Output is correct
12 Correct 18 ms 18296 KB Output is correct
13 Correct 18 ms 18300 KB Output is correct
14 Correct 22 ms 18296 KB Output is correct
15 Correct 18 ms 18296 KB Output is correct
16 Correct 18 ms 18296 KB Output is correct
17 Correct 18 ms 18296 KB Output is correct
18 Correct 18 ms 18296 KB Output is correct
19 Correct 18 ms 18296 KB Output is correct
20 Correct 18 ms 18424 KB Output is correct
21 Correct 20 ms 18424 KB Output is correct
22 Correct 20 ms 18424 KB Output is correct
23 Correct 20 ms 18424 KB Output is correct
24 Correct 20 ms 18424 KB Output is correct
25 Correct 22 ms 18424 KB Output is correct
26 Correct 20 ms 18424 KB Output is correct
27 Correct 20 ms 18424 KB Output is correct
28 Correct 21 ms 18424 KB Output is correct
29 Correct 21 ms 18424 KB Output is correct
30 Correct 21 ms 18424 KB Output is correct
31 Correct 26 ms 18424 KB Output is correct
32 Correct 24 ms 18424 KB Output is correct
33 Correct 25 ms 18424 KB Output is correct
34 Correct 26 ms 18424 KB Output is correct
35 Correct 24 ms 18460 KB Output is correct
36 Correct 21 ms 18424 KB Output is correct
37 Correct 20 ms 18424 KB Output is correct
38 Correct 22 ms 18552 KB Output is correct
39 Correct 477 ms 28056 KB Output is correct
40 Correct 470 ms 28116 KB Output is correct
41 Correct 519 ms 28280 KB Output is correct
42 Correct 679 ms 29096 KB Output is correct
43 Correct 298 ms 27872 KB Output is correct
44 Correct 273 ms 27384 KB Output is correct
45 Correct 404 ms 30968 KB Output is correct
46 Correct 283 ms 33840 KB Output is correct
47 Correct 1436 ms 38136 KB Output is correct
48 Correct 877 ms 47668 KB Output is correct
49 Correct 835 ms 46996 KB Output is correct
50 Correct 1478 ms 38052 KB Output is correct
51 Correct 1409 ms 38052 KB Output is correct
52 Correct 1556 ms 37976 KB Output is correct
53 Correct 791 ms 37836 KB Output is correct
54 Correct 715 ms 37808 KB Output is correct
55 Correct 55 ms 19420 KB Output is correct
56 Correct 51 ms 19448 KB Output is correct
57 Correct 278 ms 29048 KB Output is correct
58 Correct 2837 ms 28620 KB Output is correct
59 Correct 303 ms 34308 KB Output is correct
60 Correct 1230 ms 50208 KB Output is correct
61 Correct 2828 ms 38636 KB Output is correct
62 Incorrect 2996 ms 40168 KB Output isn't correct
63 Halted 0 ms 0 KB -