oj.uz

Submission #1088103

# Submission time Handle Problem Language Result Execution time Memory
1088103 2024-09-13T22:06:00 Z freedommo33 Village (BOI20_village) C++17
75 / 100
 82 ms 60144 KB 
#include <bits/stdc++.h>
typedef long long ll;
constexpr int M = 1e6+7;
using namespace std;
vector<vector<int>> g(M);
int paramin[M];
int paramax[M];
int par[M];
int sajz[M];
int kolor[M];
int odl[M];
vector<int> preorder;
vector<int> kolory[M];
int odl2[20][20];
void bfs(){
	queue<int> q;
	q.push(1);
	preorder.push_back(1);
	while(!q.empty()){
		int p = q.front();
		q.pop();
		for(auto i:g[p]) if(par[i] == 0 && par[p]!=i){
			q.push(i);
			par[i] = p;
			preorder.push_back(i);
		}
	}
}
void bfs2(int v){
	queue<int> q;
	q.push(v);
	while(!q.empty()){
		int p = q.front();
		q.pop();
		for(auto i:g[p]) if(i != v && odl[i]==0){
			odl[i] = odl[p] + 1;
			q.push(i);
		}
	}
}
int centroid = 0;
void dfs(int v){
	pair<int, int> maks = {0, 0};
	for(auto i:g[v]) if(i!=par[v]){
		if(sajz[i] > maks.first) maks = {sajz[i], i};
	}
	if(maks.first > sajz[1]/2) dfs(maks.second);
	else centroid = v;
}
void dfs2(int v, int k){
	kolor[v] = k;
	for(auto i:g[v]) if(i!=centroid && kolor[i]==0) dfs2(i, k);
}
bool czy(vector<int> a, vector<int> b) { return a.size() > b.size(); }

