oj.uz

답안 #1088102

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1088102 2024-09-13T21:50:55 Z freedommo33 Village (BOI20_village) C++17
75 / 100
 85 ms 60240 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 && (par[i]!=1 || g[1].size() > 1)){
			//cout<<"P3: "<<p1<<" "<<p2<<" "<<i<<endl;
			paramin[p1] = i;
			paramin[p2] = p1;
			paramin[i] = p2;
		}
	}
	if(paramin[1] == 0){
		int a = g[1][0], b = paramin[a];
		//cout<<"P4: "<<a<<" "<<b<<endl;
		paramin[a] = 1;
		paramin[b] = a;
		paramin[1] = b;
		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

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 47452 KB Output is correct
2 Correct 19 ms 47448 KB Output is correct
3 Correct 19 ms 47384 KB Output is correct
4 Correct 20 ms 47452 KB Output is correct
5 Correct 20 ms 47448 KB Output is correct
6 Correct 19 ms 47448 KB Output is correct
7 Correct 19 ms 47448 KB Output is correct
8 Correct 21 ms 47348 KB Output is correct
9 Correct 19 ms 47392 KB Output is correct
10 Correct 20 ms 47468 KB Output is correct
11 Correct 19 ms 47452 KB Output is correct
12 Correct 19 ms 47452 KB Output is correct
13 Correct 23 ms 47428 KB Output is correct
14 Correct 21 ms 47452 KB Output is correct
15 Correct 19 ms 47360 KB Output is correct
16 Correct 19 ms 47452 KB Output is correct
17 Correct 18 ms 47452 KB Output is correct

Subtask #2
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 47452 KB Output is correct
2 Correct 19 ms 47452 KB Output is correct
3 Correct 21 ms 47452 KB Output is correct
4 Correct 21 ms 47452 KB Output is correct
5 Correct 21 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 21 ms 47452 KB Output is correct
9 Correct 22 ms 47448 KB Output is correct
10 Correct 24 ms 47512 KB Output is correct
11 Correct 21 ms 47452 KB Output is correct
12 Correct 21 ms 47452 KB Output is correct
13 Correct 23 ms 47448 KB Output is correct
14 Correct 20 ms 47580 KB Output is correct
15 Correct 22 ms 47452 KB Output is correct
16 Correct 21 ms 47452 KB Output is correct
17 Correct 21 ms 47452 KB Output is correct
18 Correct 21 ms 47452 KB Output is correct
19 Correct 20 ms 47452 KB Output is correct
20 Correct 20 ms 47380 KB Output is correct
21 Correct 21 ms 47452 KB Output is correct
22 Correct 23 ms 47452 KB Output is correct
23 Correct 22 ms 47452 KB Output is correct
24 Correct 20 ms 47448 KB Output is correct
25 Correct 27 ms 47440 KB Output is correct
26 Correct 22 ms 47452 KB Output is correct
27 Correct 22 ms 47452 KB Output is correct
28 Correct 21 ms 47452 KB Output is correct
29 Correct 20 ms 47496 KB Output is correct
30 Correct 21 ms 47448 KB Output is correct

Subtask #3
25.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 47452 KB Output is correct
2 Correct 19 ms 47448 KB Output is correct
3 Correct 19 ms 47384 KB Output is correct
4 Correct 20 ms 47452 KB Output is correct
5 Correct 20 ms 47448 KB Output is correct
6 Correct 19 ms 47448 KB Output is correct
7 Correct 19 ms 47448 KB Output is correct
8 Correct 21 ms 47348 KB Output is correct
9 Correct 19 ms 47392 KB Output is correct
10 Correct 20 ms 47468 KB Output is correct
11 Correct 19 ms 47452 KB Output is correct
12 Correct 19 ms 47452 KB Output is correct
13 Correct 23 ms 47428 KB Output is correct
14 Correct 21 ms 47452 KB Output is correct
15 Correct 19 ms 47360 KB Output is correct
16 Correct 19 ms 47452 KB Output is correct
17 Correct 18 ms 47452 KB Output is correct
18 Correct 20 ms 47452 KB Output is correct
19 Correct 19 ms 47452 KB Output is correct
20 Correct 21 ms 47452 KB Output is correct
21 Correct 21 ms 47452 KB Output is correct
22 Correct 21 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 21 ms 47452 KB Output is correct
26 Correct 22 ms 47448 KB Output is correct
27 Correct 24 ms 47512 KB Output is correct
28 Correct 21 ms 47452 KB Output is correct
29 Correct 21 ms 47452 KB Output is correct
30 Correct 23 ms 47448 KB Output is correct
31 Correct 20 ms 47580 KB Output is correct
32 Correct 22 ms 47452 KB Output is correct
33 Correct 21 ms 47452 KB Output is correct
34 Correct 21 ms 47452 KB Output is correct
35 Correct 21 ms 47452 KB Output is correct
36 Correct 20 ms 47452 KB Output is correct
37 Correct 20 ms 47380 KB Output is correct
38 Correct 21 ms 47452 KB Output is correct
39 Correct 23 ms 47452 KB Output is correct
40 Correct 22 ms 47452 KB Output is correct
41 Correct 20 ms 47448 KB Output is correct
42 Correct 27 ms 47440 KB Output is correct
43 Correct 22 ms 47452 KB Output is correct
44 Correct 22 ms 47452 KB Output is correct
45 Correct 21 ms 47452 KB Output is correct
46 Correct 20 ms 47496 KB Output is correct
47 Correct 21 ms 47448 KB Output is correct
48 Correct 66 ms 55496 KB Output is correct
49 Partially correct 68 ms 56356 KB Partially correct
50 Correct 69 ms 56312 KB Output is correct
51 Correct 57 ms 54228 KB Output is correct
52 Correct 67 ms 56364 KB Output is correct
53 Partially correct 63 ms 55556 KB Partially correct
54 Correct 52 ms 52948 KB Output is correct
55 Partially correct 85 ms 58824 KB Partially correct
56 Partially correct 75 ms 57552 KB Partially correct
57 Correct 72 ms 56944 KB Output is correct
58 Correct 72 ms 56784 KB Output is correct
59 Correct 65 ms 56484 KB Output is correct
60 Correct 66 ms 60240 KB Output is correct
61 Correct 59 ms 57476 KB Output is correct
62 Correct 59 ms 56780 KB Output is correct
63 Correct 58 ms 56332 KB Output is correct
64 Correct 59 ms 56560 KB Output is correct
65 Correct 57 ms 56856 KB Output is correct
66 Correct 59 ms 56096 KB Output is correct
67 Correct 53 ms 54724 KB Output is correct
68 Correct 57 ms 55244 KB Output is correct
69 Correct 61 ms 57020 KB Output is correct
70 Correct 66 ms 56264 KB Output is correct
71 Correct 48 ms 53960 KB Output is correct
72 Correct 52 ms 54828 KB Output is correct
73 Correct 61 ms 56976 KB Output is correct
74 Correct 60 ms 56020 KB Output is correct
75 Correct 70 ms 56256 KB Output is correct
76 Correct 67 ms 56216 KB Output is correct
77 Correct 72 ms 56364 KB Output is correct
78 Correct 49 ms 53536 KB Output is correct
79 Correct 53 ms 54472 KB Output is correct
80 Correct 64 ms 56264 KB Output is correct
81 Correct 60 ms 56776 KB Output is correct
82 Correct 59 ms 56652 KB Output is correct