oj.uz

답안 #873904

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
873904 2023-11-16T02:38:53 Z noiaint Village (BOI20_village) C++17
100 / 100
 80 ms 47544 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

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 28252 KB Output is correct
2 Correct 6 ms 28252 KB Output is correct
3 Correct 6 ms 28252 KB Output is correct
4 Correct 6 ms 28252 KB Output is correct
5 Correct 6 ms 28252 KB Output is correct
6 Correct 6 ms 28352 KB Output is correct
7 Correct 7 ms 28248 KB Output is correct
8 Correct 6 ms 28252 KB Output is correct
9 Correct 6 ms 28372 KB Output is correct
10 Correct 6 ms 28252 KB Output is correct
11 Correct 6 ms 28252 KB Output is correct
12 Correct 6 ms 28252 KB Output is correct
13 Correct 7 ms 28396 KB Output is correct
14 Correct 6 ms 28248 KB Output is correct
15 Correct 6 ms 28248 KB Output is correct
16 Correct 6 ms 28248 KB Output is correct
17 Correct 6 ms 28252 KB Output is correct

Subtask #2
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 28248 KB Output is correct
2 Correct 6 ms 28252 KB Output is correct
3 Correct 6 ms 28504 KB Output is correct
4 Correct 6 ms 28508 KB Output is correct
5 Correct 6 ms 28252 KB Output is correct
6 Correct 6 ms 28252 KB Output is correct
7 Correct 8 ms 28404 KB Output is correct
8 Correct 6 ms 28404 KB Output is correct
9 Correct 6 ms 28252 KB Output is correct
10 Correct 6 ms 28508 KB Output is correct
11 Correct 6 ms 28484 KB Output is correct
12 Correct 6 ms 28252 KB Output is correct
13 Correct 6 ms 28252 KB Output is correct
14 Correct 6 ms 28504 KB Output is correct
15 Correct 6 ms 28508 KB Output is correct
16 Correct 6 ms 28372 KB Output is correct
17 Correct 6 ms 28508 KB Output is correct
18 Correct 6 ms 28420 KB Output is correct
19 Correct 6 ms 28508 KB Output is correct
20 Correct 6 ms 28504 KB Output is correct
21 Correct 6 ms 28508 KB Output is correct
22 Correct 6 ms 28508 KB Output is correct
23 Correct 6 ms 28252 KB Output is correct
24 Correct 6 ms 28248 KB Output is correct
25 Correct 6 ms 28248 KB Output is correct
26 Correct 6 ms 28508 KB Output is correct
27 Correct 6 ms 28252 KB Output is correct
28 Correct 7 ms 28508 KB Output is correct
29 Correct 6 ms 28704 KB Output is correct
30 Correct 6 ms 28508 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 28252 KB Output is correct
2 Correct 6 ms 28252 KB Output is correct
3 Correct 6 ms 28252 KB Output is correct
4 Correct 6 ms 28252 KB Output is correct
5 Correct 6 ms 28252 KB Output is correct
6 Correct 6 ms 28352 KB Output is correct
7 Correct 7 ms 28248 KB Output is correct
8 Correct 6 ms 28252 KB Output is correct
9 Correct 6 ms 28372 KB Output is correct
10 Correct 6 ms 28252 KB Output is correct
11 Correct 6 ms 28252 KB Output is correct
12 Correct 6 ms 28252 KB Output is correct
13 Correct 7 ms 28396 KB Output is correct
14 Correct 6 ms 28248 KB Output is correct
15 Correct 6 ms 28248 KB Output is correct
16 Correct 6 ms 28248 KB Output is correct
17 Correct 6 ms 28252 KB Output is correct
18 Correct 6 ms 28248 KB Output is correct
19 Correct 6 ms 28252 KB Output is correct
20 Correct 6 ms 28504 KB Output is correct
21 Correct 6 ms 28508 KB Output is correct
22 Correct 6 ms 28252 KB Output is correct
23 Correct 6 ms 28252 KB Output is correct
24 Correct 8 ms 28404 KB Output is correct
25 Correct 6 ms 28404 KB Output is correct
26 Correct 6 ms 28252 KB Output is correct
27 Correct 6 ms 28508 KB Output is correct
28 Correct 6 ms 28484 KB Output is correct
29 Correct 6 ms 28252 KB Output is correct
30 Correct 6 ms 28252 KB Output is correct
31 Correct 6 ms 28504 KB Output is correct
32 Correct 6 ms 28508 KB Output is correct
33 Correct 6 ms 28372 KB Output is correct
34 Correct 6 ms 28508 KB Output is correct
35 Correct 6 ms 28420 KB Output is correct
36 Correct 6 ms 28508 KB Output is correct
37 Correct 6 ms 28504 KB Output is correct
38 Correct 6 ms 28508 KB Output is correct
39 Correct 6 ms 28508 KB Output is correct
40 Correct 6 ms 28252 KB Output is correct
41 Correct 6 ms 28248 KB Output is correct
42 Correct 6 ms 28248 KB Output is correct
43 Correct 6 ms 28508 KB Output is correct
44 Correct 6 ms 28252 KB Output is correct
45 Correct 7 ms 28508 KB Output is correct
46 Correct 6 ms 28704 KB Output is correct
47 Correct 6 ms 28508 KB Output is correct
48 Correct 47 ms 41224 KB Output is correct
49 Correct 56 ms 42112 KB Output is correct
50 Correct 57 ms 42336 KB Output is correct
51 Correct 42 ms 40300 KB Output is correct
52 Correct 55 ms 41928 KB Output is correct
53 Correct 64 ms 41100 KB Output is correct
54 Correct 30 ms 37712 KB Output is correct
55 Correct 66 ms 47544 KB Output is correct
56 Correct 74 ms 44712 KB Output is correct
57 Correct 80 ms 43876 KB Output is correct
58 Correct 64 ms 42928 KB Output is correct
59 Correct 70 ms 42140 KB Output is correct
60 Correct 50 ms 42156 KB Output is correct
61 Correct 49 ms 42280 KB Output is correct
62 Correct 52 ms 42280 KB Output is correct
63 Correct 66 ms 41956 KB Output is correct
64 Correct 69 ms 42332 KB Output is correct
65 Correct 50 ms 42416 KB Output is correct
66 Correct 51 ms 41768 KB Output is correct
67 Correct 35 ms 40068 KB Output is correct
68 Correct 45 ms 41124 KB Output is correct
69 Correct 56 ms 42672 KB Output is correct
70 Correct 48 ms 42092 KB Output is correct
71 Correct 42 ms 37724 KB Output is correct
72 Correct 48 ms 40704 KB Output is correct
73 Correct 52 ms 42524 KB Output is correct
74 Correct 43 ms 41724 KB Output is correct
75 Correct 66 ms 42460 KB Output is correct
76 Correct 63 ms 41820 KB Output is correct
77 Correct 56 ms 42428 KB Output is correct
78 Correct 36 ms 37316 KB Output is correct
79 Correct 42 ms 40384 KB Output is correct
80 Correct 62 ms 42416 KB Output is correct
81 Correct 50 ms 42328 KB Output is correct
82 Correct 55 ms 42240 KB Output is correct