void bfs3(int v){
	queue<int> q;
	q.push(v);
	while(!q.empty()){
		int p = q.front();
		q.pop();
		for(auto i:g[p]) if(odl2[v][i] == 0 && i != v){
			odl2[v][i] = odl2[v][p] + 1;
			q.push(i);
		}
	}
}
int main(){
	cin.tie(0)->sync_with_stdio(0);
	int n;
	cin>>n;
	for(int i=1; i<n; i++){
		int a, b;
		cin>>a>>b;
		g[a].push_back(b);
		g[b].push_back(a);
	}
	bfs();
	reverse(preorder.begin(), preorder.end());
	int minwynik = 0;
	for(auto i:preorder){
		sajz[i] = 1;
		for(auto j:g[i]) if(j!=par[i]) sajz[i] += sajz[j];
		int last = 0;
		int p1 = 0, p2 = 0;
		for(auto j:g[i]) if(j!=par[i] && paramin[j]==0){
			if(last==0) last = j;
			else{	
				p1 = last, p2 = j;
				minwynik += 4;
				//cout<<"P1: "<<last<<" "<<j<<endl;
				paramin[last] = j;
				paramin[j] = last;
				last = 0;
			}	
		}
		if(last!=0){
			minwynik += 2;
			//cout<<"P2: "<<i<<" "<<last<<endl;
			paramin[i] = last;
			paramin[last] = i;
		}
		else if(p1!=0){
			//cout<<"P3: "<<p1<<" "<<p2<<" "<<i<<endl;
			paramin[p1] = i;
			paramin[p2] = p1;
			paramin[i] = p2;
		}
	}
	if(paramin[1] == 0){
		bool czy = 0;
		for(auto i:g[1]){
			if(paramin[paramin[i]] == i){
				int a = i, b = paramin[a];
				//cout<<"P4: "<<a<<" "<<b<<endl;
				paramin[a] = 1;
				paramin[b] = a;
				paramin[1] = b;
				minwynik+=2;
				czy = 1;
				break;
			}
		}
		if(czy == 0){
			int a = g[1][0], b = paramin[a], c = paramin[b];
			//cout<<"P5: "<<a<<" "<<b<<endl;
			paramin[b] = c;
			paramin[c] = b;
			paramin[1] = a;
			paramin[a] = 1;
			minwynik+=2;
		}
	}
	dfs(1);
	int aktk = 0;
	for(auto i:g[centroid]) dfs2(i, ++aktk);
	for(int i=1; i<=n; i++) if(i!=centroid) kolory[kolor[i]].push_back(i);
	priority_queue<pair<int, int>> q;
	for(int i=1; i<=aktk; i++){
		//cout<<kolory[i].size()<<" "<<i<<endl;
		q.push({kolory[i].size(), i});
	}
	bfs2(centroid);
	//for(int i=1; i<=n; i++) cout<<i<<": "<<odl[i]<<endl;
	int makswyn = 0;
	while(q.size() > 1){
		pair<int, int> a = q.top();
		q.pop();
		pair<int, int> b = q.top();
		q.pop();
		int aa = kolory[a.second].back();
		kolory[a.second].pop_back();
		int bb = kolory[b.second].back();
		kolory[b.second].pop_back();
		//cout<<"PARUJEMY: "<<aa<<" "<<bb<<endl;
		makswyn += (odl[aa] + odl[bb])*2;
		paramax[aa] = bb;
		paramax[bb] = aa;
		a.first--, b.first--;
		if(a.first) q.push(a);
		if(b.first) q.push(b);
	}
	if(!q.empty()){
		pair<int, int> a = q.top();
		q.pop();
		int aa = kolory[a.second].back();
		kolory[a.second].pop_back();
		//cout<<"PARUJEMY: "<<centroid<<" "<<aa<<endl;
		makswyn += odl[aa]*2;
		paramax[centroid] = aa;
		paramax[aa] = centroid;
	}
	if(paramax[centroid] == 0){
		int x = 1;
		if(centroid == 1) x = 2;
		int a = paramax[x];
		paramax[a] = centroid;
		paramax[centroid] = x;
	}
	cout<<minwynik<<" "<<makswyn<<endl;
	for(int i=1; i<=n; i++) cout<<paramin[i]<<" ";
	cout<<endl;
	for(int i=1; i<=n; i++) cout<<paramax[i]<<" ";
	cout<<endl;
	//for(int i=1; i<=n; i++) bfs3(i);
	//int aktmin = 0;
	//for(int i=1; i<=n; i++) aktmin += odl2[i][paramin[i]];
	//int aktmaks = 0;
	//for(int i=1; i<=n; i++) aktmaks += odl2[i][paramax[i]];
	//if(aktmin == minwynik && aktmaks == makswyn) cout<<"OK"<<endl;
	return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 47444 KB Output is correct
2 Correct 21 ms 47452 KB Output is correct
3 Correct 19 ms 47448 KB Output is correct
4 Correct 21 ms 47448 KB Output is correct
5 Correct 21 ms 47448 KB Output is correct
6 Correct 25 ms 47444 KB Output is correct
7 Correct 21 ms 47448 KB Output is correct
8 Correct 25 ms 47288 KB Output is correct
9 Correct 20 ms 47448 KB Output is correct
10 Correct 20 ms 47452 KB Output is correct
11 Correct 21 ms 47464 KB Output is correct
12 Correct 20 ms 47272 KB Output is correct
13 Correct 20 ms 47452 KB Output is correct
14 Correct 22 ms 47408 KB Output is correct
15 Correct 19 ms 47452 KB Output is correct
16 Correct 20 ms 47452 KB Output is correct
17 Correct 21 ms 47448 KB Output is correct

Subtask #2
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 47452 KB Output is correct
2 Correct 20 ms 47452 KB Output is correct
3 Correct 20 ms 47452 KB Output is correct
4 Correct 20 ms 47448 KB Output is correct
5 Correct 26 ms 47452 KB Output is correct
6 Correct 21 ms 47448 KB Output is correct
7 Correct 21 ms 47448 KB Output is correct
8 Correct 20 ms 47452 KB Output is correct
9 Correct 20 ms 47452 KB Output is correct
10 Correct 20 ms 47452 KB Output is correct
11 Correct 20 ms 47544 KB Output is correct
12 Correct 20 ms 47452 KB Output is correct
13 Correct 20 ms 47448 KB Output is correct
14 Correct 19 ms 47388 KB Output is correct
15 Correct 26 ms 47448 KB Output is correct
16 Correct 20 ms 47448 KB Output is correct
17 Correct 21 ms 47452 KB Output is correct
18 Correct 20 ms 47448 KB Output is correct
19 Correct 22 ms 47448 KB Output is correct
20 Correct 26 ms 47448 KB Output is correct
21 Correct 20 ms 47452 KB Output is correct
22 Correct 20 ms 47452 KB Output is correct
23 Correct 21 ms 47452 KB Output is correct
24 Correct 21 ms 47452 KB Output is correct
25 Correct 25 ms 47444 KB Output is correct
26 Correct 27 ms 47444 KB Output is correct
27 Correct 20 ms 47448 KB Output is correct
28 Correct 22 ms 47448 KB Output is correct
29 Correct 21 ms 47452 KB Output is correct
30 Correct 24 ms 47452 KB Output is correct

Subtask #3
25.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 47444 KB Output is correct
2 Correct 21 ms 47452 KB Output is correct
3 Correct 19 ms 47448 KB Output is correct
4 Correct 21 ms 47448 KB Output is correct
5 Correct 21 ms 47448 KB Output is correct
6 Correct 25 ms 47444 KB Output is correct
7 Correct 21 ms 47448 KB Output is correct
8 Correct 25 ms 47288 KB Output is correct
9 Correct 20 ms 47448 KB Output is correct
10 Correct 20 ms 47452 KB Output is correct
11 Correct 21 ms 47464 KB Output is correct
12 Correct 20 ms 47272 KB Output is correct
13 Correct 20 ms 47452 KB Output is correct
14 Correct 22 ms 47408 KB Output is correct
15 Correct 19 ms 47452 KB Output is correct
16 Correct 20 ms 47452 KB Output is correct
17 Correct 21 ms 47448 KB Output is correct
18 Correct 20 ms 47452 KB Output is correct
19 Correct 20 ms 47452 KB Output is correct
20 Correct 20 ms 47452 KB Output is correct
21 Correct 20 ms 47448 KB Output is correct
22 Correct 26 ms 47452 KB Output is correct
23 Correct 21 ms 47448 KB Output is correct
24 Correct 21 ms 47448 KB Output is correct
25 Correct 20 ms 47452 KB Output is correct
26 Correct 20 ms 47452 KB Output is correct
27 Correct 20 ms 47452 KB Output is correct
28 Correct 20 ms 47544 KB Output is correct
29 Correct 20 ms 47452 KB Output is correct
30 Correct 20 ms 47448 KB Output is correct
31 Correct 19 ms 47388 KB Output is correct
32 Correct 26 ms 47448 KB Output is correct
33 Correct 20 ms 47448 KB Output is correct
34 Correct 21 ms 47452 KB Output is correct
35 Correct 20 ms 47448 KB Output is correct
36 Correct 22 ms 47448 KB Output is correct
37 Correct 26 ms 47448 KB Output is correct
38 Correct 20 ms 47452 KB Output is correct
39 Correct 20 ms 47452 KB Output is correct
40 Correct 21 ms 47452 KB Output is correct
41 Correct 21 ms 47452 KB Output is correct
42 Correct 25 ms 47444 KB Output is correct
43 Correct 27 ms 47444 KB Output is correct
44 Correct 20 ms 47448 KB Output is correct
45 Correct 22 ms 47448 KB Output is correct
46 Correct 21 ms 47452 KB Output is correct
47 Correct 24 ms 47452 KB Output is correct
48 Correct 69 ms 55504 KB Output is correct
49 Correct 67 ms 56304 KB Output is correct
50 Correct 68 ms 56476 KB Output is correct
51 Correct 58 ms 54420 KB Output is correct
52 Correct 69 ms 56268 KB Output is correct
53 Correct 63 ms 55328 KB Output is correct
54 Correct 46 ms 52944 KB Output is correct
55 Partially correct 79 ms 58568 KB Partially correct
56 Partially correct 71 ms 57540 KB Partially correct
57 Correct 71 ms 57084 KB Output is correct
58 Correct 76 ms 56684 KB Output is correct
59 Correct 69 ms 56528 KB Output is correct
60 Correct 74 ms 60144 KB Output is correct
61 Correct 65 ms 57544 KB Output is correct
62 Correct 79 ms 56784 KB Output is correct
63 Correct 62 ms 56336 KB Output is correct
64 Correct 82 ms 56584 KB Output is correct
65 Correct 82 ms 56876 KB Output is correct
66 Correct 59 ms 56100 KB Output is correct
67 Correct 52 ms 54732 KB Output is correct
68 Correct 56 ms 55240 KB Output is correct
69 Correct 61 ms 56780 KB Output is correct
70 Correct 61 ms 56264 KB Output is correct
71 Correct 50 ms 53960 KB Output is correct
72 Correct 54 ms 54784 KB Output is correct
73 Correct 74 ms 56780 KB Output is correct
74 Correct 55 ms 56008 KB Output is correct
75 Correct 64 ms 56268 KB Output is correct
76 Correct 66 ms 56264 KB Output is correct
77 Correct 60 ms 56368 KB Output is correct
78 Correct 47 ms 53484 KB Output is correct
79 Correct 56 ms 54472 KB Output is correct
80 Correct 68 ms 56268 KB Output is correct
81 Correct 80 ms 56776 KB Output is correct
82 Correct 59 ms 56624 KB Output is correct