# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
857927 | Trisanu_Das | Village (BOI20_village) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
int adj[11][11];
signed main(){
int n, ans = 0; cin >> n;
memset(adj, INT_MAX, sizeof(adj));
for(int i = 0; i < n ; i++) adj[i][i] = 0;
for(int x = 0; x < n - 1; x++){
int u, v; cin >> u >> v;
adj[u][v] = adj[v][u] = 1;
}
//Floyd Warshall
for(int k = 0; k < n; k++) for(int i = 0; i < n; i++) for(int j = 0; j < n; j++) adj[i][j] = min(adj[i][j], adj[i][k] + adj[k][j]);
vector<int> perm, mn, mx;
int mx_val = INT_MIN, mn_val = INT_MAX;
for(int i = 0; i < n; i++) perm.push_back(i);
do{
int sum = 0; bool flag = true;
for(int i = 0; i < n; i++){
if(perm[i] == i){
flag = false; break;
}
sum += adj[i][perm[i]];
if(!flag) continue;
if(sum < mn_val){
mn_val = sum; mn = perm;
}
if(sum > mx_val){
mx_val = sum; mx = perm;
}
}
}while(next_permutation(b));
cout << mn_val << ' ' << mx_val << '\n';
for(int i = 0; i < n; i++) cout << mn[i] + 1 << '\n';
for(int j = 0; j < n; j++) cout << mx[i] + 1 << '\n';
}