oj.uz

Submission #896152

# Submission time Handle Problem Language Result Execution time Memory
896152 2023-12-31T23:14:30 Z ShaShi Village (BOI20_village) C++17
50 / 100
 55 ms 17744 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, vec2;
vector<pii> love;

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


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

    for (int u:adj[cent]) {
        love.pb(mp(sz[u], u));
    }
    
    sort(all(love), greater<pii>());

    for (auto cur:love) {
        u = cur.S;
        // vec2.clear();
        DFS2(u);

        while (vec.size() && vec2.size()) {
            swap(arr3[vec.back()], arr3[vec2.back()]);
            vec2.pop_back();
            vec.pop_back();
        }

        while (vec2.size()) {
            vec.pb(vec2.back());
            vec2.pop_back();
        }
    }
}


int32_t main() {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 
    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];

    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 << arr3[i] << " ";
    cout << endl;

 
    return 0;
}

Subtask #1
6.0 / 12.0

# Verdict Execution time Memory 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 Partially correct 1 ms 4700 KB Partially correct
5 Partially correct 1 ms 4700 KB Partially correct
6 Partially correct 1 ms 4700 KB Partially correct
7 Partially correct 1 ms 4700 KB Partially correct
8 Correct 1 ms 4852 KB Output is correct
9 Partially correct 1 ms 4700 KB Partially correct
10 Correct 1 ms 4696 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 1 ms 4700 KB Output is correct
13 Correct 1 ms 4700 KB Output is correct
14 Correct 1 ms 4700 KB Output is correct
15 Correct 1 ms 4700 KB Output is correct
16 Correct 1 ms 4952 KB Output is correct
17 Partially correct 1 ms 4700 KB Partially correct

Subtask #2
19.0 / 38.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 4700 KB Partially correct
2 Correct 1 ms 4700 KB Output is correct
3 Partially correct 1 ms 4700 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 4700 KB Partially correct
7 Correct 2 ms 4700 KB Output is correct
8 Partially correct 1 ms 4696 KB Partially correct
9 Partially correct 1 ms 4700 KB Partially correct
10 Correct 1 ms 4700 KB Output is correct
11 Partially correct 1 ms 4696 KB Partially correct
12 Correct 1 ms 4700 KB Output is correct
13 Partially correct 1 ms 4700 KB Partially correct
14 Partially correct 1 ms 4700 KB Partially correct
15 Correct 1 ms 4700 KB Output is correct
16 Correct 2 ms 4700 KB Output is correct
17 Partially correct 2 ms 4700 KB Partially correct
18 Partially correct 1 ms 4700 KB Partially correct
19 Correct 1 ms 4700 KB Output is correct
20 Correct 1 ms 4700 KB Output is correct
21 Correct 1 ms 4700 KB Output is 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 Correct 1 ms 4700 KB Output is correct
26 Partially correct 1 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 2 ms 4700 KB Partially correct
30 Correct 1 ms 4700 KB Output is correct

Subtask #3
25.0 / 50.0

# Verdict Execution time Memory 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 Partially correct 1 ms 4700 KB Partially correct
5 Partially correct 1 ms 4700 KB Partially correct
6 Partially correct 1 ms 4700 KB Partially correct
7 Partially correct 1 ms 4700 KB Partially correct
8 Correct 1 ms 4852 KB Output is correct
9 Partially correct 1 ms 4700 KB Partially correct
10 Correct 1 ms 4696 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 1 ms 4700 KB Output is correct
13 Correct 1 ms 4700 KB Output is correct
14 Correct 1 ms 4700 KB Output is correct
15 Correct 1 ms 4700 KB Output is correct
16 Correct 1 ms 4952 KB Output is correct
17 Partially correct 1 ms 4700 KB Partially correct
18 Partially correct 1 ms 4700 KB Partially correct
19 Correct 1 ms 4700 KB Output is 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 Correct 2 ms 4700 KB Output is correct
25 Partially correct 1 ms 4696 KB Partially correct
26 Partially correct 1 ms 4700 KB Partially correct
27 Correct 1 ms 4700 KB Output is correct
28 Partially correct 1 ms 4696 KB Partially correct
29 Correct 1 ms 4700 KB Output is correct
30 Partially correct 1 ms 4700 KB Partially correct
31 Partially correct 1 ms 4700 KB Partially correct
32 Correct 1 ms 4700 KB Output is correct
33 Correct 2 ms 4700 KB Output is correct
34 Partially correct 2 ms 4700 KB Partially correct
35 Partially correct 1 ms 4700 KB Partially correct
36 Correct 1 ms 4700 KB Output is correct
37 Correct 1 ms 4700 KB Output is correct
38 Correct 1 ms 4700 KB Output is 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 Correct 1 ms 4700 KB Output is correct
43 Partially correct 1 ms 4700 KB Partially correct
44 Partially correct 1 ms 4700 KB Partially correct
45 Partially correct 1 ms 4700 KB Partially correct
46 Partially correct 2 ms 4700 KB Partially correct
47 Correct 1 ms 4700 KB Output is correct
48 Partially correct 39 ms 9808 KB Partially correct
49 Partially correct 47 ms 10324 KB Partially correct
50 Correct 43 ms 10312 KB Output is correct
51 Partially correct 34 ms 9044 KB Partially correct
52 Partially correct 42 ms 10064 KB Partially correct
53 Partially correct 38 ms 9808 KB Partially correct
54 Correct 25 ms 11096 KB Output is correct
55 Partially correct 55 ms 17744 KB Partially correct
56 Partially correct 55 ms 13912 KB Partially correct
57 Partially correct 48 ms 12628 KB Partially correct
58 Partially correct 48 ms 11396 KB Partially correct
59 Partially correct 42 ms 10324 KB Partially correct
60 Correct 42 ms 11080 KB Output is correct
61 Correct 35 ms 10704 KB Output is correct
62 Correct 41 ms 10648 KB Output is correct
63 Partially correct 36 ms 10672 KB Partially correct
64 Correct 37 ms 10324 KB Output is correct
65 Correct 35 ms 10840 KB Output is correct
66 Partially correct 33 ms 10324 KB Partially correct
67 Correct 26 ms 9328 KB Output is correct
68 Partially correct 29 ms 9564 KB Partially correct
69 Correct 35 ms 10836 KB Output is correct
70 Correct 40 ms 10320 KB Output is correct
71 Correct 28 ms 8784 KB Output is correct
72 Partially correct 29 ms 9300 KB Partially correct
73 Partially correct 35 ms 10840 KB Partially correct
74 Partially correct 32 ms 10252 KB Partially correct
75 Partially correct 42 ms 10128 KB Partially correct
76 Partially correct 44 ms 10320 KB Partially correct
77 Partially correct 36 ms 10360 KB Partially correct
78 Partially correct 26 ms 8532 KB Partially correct
79 Partially correct 29 ms 9200 KB Partially correct
80 Partially correct 42 ms 10064 KB Partially correct
81 Partially correct 37 ms 10320 KB Partially correct
82 Partially correct 34 ms 10232 KB Partially correct