oj.uz

답안 #896169

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
896169 2023-12-31T23:54:15 Z ShaShi Village (BOI20_village) C++17
50 / 100
 58 ms 17856 KB 
#include <bits/stdc++.h>
// #define int long long 
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define kill(x) cout << x << endl, exit(0);
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
 
 
using namespace std;
typedef long long ll;
typedef long double ld;
 
 
const int MAXN = (int)1e5 + 7;
const int MOD = 998244353;
const int INF = (int)1e9 + 7;
 
 
 
int n, m, t, flag, k, u, v, w, ans, ans2, tmp, tmp2, tmp3, tmp4;
int arr[MAXN], arr2[MAXN], par[MAXN], h[MAXN], sz[MAXN], cent;
int arr3[MAXN], arr4[MAXN];
vector<int> adj[MAXN];

bool DFS(int v, int p=-1) {
    bool res = 0;

    for (int u:adj[v]) {
        if (u != p) res |= DFS(u, v);
    }

    if (res) return 0;

    if (v != 1) {
        swap(arr[v], arr[p]);
        ans++;
        return 1;
    }

    swap(arr[1], arr[adj[1][0]]);
    ans++;
    return 0;
}


void DFSsz(int v, int p=-1) {
    sz[v] = 1;

    for (int u:adj[v]) {
        if (u == p) continue;
        DFSsz(u, v);
        sz[v] += sz[u];
    }
}


int centroid(int tot, int v, int p=-1) {
    for (int u:adj[v]) {
        if (u != p && 2*sz[u] > tot) {
            return centroid(tot, u, v);
        }
    }

    return v;
}



vector<int> vec;
vector<pii> love;
pii tof;

void DFS2(int v, int p=-1) {
    vec.pb(v);
    
    for (int u:adj[v]) {
        if (u == p || u == cent) continue;
        DFS2(u, v);
    }
}


void solve() {
    vec.pb(cent);

    for (auto u:adj[cent]) {
        DFS2(u);
    }

    // cout << "$" << vec.size() << endl;

    for (int i=1; i<=n; i++) {
        // cout << "!" << i << " " << ((i-1+n/2)%n) << " " << vec[(i-1+n/2)%n] << endl;

        arr3[i] = vec[(i-1+n/2)%n];
    }
}


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

    tof.F = -1;
 
    cin >> n;

    for (int i=1; i<n; i++) {
        cin >> u >> v;

        adj[u].pb(v);
        adj[v].pb(u);
    }

    // Min 
    for (int i=1; i<=n; i++) arr[i] = i;
    DFS(1);
    for (int i=1; i<=n; i++) arr2[arr[i]] = i;

    // Max
    DFSsz(1);
    cent = centroid(n, 1);
    DFSsz(cent);
    for (int i=1; i<=n; i++) arr3[i] = i;
    solve();

    // cout << "!" << cent << endl;

    for (int i=1; i<=n; i++) if (i != cent) ans2 += sz[i];
    for (int i=1; i<=n; i++) arr4[arr3[i]] = i;

    cout << 2*ans << " " << 2*ans2 << endl;

    for (int i=1; i<=n; i++) cout << arr2[i] << " ";
    cout << endl;

    for (int i=1; i<=n; i++) cout << arr4[i] << " ";
    cout << endl;

 
    return 0;
}

Subtask #1
6.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4700 KB Output is correct
2 Partially correct 1 ms 4700 KB Partially correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Partially correct 1 ms 4700 KB Partially correct
6 Partially correct 1 ms 4700 KB Partially correct
7 Partially correct 2 ms 4700 KB Partially correct
8 Partially correct 1 ms 4700 KB Partially correct
9 Partially correct 1 ms 4700 KB Partially correct
10 Partially correct 1 ms 4700 KB Partially correct
11 Partially correct 1 ms 4700 KB Partially correct
12 Partially correct 1 ms 4700 KB Partially correct
13 Partially correct 1 ms 4696 KB Partially correct
14 Partially correct 1 ms 4700 KB Partially correct
15 Correct 1 ms 4716 KB Output is correct
16 Partially correct 1 ms 4700 KB Partially correct
17 Partially correct 1 ms 4700 KB Partially correct

Subtask #2
19.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 4700 KB Partially correct
2 Partially correct 1 ms 4700 KB Partially correct
3 Partially correct 1 ms 4696 KB Partially correct
4 Partially correct 1 ms 4700 KB Partially correct
5 Partially correct 1 ms 4700 KB Partially correct
6 Partially correct 1 ms 4708 KB Partially correct
7 Partially correct 2 ms 4700 KB Partially correct
8 Partially correct 1 ms 4700 KB Partially correct
9 Partially correct 2 ms 4700 KB Partially correct
10 Partially correct 1 ms 4700 KB Partially correct
11 Partially correct 1 ms 4700 KB Partially correct
12 Partially correct 1 ms 4696 KB Partially correct
13 Partially correct 1 ms 4700 KB Partially correct
14 Partially correct 1 ms 4700 KB Partially correct
15 Partially correct 2 ms 4700 KB Partially correct
16 Partially correct 1 ms 4700 KB Partially correct
17 Partially correct 1 ms 4700 KB Partially correct
18 Partially correct 1 ms 4700 KB Partially correct
19 Partially correct 1 ms 4696 KB Partially correct
20 Partially correct 1 ms 4700 KB Partially correct
21 Partially correct 1 ms 4700 KB Partially correct
22 Partially correct 1 ms 4700 KB Partially correct
23 Partially correct 1 ms 4700 KB Partially correct
24 Partially correct 1 ms 4700 KB Partially correct
25 Partially correct 1 ms 4896 KB Partially correct
26 Partially correct 1 ms 4696 KB Partially correct
27 Partially correct 1 ms 4700 KB Partially correct
28 Partially correct 1 ms 4700 KB Partially correct
29 Partially correct 1 ms 4700 KB Partially correct
30 Partially correct 1 ms 4700 KB Partially correct

