제출 #1239261

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1239261		thelegendary08	Village (BOI20_village)	C++17	12 / 100	380 ms	21576 KiB

Village

#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define pout(a) cout<<a.first<<' '<<a.second<<'\n'
#define vout(v) for(auto u : v){cout<<u<<' ';} cout<<endl
#define dout(a) cout<<a<<' '<<#a<<endl
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<endl
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;
const int mxn = 1e5 + 5;
const int lg = floor(log2(mxn)) + 1;
vvi adj(mxn); vi par(mxn), dep(mxn); vb vis(mxn);
vi ans(mxn);
vvi jmp(mxn, vi(lg));
void dfs(int node, int from){
	par[node] = from;
	for(auto u : adj[node]){
		if(u != from){
			dep[u] = 1 + dep[node];
			dfs(u, node);
		}
	}
}

int dist(int a, int b){
	int ret = 0;
	if(dep[a] > dep[b])swap(a,b);
	int dif = dep[b] - dep[a];
	f0r(i, lg){
		if((1LL << i) & dif){
			b = jmp[b][i];
		}
	}
	ret = dif;
	if(a == b)return ret;
	for(int i = lg - 1; i>=0; i--){
		if(jmp[a][i] != jmp[b][i]){
			ret += (1LL << (i + 1));
			a = jmp[a][i]; b = jmp[b][i];
		}
	}
	return ret + 2;
}
int N;
void solve(int node, int from){
	// dout(node);
	for(auto u : adj[node]){
		if(u != from)solve(u, node);
	}
	vi tmp;
	for(auto u : adj[node]){
		if(u != from){
			if(ans[u] == -1){
				tmp.pb(u);
			}
		}
	}
	// vout(tmp);
	if(tmp.size() % 2 == 1){
		ans[tmp[0]] = node;
		ans[node] = tmp[0];
		for(int i = 1; i<tmp.size(); i+=2){
			ans[tmp[i]] = tmp[i+1]; 
			ans[tmp[i+1]] = tmp[i];
		}
	}
	else if(tmp.size() >= 2){
		if(true){
			ans[node] = tmp[0]; ans[tmp[0]] = tmp[1]; ans[tmp[1]] = node;
			for(int i = 2; i<tmp.size(); i+=2){
				ans[tmp[i]] = tmp[i+1];
				ans[tmp[i+1]] = tmp[i];
			}
		}
		else{
			for(int i = 0; i<tmp.size(); i+=2){
				ans[tmp[i]] = tmp[i+1];
				ans[tmp[i+1]] = tmp[i];
			}
		}
	}
	else if(node == 0){
		int a = adj[node][0];
		int b = ans[a];
		ans[0] = a; 
		ans[a] = b;
		ans[b] = 0;
	}
	// f0r(i,N)cout<<ans[i] + 1<<' ';
	// cout<<'\n';
	
}

signed main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	//ifstream cin(".in");
	//ofstream cout(".out");
	in(n); N = n;
	f0r(i, n-1){
		in2(a,b); a--; b--;
		adj[a].pb(b); adj[b].pb(a);
	}
	dfs(0, -1);
	f0r(i,n){
		jmp[i][0] = par[i];
	}
	FOR(i, 1, lg){
		f0r(j,n){
			if(jmp[j][i-1] == -1)jmp[j][i] = -1;
			else jmp[j][i] = jmp[jmp[j][i-1]][i-1];
		}
	}
	if(n<=10){
		vi perm; 
		f0r(i,n){
			perm.pb(i);
		}
		vi mxv, mnv;
		int mx = -4e18; int mn = 4e18;
		do{
			bool ok = 1;
			f0r(i,n){
				if(i == perm[i])ok = 0;
			}
			if(!ok)continue;
			int sum = 0;
			f0r(i,n){
				sum += dist(i, perm[i]);
			}
			if(sum < mn){
				mn = sum; mnv = perm;
			}
			if(sum > mx){
				mx = sum; mxv = perm;
			}
		}while(next_permutation(all(perm)));
		out2(mn, mx);
		f0r(i,n){
			cout<<mnv[i]+1<<' ';
		}
		cout<<'\n';
		f0r(i,n){
			cout<<mxv[i]+1<<' ';
		}
	}
	else{
		// dout("HERE");
		f0r(i,n)ans[i] = -1;
		solve(0, -1);
		// f0r(i,n)cout<<ans[i] + 1<<' ';
		// cout<<'\n';
		int mn = 0;
		f0r(i, n){
			mn += dist(i, ans[i]);
		}
		out2(mn, 0);
		f0r(i,n)cout<<ans[i] + 1<<' ';
		cout<<'\n';
		f0r(i,n)cout<<1<<' ';
		
	}
	
}

• Subtask 1: 12 / 12
• Subtask 2: 0 / 38
• Subtask 3: 0 / 50