oj.uz

Submission #575687

# Submission time Handle Problem Language Result Execution time Memory
575687 2022-06-11T08:06:14 Z talant117408 Village (BOI20_village) C++17
50 / 100
 94 ms 23528 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
 
#define pb                  push_back
#define mp                  make_pair
#define all(v)              (v).begin(),(v).end()
#define rall(v)             (v).rbegin(),(v).rend()
#define lb                  lower_bound
#define ub                  upper_bound
#define sz(v)               int((v).size())
#define do_not_disturb      ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl                '\n'

void solve() {
    int n;
    cin >> n;
    vector <int> graph[n];
    for (int i = 0; i < n-1; i++) {
        int a, b;
        cin >> a >> b;
        a--; b--;
        graph[a].pb(b);
        graph[b].pb(a);
    }
    
    int cost[2];
    cost[0] = cost[1] = 0;
    vector <int> subtree(n);
    vector <vector <int>> rear(2, vector <int> (n, 0));
    
    function <int(int, int)> find_smallest = [&](int v, int p) {
        vector <int> children;
        subtree[v] = 1;
        for (auto to : graph[v]) {
            if (to == p) continue;
            if (find_smallest(to, v)) {
                children.pb(to);
            }
            subtree[v] += subtree[to];
        }
        if (sz(children) == 0) {
            if (v) return 1;
            cost[0] += 2;
            int x = graph[v][0];
            rear[0][v] = rear[0][x];
            rear[0][x] = v;
        }
        else if (sz(children)&1) {
            cost[0] += int(sz(children)/2)*4+2;
            rear[0][v] = children[0];
            rear[0][children[0]] = v;
            for (int i = 1; i < sz(children); i += 2) {
                rear[0][children[i]] = children[i+1];
                rear[0][children[i+1]] = children[i];
            }
        }
        else {
            cost[0] += sz(children)*2;
            rear[0][v] = children[1];
            rear[0][children[1]] = children[0];
            rear[0][children[0]] = v;
            for (int i = 2; i < sz(children); i += 2) {
                rear[0][children[i]] = children[i+1];
                rear[0][children[i+1]] = children[i];
            }
        }
        return 0;
    };
    find_smallest(0, 0);
    
    function <int(int, int)> find_centroid = [&](int v, int p) {
        for (auto to : graph[v]) {
            if (to == p) continue;
            if (subtree[to]*2 > subtree[0]) {
                return find_centroid(to, v);
            }
        }
        return v;
    };
    function <void(int, int)> find_largest = [&](int v, int p) {
        if (v) {
            cost[1] += min(subtree[v], subtree[0]-subtree[v])*2;
        }
        for (auto to : graph[v]) {
            if (to == p) continue;
            find_largest(to, v);
        }
    };
    int centroid = find_centroid(0, 0);
    find_largest(0, 0);
    vector <vector <int>> children(sz(graph[centroid]));
    function <void(int, int, int)> find_children = [&](int v, int p, int i) {
        children[i].pb(v);
        for (auto to : graph[v]) {
            if (to == p) continue;
            find_children(to, v, i);
        }
    };
    for (int i = 0; i < sz(graph[centroid]); i++) {
        find_children(graph[centroid][i], centroid, i);
    }
    if (n&1) {
        rear[1][centroid] = children[1].back();
        rear[1][children[1].back()] = children[0].back();
        rear[1][children[0].back()] = centroid;
        children[0].pop_back();
        children[1].pop_back();
    }
    else {
        rear[1][centroid] = children[0].back();
        rear[1][children[0].back()] = centroid;
        children[0].pop_back();
    }
    int l = 0, r = 1;
    while (1) {
        while (l < sz(children) && sz(children[l]) == 0) l++;
        while (r < sz(children) && sz(children[r]) == 0) r++;
        if (r == l) r++;
        while (r < sz(children) && sz(children[r]) == 0) r++;
        
        if (l >= sz(children) || r >= sz(children)) {
            break;
        }
        
        rear[1][children[l].back()] = children[r].back();
        rear[1][children[r].back()] = children[l].back();
        children[l].pop_back();
        children[r].pop_back();
    }
    
    cout << cost[0] << ' ' << cost[1] << endl;
    for (int i = 0; i < 2; i++) {
        for (auto to : rear[i]) cout << to+1 << ' ';
        cout << endl;
    }
}

int main() {
    do_not_disturb
    
    int t = 1;
    //~ cin >> t;
    while (t--) {
        solve();
    }
    
    return 0;
}
/*
7
4 2
5 7
3 4
6 3
1 3
4 5
*/

Subtask #1
6.0 / 12.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 212 KB Partially correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Partially correct 1 ms 212 KB Partially correct
5 Correct 1 ms 320 KB Output is correct
6 Partially correct 0 ms 212 KB Partially correct
7 Correct 1 ms 320 KB Output is correct
8 Partially correct 1 ms 212 KB Partially correct
9 Correct 1 ms 212 KB Output is correct
10 Partially correct 1 ms 212 KB Partially correct
11 Correct 1 ms 316 KB Output is correct
12 Partially correct 1 ms 316 KB Partially correct
13 Partially correct 0 ms 212 KB Partially 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 Partially correct 1 ms 212 KB Partially correct

