제출 #567882

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
567882		stevancv	Village (BOI20_village)	C++14	100 / 100	112 ms	16548 KiB

Village

#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
using namespace std;
const int N = 1e5 + 2;
const ll mod = 1e9 + 7;
vector<int> adj[N];
int ans[N];
int sz[N], dep[N], n;
vector<int> order;
ll sol;
void Dfs(int s, int e) {
    for (auto u : adj[s]) {
        if (u == e) continue;
        Dfs(u, s);
        if (ans[u] == u) {
            swap(ans[u], ans[s]);
            sol += 2;
        }
    }
}
void Dfsb(int s, int e) {
    sz[s] = 1;
    for (auto u : adj[s]) {
        if (u == e) continue;
        Dfsb(u, s);
        sz[s] += sz[u];
    }
}
int Dfs1b(int s, int e) {
    for (auto u : adj[s]) {
        if (u == e) continue;
        if (2 * sz[u] > n) return Dfs1b(u, s);
    }
    return s;
}
void Dfs2b(int s, int e) {
    order.push_back(s);
    for (auto u : adj[s]) {
        if (u == e) continue;
        dep[u] = dep[s] + 1;
        Dfs2b(u, s);
    }
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> n;
    for (int i = 1; i < n; i++) {
        int u, v;
        cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    for (int i = 1; i <= n; i++) ans[i] = i;
    Dfs(1, 0);
    if (ans[1] == 1) {
        swap(ans[1], ans[adj[1][0]]);
        sol += 2;
    }
    ll solmn = sol;
    vector<int> ansmn;
    for (int i = 1; i <= n; i++) {
        ansmn.push_back(ans[i]);
        ans[i] = 0;
    }
    Dfsb(1, 0);
    int cen = Dfs1b(1, 0);
    Dfs2b(cen, 0);
    sol = 0;
    for (int i = 0; i < n; i++) {
        int x = order[i];
        int y = order[(i + n / 2) % n];
        ans[x] = y;
        sol += dep[x] + dep[y];
    }
    cout << solmn << sp << sol << en;
    for (int i : ansmn) cout << i << sp;
    cout << en;
    for (int i = 1; i <= n; i++) cout << ans[i] << sp;
    cout << en;
    return 0;
}

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