oj.uz

Submission #955126

# Submission time Handle Problem Language Result Execution time Memory
955126 2024-03-29T12:28:27 Z GrindMachine Village (BOI20_village) C++17
50 / 100
 57 ms 17228 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

vector<ll> adj[N];
vector<ll> subsiz(N);

void dfs1(ll u, ll p){
    subsiz[u] = 1;
    trav(v,adj[u]){
        if(v == p) conts;
        dfs1(v,u);
        subsiz[u] += subsiz[v];
    }
}

ll dfs2(ll u, ll p){
    trav(v,adj[u]){
        if(v == p) conts;
        if(subsiz[v] > subsiz[1]/2){
            return dfs2(v,u);
        }
    }

    return u;
}

vector<ll> here[N];
ll cost2 = 0;

void dfs3(ll u, ll p, ll r, ll d){
    here[r].pb(u);
    cost2 += d;
    trav(v,adj[u]){
        if(v == p) conts;
        dfs3(v,u,r,d+1);
    }
}

void solve(int test_case)
{
    ll n; cin >> n;
    rep1(i,n-1){
        ll u,v; cin >> u >> v;
        adj[u].pb(v), adj[v].pb(u);
    }

    dfs1(1,-1);
    ll c = dfs2(1,-1);

    trav(v,adj[c]){
        dfs3(v,c,v,1);
    }

    cost2 *= 2;

    priority_queue<pll> pq;
    trav(v,adj[c]){
        pq.push({sz(here[v]),v});
    }

    vector<ll> ans2(n+5,-1);

    rep1(iter,(n-2)/2){
        auto [s1,v1] = pq.top();
        pq.pop();
        auto [s2,v2] = pq.top();
        pq.pop();

        ll x = here[v1].back();
        ll y = here[v2].back();
        here[v1].pop_back();
        here[v2].pop_back();

        ans2[x] = y, ans2[y] = x;
        pq.push({s1-1,v1});
        pq.push({s2-1,v2});
    }

    vector<ll> remain;
    rep1(i,n){
        if(ans2[i] == -1){
            remain.pb(i);
        }
    }

    rep(i,sz(remain)){
        ans2[remain[i]] = remain[(i+1)%sz(remain)];
    }

    cout << 0 << " " << cost2 << endl;
    rep1(i,n) cout << 1 << " ";
    cout << endl;
    rep1(i,n) cout << ans2[i] << " ";
    cout << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
6.0 / 12.0

# Verdict Execution time Memory Grader output
1 Partially correct 2 ms 5724 KB Partially correct
2 Partially correct 2 ms 5724 KB Partially correct
3 Partially correct 2 ms 5724 KB Partially correct
4 Partially correct 2 ms 5724 KB Partially correct
5 Partially correct 2 ms 5724 KB Partially correct
6 Partially correct 2 ms 5724 KB Partially correct
7 Partially correct 2 ms 5976 KB Partially correct
8 Partially correct 2 ms 5724 KB Partially correct
9 Partially correct 2 ms 5724 KB Partially correct
10 Partially correct 3 ms 5724 KB Partially correct
11 Partially correct 2 ms 5724 KB Partially correct
12 Partially correct 2 ms 5724 KB Partially correct
13 Partially correct 2 ms 5724 KB Partially correct
14 Partially correct 2 ms 5724 KB Partially correct
15 Partially correct 2 ms 5724 KB Partially correct
16 Partially correct 2 ms 5724 KB Partially correct
17 Partially correct 2 ms 5720 KB Partially correct

Subtask #2
19.0 / 38.0

# Verdict Execution time Memory Grader output
1 Partially correct 2 ms 5724 KB Partially correct
2 Partially correct 2 ms 5980 KB Partially correct
3 Partially correct 2 ms 6232 KB Partially correct
4 Partially correct 2 ms 5980 KB Partially correct
5 Partially correct 2 ms 5980 KB Partially correct
6 Partially correct 2 ms 5980 KB Partially correct
7 Partially correct 3 ms 5964 KB Partially correct
8 Partially correct 2 ms 5980 KB Partially correct
9 Partially correct 2 ms 5980 KB Partially correct
10 Partially correct 2 ms 5976 KB Partially correct
11 Partially correct 2 ms 5980 KB Partially correct
12 Partially correct 2 ms 5980 KB Partially correct
13 Partially correct 2 ms 5980 KB Partially correct
14 Partially correct 2 ms 5980 KB Partially correct
15 Partially correct 2 ms 5980 KB Partially correct
16 Partially correct 2 ms 5980 KB Partially correct
17 Partially correct 2 ms 5980 KB Partially correct
18 Partially correct 2 ms 6164 KB Partially correct
19 Partially correct 3 ms 5976 KB Partially correct
20 Partially correct 2 ms 5980 KB Partially correct
21 Partially correct 2 ms 5980 KB Partially correct
22 Partially correct 2 ms 5980 KB Partially correct
23 Partially correct 2 ms 5980 KB Partially correct
24 Partially correct 2 ms 5980 KB Partially correct
25 Partially correct 2 ms 5976 KB Partially correct
26 Partially correct 2 ms 5980 KB Partially correct
27 Partially correct 2 ms 5952 KB Partially correct
28 Partially correct 2 ms 5980 KB Partially correct
29 Partially correct 2 ms 5980 KB Partially correct
30 Partially correct 2 ms 5952 KB Partially correct

Subtask #3
25.0 / 50.0

# Verdict Execution time Memory Grader output
1 Partially correct 2 ms 5724 KB Partially correct
2 Partially correct 2 ms 5724 KB Partially correct
3 Partially correct 2 ms 5724 KB Partially correct
4 Partially correct 2 ms 5724 KB Partially correct
5 Partially correct 2 ms 5724 KB Partially correct
6 Partially correct 2 ms 5724 KB Partially correct
7 Partially correct 2 ms 5976 KB Partially correct
8 Partially correct 2 ms 5724 KB Partially correct
9 Partially correct 2 ms 5724 KB Partially correct
10 Partially correct 3 ms 5724 KB Partially correct
11 Partially correct 2 ms 5724 KB Partially correct
12 Partially correct 2 ms 5724 KB Partially correct
13 Partially correct 2 ms 5724 KB Partially correct
14 Partially correct 2 ms 5724 KB Partially correct
15 Partially correct 2 ms 5724 KB Partially correct
16 Partially correct 2 ms 5724 KB Partially correct
17 Partially correct 2 ms 5720 KB Partially correct
18 Partially correct 2 ms 5724 KB Partially correct
19 Partially correct 2 ms 5980 KB Partially correct
20 Partially correct 2 ms 6232 KB Partially correct
21 Partially correct 2 ms 5980 KB Partially correct
22 Partially correct 2 ms 5980 KB Partially correct
23 Partially correct 2 ms 5980 KB Partially correct
24 Partially correct 3 ms 5964 KB Partially correct
25 Partially correct 2 ms 5980 KB Partially correct
26 Partially correct 2 ms 5980 KB Partially correct
27 Partially correct 2 ms 5976 KB Partially correct
28 Partially correct 2 ms 5980 KB Partially correct
29 Partially correct 2 ms 5980 KB Partially correct
30 Partially correct 2 ms 5980 KB Partially correct
31 Partially correct 2 ms 5980 KB Partially correct
32 Partially correct 2 ms 5980 KB Partially correct
33 Partially correct 2 ms 5980 KB Partially correct
34 Partially correct 2 ms 5980 KB Partially correct
35 Partially correct 2 ms 6164 KB Partially correct
36 Partially correct 3 ms 5976 KB Partially correct
37 Partially correct 2 ms 5980 KB Partially correct
38 Partially correct 2 ms 5980 KB Partially correct
39 Partially correct 2 ms 5980 KB Partially correct
40 Partially correct 2 ms 5980 KB Partially correct
41 Partially correct 2 ms 5980 KB Partially correct
42 Partially correct 2 ms 5976 KB Partially correct
43 Partially correct 2 ms 5980 KB Partially correct
44 Partially correct 2 ms 5952 KB Partially correct
45 Partially correct 2 ms 5980 KB Partially correct
46 Partially correct 2 ms 5980 KB Partially correct
47 Partially correct 2 ms 5952 KB Partially correct
48 Partially correct 43 ms 12796 KB Partially correct
49 Partially correct 48 ms 13328 KB Partially correct
50 Partially correct 45 ms 13448 KB Partially correct
51 Partially correct 34 ms 12008 KB Partially correct
52 Partially correct 43 ms 13260 KB Partially correct
53 Partially correct 49 ms 12524 KB Partially correct
54 Partially correct 25 ms 11340 KB Partially correct
55 Partially correct 51 ms 17228 KB Partially correct
56 Partially correct 50 ms 15252 KB Partially correct
57 Partially correct 47 ms 14552 KB Partially correct
58 Partially correct 48 ms 13896 KB Partially correct
59 Partially correct 44 ms 13280 KB Partially correct
60 Partially correct 57 ms 16952 KB Partially correct
61 Partially correct 44 ms 14276 KB Partially correct
62 Partially correct 40 ms 13404 KB Partially correct
63 Partially correct 38 ms 13240 KB Partially correct
64 Partially correct 44 ms 13752 KB Partially correct
65 Partially correct 39 ms 13704 KB Partially correct
66 Partially correct 38 ms 13128 KB Partially correct
67 Partially correct 32 ms 12000 KB Partially correct
68 Partially correct 32 ms 12624 KB Partially correct
69 Partially correct 42 ms 13784 KB Partially correct
70 Partially correct 36 ms 13520 KB Partially correct
71 Partially correct 27 ms 11472 KB Partially correct
72 Partially correct 30 ms 11980 KB Partially correct
73 Partially correct 40 ms 13976 KB Partially correct
74 Partially correct 36 ms 13164 KB Partially correct
75 Partially correct 42 ms 13768 KB Partially correct
76 Partially correct 40 ms 13332 KB Partially correct
77 Partially correct 40 ms 13512 KB Partially correct
78 Partially correct 27 ms 10956 KB Partially correct
79 Partially correct 31 ms 11832 KB Partially correct
80 Partially correct 46 ms 13816 KB Partially correct
81 Partially correct 46 ms 13908 KB Partially correct
82 Partially correct 37 ms 13396 KB Partially correct