Subtask #2
19.0 / 38.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 340 KB Partially correct
2 Partially correct 1 ms 340 KB Partially correct
3 Partially correct 1 ms 340 KB Partially correct
4 Partially correct 1 ms 340 KB Partially correct
5 Partially correct 1 ms 340 KB Partially correct
6 Partially correct 1 ms 340 KB Partially correct
7 Partially correct 1 ms 468 KB Partially correct
8 Partially correct 1 ms 340 KB Partially correct
9 Partially correct 1 ms 340 KB Partially correct
10 Correct 1 ms 340 KB Output is correct
11 Partially correct 1 ms 324 KB Partially correct
12 Correct 1 ms 340 KB Output is correct
13 Partially correct 1 ms 340 KB Partially correct
14 Partially correct 1 ms 324 KB Partially correct
15 Partially correct 1 ms 340 KB Partially correct
16 Partially correct 1 ms 340 KB Partially correct
17 Partially correct 1 ms 340 KB Partially correct
18 Correct 1 ms 340 KB Output is correct
19 Partially correct 1 ms 340 KB Partially correct
20 Partially correct 1 ms 340 KB Partially correct
21 Partially correct 1 ms 340 KB Partially correct
22 Partially correct 1 ms 324 KB Partially correct
23 Partially correct 1 ms 320 KB Partially correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Partially correct 1 ms 340 KB Partially correct
27 Partially correct 1 ms 340 KB Partially correct
28 Partially correct 1 ms 340 KB Partially correct
29 Partially correct 1 ms 340 KB Partially correct
30 Partially correct 1 ms 340 KB Partially correct

Subtask #3
25.0 / 50.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 212 KB Partially correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Partially correct 1 ms 212 KB Partially correct
5 Correct 1 ms 320 KB Output is correct
6 Partially correct 0 ms 212 KB Partially correct
7 Correct 1 ms 320 KB Output is correct
8 Partially correct 1 ms 212 KB Partially correct
9 Correct 1 ms 212 KB Output is correct
10 Partially correct 1 ms 212 KB Partially correct
11 Correct 1 ms 316 KB Output is correct
12 Partially correct 1 ms 316 KB Partially correct
13 Partially correct 0 ms 212 KB Partially 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 Partially correct 1 ms 212 KB Partially correct
18 Partially correct 1 ms 340 KB Partially correct
19 Partially correct 1 ms 340 KB Partially correct
20 Partially correct 1 ms 340 KB Partially correct
21 Partially correct 1 ms 340 KB Partially correct
22 Partially correct 1 ms 340 KB Partially correct
23 Partially correct 1 ms 340 KB Partially correct
24 Partially correct 1 ms 468 KB Partially correct
25 Partially correct 1 ms 340 KB Partially correct
26 Partially correct 1 ms 340 KB Partially correct
27 Correct 1 ms 340 KB Output is correct
28 Partially correct 1 ms 324 KB Partially correct
29 Correct 1 ms 340 KB Output is correct
30 Partially correct 1 ms 340 KB Partially correct
31 Partially correct 1 ms 324 KB Partially correct
32 Partially correct 1 ms 340 KB Partially correct
33 Partially correct 1 ms 340 KB Partially correct
34 Partially correct 1 ms 340 KB Partially correct
35 Correct 1 ms 340 KB Output is correct
36 Partially correct 1 ms 340 KB Partially correct
37 Partially correct 1 ms 340 KB Partially correct
38 Partially correct 1 ms 340 KB Partially correct
39 Partially correct 1 ms 324 KB Partially correct
40 Partially correct 1 ms 320 KB Partially correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Partially correct 1 ms 340 KB Partially correct
44 Partially correct 1 ms 340 KB Partially correct
45 Partially correct 1 ms 340 KB Partially correct
46 Partially correct 1 ms 340 KB Partially correct
47 Partially correct 1 ms 340 KB Partially correct
48 Partially correct 69 ms 9224 KB Partially correct
49 Partially correct 66 ms 9928 KB Partially correct
50 Partially correct 66 ms 10096 KB Partially correct
51 Partially correct 53 ms 7776 KB Partially correct
52 Partially correct 64 ms 9832 KB Partially correct
53 Partially correct 55 ms 8816 KB Partially correct
54 Correct 40 ms 11436 KB Output is correct
55 Partially correct 94 ms 23528 KB Partially correct
56 Partially correct 83 ms 16452 KB Partially correct
57 Partially correct 92 ms 14284 KB Partially correct
58 Correct 75 ms 12236 KB Output is correct
59 Partially correct 81 ms 10188 KB Partially correct
60 Correct 52 ms 15056 KB Output is correct
61 Partially correct 53 ms 11132 KB Partially correct
62 Partially correct 60 ms 10588 KB Partially correct
63 Partially correct 50 ms 9948 KB Partially correct
64 Partially correct 57 ms 10252 KB Partially correct
65 Partially correct 66 ms 10456 KB Partially correct
66 Partially correct 64 ms 9804 KB Partially correct
67 Partially correct 39 ms 8264 KB Partially correct
68 Partially correct 54 ms 8788 KB Partially correct
69 Partially correct 52 ms 10436 KB Partially correct
70 Partially correct 49 ms 9784 KB Partially correct
71 Partially correct 38 ms 7304 KB Partially correct
72 Partially correct 40 ms 8228 KB Partially correct
73 Partially correct 51 ms 10436 KB Partially correct
74 Partially correct 48 ms 9500 KB Partially correct
75 Partially correct 63 ms 9764 KB Partially correct
76 Partially correct 65 ms 9656 KB Partially correct
77 Partially correct 62 ms 9948 KB Partially correct
78 Partially correct 38 ms 6832 KB Partially correct
79 Partially correct 44 ms 7892 KB Partially correct
80 Partially correct 64 ms 9656 KB Partially correct
81 Partially correct 56 ms 9848 KB Partially correct
82 Partially correct 52 ms 10016 KB Partially correct