Subtask #3
25.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4700 KB Output is correct
2 Partially correct 1 ms 4700 KB Partially correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Partially correct 1 ms 4700 KB Partially correct
6 Partially correct 1 ms 4700 KB Partially correct
7 Partially correct 2 ms 4700 KB Partially correct
8 Partially correct 1 ms 4700 KB Partially correct
9 Partially correct 1 ms 4700 KB Partially correct
10 Partially correct 1 ms 4700 KB Partially correct
11 Partially correct 1 ms 4700 KB Partially correct
12 Partially correct 1 ms 4700 KB Partially correct
13 Partially correct 1 ms 4696 KB Partially correct
14 Partially correct 1 ms 4700 KB Partially correct
15 Correct 1 ms 4716 KB Output is correct
16 Partially correct 1 ms 4700 KB Partially correct
17 Partially correct 1 ms 4700 KB Partially correct
18 Partially correct 1 ms 4700 KB Partially correct
19 Partially correct 1 ms 4700 KB Partially correct
20 Partially correct 1 ms 4696 KB Partially correct
21 Partially correct 1 ms 4700 KB Partially correct
22 Partially correct 1 ms 4700 KB Partially correct
23 Partially correct 1 ms 4708 KB Partially correct
24 Partially correct 2 ms 4700 KB Partially correct
25 Partially correct 1 ms 4700 KB Partially correct
26 Partially correct 2 ms 4700 KB Partially correct
27 Partially correct 1 ms 4700 KB Partially correct
28 Partially correct 1 ms 4700 KB Partially correct
29 Partially correct 1 ms 4696 KB Partially correct
30 Partially correct 1 ms 4700 KB Partially correct
31 Partially correct 1 ms 4700 KB Partially correct
32 Partially correct 2 ms 4700 KB Partially correct
33 Partially correct 1 ms 4700 KB Partially correct
34 Partially correct 1 ms 4700 KB Partially correct
35 Partially correct 1 ms 4700 KB Partially correct
36 Partially correct 1 ms 4696 KB Partially correct
37 Partially correct 1 ms 4700 KB Partially correct
38 Partially correct 1 ms 4700 KB Partially correct
39 Partially correct 1 ms 4700 KB Partially correct
40 Partially correct 1 ms 4700 KB Partially correct
41 Partially correct 1 ms 4700 KB Partially correct
42 Partially correct 1 ms 4896 KB Partially correct
43 Partially correct 1 ms 4696 KB Partially correct
44 Partially correct 1 ms 4700 KB Partially correct
45 Partially correct 1 ms 4700 KB Partially correct
46 Partially correct 1 ms 4700 KB Partially correct
47 Partially correct 1 ms 4700 KB Partially correct
48 Partially correct 41 ms 10020 KB Partially correct
49 Partially correct 50 ms 10452 KB Partially correct
50 Partially correct 46 ms 10436 KB Partially correct
51 Partially correct 34 ms 9160 KB Partially correct
52 Partially correct 44 ms 10188 KB Partially correct
53 Partially correct 39 ms 9680 KB Partially correct
54 Partially correct 26 ms 10972 KB Partially correct
55 Partially correct 58 ms 17856 KB Partially correct
56 Partially correct 52 ms 13772 KB Partially correct
57 Partially correct 56 ms 12736 KB Partially correct
58 Partially correct 48 ms 11468 KB Partially correct
59 Partially correct 57 ms 10536 KB Partially correct
60 Correct 34 ms 10776 KB Output is correct
61 Partially correct 35 ms 10696 KB Partially correct
62 Partially correct 36 ms 10700 KB Partially correct
63 Partially correct 38 ms 10716 KB Partially correct
64 Partially correct 38 ms 10708 KB Partially correct
65 Partially correct 37 ms 10792 KB Partially correct
66 Partially correct 33 ms 10456 KB Partially correct
67 Partially correct 29 ms 9164 KB Partially correct
68 Partially correct 33 ms 9928 KB Partially correct
69 Partially correct 35 ms 10724 KB Partially correct
70 Partially correct 32 ms 10448 KB Partially correct
71 Partially correct 25 ms 8920 KB Partially correct
72 Partially correct 31 ms 9424 KB Partially correct
73 Partially correct 35 ms 10964 KB Partially correct
74 Partially correct 33 ms 10300 KB Partially correct
75 Partially correct 42 ms 10196 KB Partially correct
76 Partially correct 40 ms 10184 KB Partially correct
77 Partially correct 36 ms 10448 KB Partially correct
78 Partially correct 25 ms 8588 KB Partially correct
79 Partially correct 30 ms 9160 KB Partially correct
80 Partially correct 41 ms 10188 KB Partially correct
81 Partially correct 37 ms 10708 KB Partially correct
82 Partially correct 41 ms 10688 KB Partially correct