oj.uz

Submission #869683

# Submission time Handle Problem Language Result Execution time Memory
869683 2023-11-05T10:13:35 Z wakandaaa Village (BOI20_village) C++17
100 / 100
 69 ms 47548 KB 
#include <bits/stdc++.h>
#define int long long

using namespace std;

#define file ""

#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()

#define getbit(x, i) (((x) >> (i)) & 1)
#define bit(x) (1LL << (x))
#define popcount __builtin_popcountll

mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r) {
    return l + rd() % (r - l + 1);
}

const int N = 1e6 + 5;
const int mod = (int)1e9 + 7; // 998244353;
const int lg = 25; // lg + 1
const int oo = 1e9;
const long long ooo = 1e18;

template<class X, class Y> bool mini(X &a, Y b) {
    return a > b ? (a = b, true) : false;
}
template<class X, class Y> bool maxi(X &a, Y b) {
    return a < b ? (a = b, true) : false;
}
void add(int &a, int b) {
    a += b;
    if (a >= mod) a -= mod;
    if (a < 0) a += mod;
}

int n;
vector<int> adj[N];

namespace task_min {

int par[N];
int ans[N];
int res = 0;

void dfs(int u, int p) {
    for (int v : adj[u]) if (v != p) {
        dfs(v, u);
        if (!ans[u] && !ans[v]) {
            ans[u] = v;
            ans[v] = u;
            res += 2;
        }
    }
}

pair<int, vector<int> > solve() {
    dfs(1, 0);

    for (int i = 1; i <= n; ++i) if (ans[i] == 0) {
        int u = adj[i][0];
        ans[i] = ans[u];
        ans[u] = i;
        res += 2;
    }

    vector<int> pos;
    for (int i = 1; i <= n; ++i) pos.push_back(ans[i]);
    return mp(res, pos);
}

}

namespace task_max {

vector<int> topo;
int sz[N];
int fin[N];
int res = 0;

void dfs(int u, int p) {
    fin[u] = (int) topo.size();
    topo.push_back(u);
    sz[u] = 1;
    for (int v : adj[u]) if (v != p) {
        dfs(v, u);
        sz[u] += sz[v];
    }
    res += 2 * min(sz[u], n - sz[u]);
}

pair<int, vector<int> > solve() {
    dfs(1, 0);

    vector<int> pos;
    for (int i = 1; i <= n; ++i) pos.push_back(topo[(fin[i] + n / 2) % n]);
    return mp(res, pos);
}

}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);

    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);
    }

    pair<int, vector<int> > mn = task_min::solve(), mx = task_max::solve();

    cout << mn.fi << ' ' << mx.fi << '\n';
    for (int i : mn.se) cout << i << ' ';
    cout << '\n';
    for (int i : mx.se) cout << i << ' ';

    return 0;
}

/*

*/

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 28248 KB Output is correct
2 Correct 7 ms 28252 KB Output is correct
3 Correct 7 ms 28376 KB Output is correct
4 Correct 7 ms 28396 KB Output is correct
5 Correct 7 ms 28252 KB Output is correct
6 Correct 6 ms 28252 KB Output is correct
7 Correct 7 ms 28252 KB Output is correct
8 Correct 6 ms 28252 KB Output is correct
9 Correct 6 ms 28252 KB Output is correct
10 Correct 6 ms 28252 KB Output is correct
11 Correct 6 ms 28248 KB Output is correct
12 Correct 6 ms 28504 KB Output is correct
13 Correct 6 ms 28252 KB Output is correct
14 Correct 6 ms 28256 KB Output is correct
15 Correct 6 ms 28376 KB Output is correct
16 Correct 6 ms 28364 KB Output is correct
17 Correct 6 ms 28264 KB Output is correct

