oj.uz

답안 #711406

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
711406 2023-03-16T20:35:00 Z sysia Village (BOI20_village) C++17
100 / 100
 160 ms 26604 KB 
//Sylwia Sapkowska
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
using namespace std;

void __print(int x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef LOCAL
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

#define int long long
typedef pair<int, int> T;
const int oo = 1e18, oo2 = 1e9+7, K = 30;
const int mod = 998244353;

void solve(){
    int n; cin >> n;
    vector<vector<int>>g(n+1);
    for (int i = 1; i<n; i++){
        int a, b; cin >> a >> b;
        g[a].emplace_back(b);
        g[b].emplace_back(a);
    }
    int ans = 0;
    vector<int>mn(n+1);
    iota(mn.begin(), mn.end(), 0);
    vector<int>sub(n+1);
    function<void(int, int)>dfs = [&](int v, int pa){
        sub[v] = 1;
        for (auto x: g[v]){
            if (x == pa) continue;
            dfs(x, v);
            sub[v] += sub[x];
        }
        if (mn[v] == v) {
            swap(mn[v], mn[pa]);
            ans+=2;
        }
    };
    dfs(1, 1);
    if (mn[1] == 1) {
        swap(mn[1], mn[g[1][0]]);
    }
    for (int i = 1; i<=n; i++){
        if (mn[i] == i){
            assert(false);
        }
    }
    function<int(int, int)>get_centroid = [&](int v, int pa){
        for (auto x: g[v]){
            if (x == pa) continue;
            if (2*sub[x] > n) return get_centroid(x, v);
        }
        return v;
    };
    int c = get_centroid(1, 1);
    vector<vector<int>>sz(n+1);
    vector<int>depth(n+1);
    int ans2 = 0;
    function<void(int, int)>dfessa = [&](int v, int pa){
        sub[v] = 1;
        int mx = -1;
        for (auto x: g[v]){
            if (x == pa) continue;
            depth[x] = depth[v]+1;
            dfessa(x, v);
            sub[v] += sub[x];
            if (mx == -1 || sub[x] > sub[mx]){
                mx = x;
            }
        }
        ans2 += min(sub[v], n-sub[v]);
        if (v != c && mx != -1){
            swap(sz[v], sz[mx]);
            for (auto x: g[v]){
                if (x == pa || x == mx) continue;
                for (auto u: sz[x]) sz[v].emplace_back(u);
            }
        }
        sz[v].emplace_back(v);
    };
    debug(c);
    dfessa(c, c);
    sort(g[c].begin(), g[c].end(), [&](auto x, auto y){return sub[x] > sub[y];});
    for (auto x: g[c]){
        debug(x, sz[x]);
    }
    vector<int>mx(n+1);
    iota(mx.begin(), mx.end(), 0);
    priority_queue<T>pq;
    for (auto x: g[c]) pq.push({(int)sz[x].size(), x});
    for (int rep = 0; rep < 2; rep++){
        while (pq.size() >= 2){
            auto x = pq.top(); pq.pop();
            auto y = pq.top(); pq.pop();
            int a = sz[x.second].back();
            int b = sz[y.second].back();
            mx[a] = b;
            mx[b] = a;
            sz[x.second].pop_back();
            sz[y.second].pop_back();
            if (x.first > 1) pq.push({x.first-1, x.second});
            if (y.first > 1) pq.push({y.first-1, y.second});
        }
        pq.push({1, c});
    }
    if (n&1) {
        swap(mx[c], mx[g[c][0]]);
    }
    cout << ans << " " << 2*ans2 << "\n";
    for (int i = 1; i<=n; i++) cout << mn[i] << " ";
    cout << "\n";
    for (int i = 1; i<=n; i++) cout << mx[i] << " ";
    cout << "\n";
}

int32_t main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) solve();

    return 0;
}

Compilation message

Village.cpp: In function 'void solve()':
Village.cpp:101:15: warning: unused variable 'x' [-Wunused-variable]
  101 |     for (auto x: g[c]){
      |               ^

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 316 KB Output is correct

Subtask #2
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 452 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 452 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 448 KB Output is correct
23 Correct 2 ms 452 KB Output is correct
24 Correct 1 ms 476 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 448 KB Output is correct
30 Correct 1 ms 448 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 316 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 2 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 452 KB Output is correct
34 Correct 1 ms 468 KB Output is correct
35 Correct 1 ms 452 KB Output is correct
36 Correct 2 ms 468 KB Output is correct
37 Correct 1 ms 468 KB Output is correct
38 Correct 1 ms 468 KB Output is correct
39 Correct 1 ms 448 KB Output is correct
40 Correct 2 ms 452 KB Output is correct
41 Correct 1 ms 476 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 468 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 468 KB Output is correct
46 Correct 1 ms 448 KB Output is correct
47 Correct 1 ms 448 KB Output is correct
48 Correct 100 ms 17792 KB Output is correct
49 Correct 116 ms 19564 KB Output is correct
50 Correct 101 ms 19436 KB Output is correct
51 Correct 77 ms 15100 KB Output is correct
52 Correct 124 ms 18996 KB Output is correct
53 Correct 108 ms 17504 KB Output is correct
54 Correct 37 ms 13020 KB Output is correct
55 Correct 98 ms 26604 KB Output is correct
56 Correct 105 ms 21920 KB Output is correct
57 Correct 125 ms 20036 KB Output is correct
58 Correct 130 ms 18836 KB Output is correct
59 Correct 95 ms 19116 KB Output is correct
60 Correct 106 ms 19112 KB Output is correct
61 Correct 99 ms 18600 KB Output is correct
62 Correct 89 ms 19316 KB Output is correct
63 Correct 103 ms 18524 KB Output is correct
64 Correct 112 ms 20316 KB Output is correct
65 Correct 95 ms 20036 KB Output is correct
66 Correct 92 ms 17912 KB Output is correct
67 Correct 75 ms 14068 KB Output is correct
68 Correct 106 ms 17004 KB Output is correct
69 Correct 105 ms 19812 KB Output is correct
70 Correct 75 ms 18524 KB Output is correct
71 Correct 62 ms 13684 KB Output is correct
72 Correct 72 ms 15480 KB Output is correct
73 Correct 102 ms 19812 KB Output is correct
74 Correct 85 ms 18036 KB Output is correct
75 Correct 160 ms 21524 KB Output is correct
76 Correct 137 ms 21956 KB Output is correct
77 Correct 90 ms 20392 KB Output is correct
78 Correct 59 ms 14620 KB Output is correct
79 Correct 74 ms 16328 KB Output is correct
80 Correct 103 ms 21740 KB Output is correct
81 Correct 101 ms 20168 KB Output is correct
82 Correct 78 ms 18844 KB Output is correct