Subtask #2
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 28260 KB Output is correct
2 Correct 6 ms 28256 KB Output is correct
3 Correct 6 ms 28256 KB Output is correct
4 Correct 7 ms 28512 KB Output is correct
5 Correct 6 ms 28260 KB Output is correct
6 Correct 7 ms 28264 KB Output is correct
7 Correct 7 ms 28376 KB Output is correct
8 Correct 7 ms 28520 KB Output is correct
9 Correct 6 ms 28264 KB Output is correct
10 Correct 7 ms 28388 KB Output is correct
11 Correct 8 ms 28512 KB Output is correct
12 Correct 7 ms 28512 KB Output is correct
13 Correct 7 ms 28512 KB Output is correct
14 Correct 7 ms 28516 KB Output is correct
15 Correct 6 ms 28508 KB Output is correct
16 Correct 6 ms 28504 KB Output is correct
17 Correct 7 ms 28508 KB Output is correct
18 Correct 6 ms 28504 KB Output is correct
19 Correct 7 ms 28504 KB Output is correct
20 Correct 7 ms 28508 KB Output is correct
21 Correct 7 ms 28508 KB Output is correct
22 Correct 7 ms 28508 KB Output is correct
23 Correct 7 ms 28252 KB Output is correct
24 Correct 7 ms 28500 KB Output is correct
25 Correct 7 ms 28252 KB Output is correct
26 Correct 7 ms 28412 KB Output is correct
27 Correct 6 ms 28252 KB Output is correct
28 Correct 7 ms 28508 KB Output is correct
29 Correct 7 ms 28508 KB Output is correct
30 Correct 6 ms 28508 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 28248 KB Output is correct
2 Correct 7 ms 28252 KB Output is correct
3 Correct 7 ms 28376 KB Output is correct
4 Correct 7 ms 28396 KB Output is correct
5 Correct 7 ms 28252 KB Output is correct
6 Correct 6 ms 28252 KB Output is correct
7 Correct 7 ms 28252 KB Output is correct
8 Correct 6 ms 28252 KB Output is correct
9 Correct 6 ms 28252 KB Output is correct
10 Correct 6 ms 28252 KB Output is correct
11 Correct 6 ms 28248 KB Output is correct
12 Correct 6 ms 28504 KB Output is correct
13 Correct 6 ms 28252 KB Output is correct
14 Correct 6 ms 28256 KB Output is correct
15 Correct 6 ms 28376 KB Output is correct
16 Correct 6 ms 28364 KB Output is correct
17 Correct 6 ms 28264 KB Output is correct
18 Correct 6 ms 28260 KB Output is correct
19 Correct 6 ms 28256 KB Output is correct
20 Correct 6 ms 28256 KB Output is correct
21 Correct 7 ms 28512 KB Output is correct
22 Correct 6 ms 28260 KB Output is correct
23 Correct 7 ms 28264 KB Output is correct
24 Correct 7 ms 28376 KB Output is correct
25 Correct 7 ms 28520 KB Output is correct
26 Correct 6 ms 28264 KB Output is correct
27 Correct 7 ms 28388 KB Output is correct
28 Correct 8 ms 28512 KB Output is correct
29 Correct 7 ms 28512 KB Output is correct
30 Correct 7 ms 28512 KB Output is correct
31 Correct 7 ms 28516 KB Output is correct
32 Correct 6 ms 28508 KB Output is correct
33 Correct 6 ms 28504 KB Output is correct
34 Correct 7 ms 28508 KB Output is correct
35 Correct 6 ms 28504 KB Output is correct
36 Correct 7 ms 28504 KB Output is correct
37 Correct 7 ms 28508 KB Output is correct
38 Correct 7 ms 28508 KB Output is correct
39 Correct 7 ms 28508 KB Output is correct
40 Correct 7 ms 28252 KB Output is correct
41 Correct 7 ms 28500 KB Output is correct
42 Correct 7 ms 28252 KB Output is correct
43 Correct 7 ms 28412 KB Output is correct
44 Correct 6 ms 28252 KB Output is correct
45 Correct 7 ms 28508 KB Output is correct
46 Correct 7 ms 28508 KB Output is correct
47 Correct 6 ms 28508 KB Output is correct
48 Correct 50 ms 41296 KB Output is correct
49 Correct 51 ms 42164 KB Output is correct
50 Correct 51 ms 42100 KB Output is correct
51 Correct 42 ms 40040 KB Output is correct
52 Correct 51 ms 41860 KB Output is correct
53 Correct 46 ms 41160 KB Output is correct
54 Correct 30 ms 37780 KB Output is correct
55 Correct 60 ms 47548 KB Output is correct
56 Correct 69 ms 44920 KB Output is correct
57 Correct 58 ms 43776 KB Output is correct
58 Correct 65 ms 43040 KB Output is correct
59 Correct 51 ms 42168 KB Output is correct
60 Correct 42 ms 42212 KB Output is correct
61 Correct 44 ms 42308 KB Output is correct
62 Correct 48 ms 42348 KB Output is correct
63 Correct 44 ms 41960 KB Output is correct
64 Correct 51 ms 42560 KB Output is correct
65 Correct 46 ms 42444 KB Output is correct
66 Correct 43 ms 41720 KB Output is correct
67 Correct 34 ms 40064 KB Output is correct
68 Correct 41 ms 41256 KB Output is correct
69 Correct 47 ms 42684 KB Output is correct
70 Correct 42 ms 42112 KB Output is correct
71 Correct 37 ms 37792 KB Output is correct
72 Correct 37 ms 40536 KB Output is correct
73 Correct 50 ms 42684 KB Output is correct
74 Correct 42 ms 41720 KB Output is correct
75 Correct 52 ms 42496 KB Output is correct
76 Correct 49 ms 41908 KB Output is correct
77 Correct 48 ms 42216 KB Output is correct
78 Correct 35 ms 37424 KB Output is correct
79 Correct 39 ms 40300 KB Output is correct
80 Correct 53 ms 42468 KB Output is correct
81 Correct 47 ms 42476 KB Output is correct
82 Correct 45 ms 42176 KB Output is correct