oj.uz

Submission #497107

# Submission time Handle Problem Language Result Execution time Memory
497107 2021-12-22T12:14:00 Z Jarif_Rahman Unique Cities (JOI19_ho_t5) C++17
100 / 100
 1606 ms 201852 KB 
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;
const int k = 18;
const int inf = 1e8;

struct persistent_segtree{
    struct node{
        int sm;
        int l, r;
        node(){
            sm = 0LL;
            l = -1, r = -1;
        }
        node(int _sm){
            sm = _sm;
            l = -1, r = -1;
        }
        node(int _sm, int _l, int _r){
            l = _l, r = _r, sm = _sm;
        }
    };
    vector<node> v;
    int k;
    persistent_segtree(int n){
        k = 1;
        while(k <= n) k*=2; k*=2;
        v.resize(k, node(0));
        for(int i = 1; 2*i+1 < k; i++) v[i].l = 2*i, v[i].r = 2*i+1;
    }
    int upd(int nd, int a, int b, int in, int x){
        if(a == b){
            v.pb(node(x));
            return (int)v.size() - 1;
        }
        int md = (a+b)/2;
        if(in <= md){
            int rt = upd(v[nd].l, a, md, in, x);
            v.pb(node(v[v[nd].r].sm+v[rt].sm, rt, v[nd].r));
            return (int)v.size()-1;
        }
        else{
            int rt = upd(v[nd].r, md+1, b, in, x);
            v.pb(node(v[v[nd].l].sm+v[rt].sm, v[nd].l, rt));
            return (int)v.size()-1;
        }
    }
    int upd(int nd, int in, int x){
        return upd(nd, 0, k/2-1, in, x);
    }
    int sum(int l, int r, int nd, int a, int b){
        if(a > r || b < l){
            return 0;
        }
        if(a >= l && b <= r){
            return v[nd].sm;
        }
        int md = (a+b)/2;
        return sum(l, r, v[nd].l, a, md) + sum(l, r, v[nd].r, md+1, b);
    }
    int sum(int nd, int l, int r){
        return sum(l, r, nd, 0, k/2-1);
    }
};

int n, m;
vector<int> C;
vector<vector<int>> v;
vector<vector<pair<int, int>>> anc;
vector<int> cnt;
vector<int> pss;
vector<int> mxh;
vector<int> ans;

persistent_segtree ps(0);

pair<int, int> next(int nd, int h){
    if(h == 0) return {nd, 0};
    for(int i = k-1; i >= 0; i--){
        if(anc[nd][i].sc <= h){
            h-=anc[nd][i].sc;
            auto nxt = next(anc[nd][i].f, h);
            nxt.sc+=anc[nd][i].sc;
            return nxt;
        }
    }
    return {anc[nd][0].f, anc[nd][0].sc};
}

void dfs0(int nd, int ss){
    for(int x: v[nd]) if(x != ss) dfs0(x, nd);
    int mx = 0, smx = 0, in = n;
    for(int x: v[nd]) if(x != ss){
        if(mxh[x] > mx) smx = mx, mx = mxh[x], in = x;
        else if(mxh[x] > smx) smx = mxh[x];
    }
    mxh[nd] = mxh[in]+1;
    auto nxt = next(in, smx);
    nxt.sc++;
    nxt.sc = min(nxt.sc, inf);
    anc[nd][0] = nxt;
    for(int i = 1; i < k; i++){
        anc[nd][i].f = anc[anc[nd][i-1].f][i-1].f;
        anc[nd][i].sc = anc[nd][i-1].sc + anc[anc[nd][i-1].f][i-1].sc;
        anc[nd][i].sc = min(anc[nd][i].sc, inf);
    }
    cnt[nd] = cnt[nxt.f];
    pss[nd] = pss[nxt.f];
    if(ps.sum(pss[nd], C[nd], C[nd]) == 0){
        cnt[nd]++;
        pss[nd] = ps.upd(pss[nd], C[nd], 1);
    }
}

void dfs1(int nd, int ss){
    vector<pair<int, int>> sth;
    for(int x: v[nd]) sth.pb({mxh[x], x});
    sort(sth.rbegin(), sth.rend());
    while(sth.size() < 3) sth.pb({0, n});

    auto nxt = next(sth[0].sc, sth[1].f);
    ans[nd] = cnt[nxt.f];

    auto old_anc = anc[nd];
    int old_cnt = cnt[nd], old_mxh = mxh[nd];
    auto old_pss = pss[nd];
    for(int x: v[nd]) if(x != ss){
        pair<int, int> nxt;
        if(x == sth[0].sc) nxt = next(sth[1].sc, sth[2].f), mxh[nd] = mxh[sth[1].sc]+1;
        else if(x == sth[1].sc) nxt = next(sth[0].sc, sth[2].f), mxh[nd] = mxh[sth[0].sc]+1;
        else nxt = next(sth[0].sc, sth[1].f), mxh[nd] = mxh[sth[0].sc]+1;

        nxt.sc++;
        nxt.sc = min(nxt.sc, inf);

        anc[nd][0] = nxt;
        for(int i = 1; i < k; i++){
            anc[nd][i].f = anc[anc[nd][i-1].f][i-1].f;
            anc[nd][i].sc = anc[nd][i-1].sc + anc[anc[nd][i-1].f][i-1].sc;
            anc[nd][i].sc = min(anc[nd][i].sc, inf);
        }
        cnt[nd] = cnt[nxt.f];
        pss[nd] = pss[nxt.f];
        if(ps.sum(pss[nd], C[nd], C[nd]) == 0){
            cnt[nd]++;
            pss[nd] = ps.upd(pss[nd], C[nd], 1);
        }
        dfs1(x, nd);
    }
    anc[nd] = old_anc;
    cnt[nd] = old_cnt;
    mxh[nd] = old_mxh;
    pss[nd] = old_pss;
}


int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> m;
    C.resize(n);
    v.resize(n);
    anc.resize(n+1, vector<pair<int, int>>(k, {n, inf}));
    cnt.resize(n+1, 0);
    mxh.resize(n+1, 1);
    mxh[n] = 0;
    ans.resize(n);

    for(int i = 0; i < n-1; i++){
        int a, b; cin >> a >> b; a--, b--;
        v[a].pb(b);
        v[b].pb(a);
    }

    for(int &x: C) cin >> x, x--;

    ps = persistent_segtree(m);
    pss.resize(n+1, 1);

    dfs0(0, -1);
    dfs1(0, -1);

    for(int x: ans) cout << x << "\n";
}

Compilation message

joi2019_ho_t5.cpp: In constructor 'persistent_segtree::persistent_segtree(int)':
joi2019_ho_t5.cpp:31:9: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
   31 |         while(k <= n) k*=2; k*=2;
      |         ^~~~~
joi2019_ho_t5.cpp:31:29: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
   31 |         while(k <= n) k*=2; k*=2;
      |                             ^

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 4 ms 1640 KB Output is correct
3 Correct 2 ms 1072 KB Output is correct
4 Correct 6 ms 1356 KB Output is correct
5 Correct 3 ms 1136 KB Output is correct
6 Correct 4 ms 1228 KB Output is correct
7 Correct 4 ms 1048 KB Output is correct
8 Correct 3 ms 1252 KB Output is correct
9 Correct 3 ms 1424 KB Output is correct
10 Correct 4 ms 1100 KB Output is correct
11 Correct 3 ms 1144 KB Output is correct
12 Correct 3 ms 1192 KB Output is correct
13 Correct 3 ms 1228 KB Output is correct
14 Correct 3 ms 1100 KB Output is correct
15 Correct 3 ms 1228 KB Output is correct
16 Correct 4 ms 1192 KB Output is correct
17 Correct 3 ms 1484 KB Output is correct
18 Correct 3 ms 1096 KB Output is correct
19 Correct 5 ms 1784 KB Output is correct
20 Correct 4 ms 1800 KB Output is correct
21 Correct 4 ms 1800 KB Output is correct
22 Correct 4 ms 1736 KB Output is correct
23 Correct 4 ms 1800 KB Output is correct
24 Correct 4 ms 1784 KB Output is correct
25 Correct 5 ms 1772 KB Output is correct
26 Correct 4 ms 1760 KB Output is correct
27 Correct 6 ms 1800 KB Output is correct
28 Correct 5 ms 1772 KB Output is correct
29 Correct 5 ms 1792 KB Output is correct
30 Correct 4 ms 1684 KB Output is correct
31 Correct 4 ms 1436 KB Output is correct
32 Correct 4 ms 1788 KB Output is correct

Subtask #2
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 210 ms 33200 KB Output is correct
2 Correct 529 ms 71508 KB Output is correct
3 Correct 54 ms 12968 KB Output is correct
4 Correct 416 ms 55100 KB Output is correct
5 Correct 1101 ms 99272 KB Output is correct
6 Correct 737 ms 93636 KB Output is correct
7 Correct 422 ms 55924 KB Output is correct
8 Correct 415 ms 61332 KB Output is correct
9 Correct 412 ms 63540 KB Output is correct
10 Correct 439 ms 60536 KB Output is correct
11 Correct 361 ms 68392 KB Output is correct
12 Correct 786 ms 110180 KB Output is correct
13 Correct 658 ms 79240 KB Output is correct
14 Correct 679 ms 85092 KB Output is correct
15 Correct 337 ms 68516 KB Output is correct
16 Correct 755 ms 85852 KB Output is correct
17 Correct 753 ms 85224 KB Output is correct

Subtask #3
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 601 ms 139576 KB Output is correct
2 Correct 1593 ms 194684 KB Output is correct
3 Correct 120 ms 39868 KB Output is correct
4 Correct 739 ms 152692 KB Output is correct
5 Correct 1606 ms 201852 KB Output is correct
6 Correct 1323 ms 172808 KB Output is correct
7 Correct 741 ms 152720 KB Output is correct
8 Correct 837 ms 160748 KB Output is correct
9 Correct 813 ms 158088 KB Output is correct
10 Correct 761 ms 155580 KB Output is correct
11 Correct 696 ms 152816 KB Output is correct
12 Correct 1448 ms 189392 KB Output is correct
13 Correct 1056 ms 169772 KB Output is correct
14 Correct 1130 ms 180628 KB Output is correct
15 Correct 593 ms 154152 KB Output is correct
16 Correct 1255 ms 181376 KB Output is correct
17 Correct 1182 ms 173328 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 4 ms 1640 KB Output is correct
3 Correct 2 ms 1072 KB Output is correct
4 Correct 6 ms 1356 KB Output is correct
5 Correct 3 ms 1136 KB Output is correct
6 Correct 4 ms 1228 KB Output is correct
7 Correct 4 ms 1048 KB Output is correct
8 Correct 3 ms 1252 KB Output is correct
9 Correct 3 ms 1424 KB Output is correct
10 Correct 4 ms 1100 KB Output is correct
11 Correct 3 ms 1144 KB Output is correct
12 Correct 3 ms 1192 KB Output is correct
13 Correct 3 ms 1228 KB Output is correct
14 Correct 3 ms 1100 KB Output is correct
15 Correct 3 ms 1228 KB Output is correct
16 Correct 4 ms 1192 KB Output is correct
17 Correct 3 ms 1484 KB Output is correct
18 Correct 3 ms 1096 KB Output is correct
19 Correct 5 ms 1784 KB Output is correct
20 Correct 4 ms 1800 KB Output is correct
21 Correct 4 ms 1800 KB Output is correct
22 Correct 4 ms 1736 KB Output is correct
23 Correct 4 ms 1800 KB Output is correct
24 Correct 4 ms 1784 KB Output is correct
25 Correct 5 ms 1772 KB Output is correct
26 Correct 4 ms 1760 KB Output is correct
27 Correct 6 ms 1800 KB Output is correct
28 Correct 5 ms 1772 KB Output is correct
29 Correct 5 ms 1792 KB Output is correct
30 Correct 4 ms 1684 KB Output is correct
31 Correct 4 ms 1436 KB Output is correct
32 Correct 4 ms 1788 KB Output is correct
33 Correct 210 ms 33200 KB Output is correct
34 Correct 529 ms 71508 KB Output is correct
35 Correct 54 ms 12968 KB Output is correct
36 Correct 416 ms 55100 KB Output is correct
37 Correct 1101 ms 99272 KB Output is correct
38 Correct 737 ms 93636 KB Output is correct
39 Correct 422 ms 55924 KB Output is correct
40 Correct 415 ms 61332 KB Output is correct
41 Correct 412 ms 63540 KB Output is correct
42 Correct 439 ms 60536 KB Output is correct
43 Correct 361 ms 68392 KB Output is correct
44 Correct 786 ms 110180 KB Output is correct
45 Correct 658 ms 79240 KB Output is correct
46 Correct 679 ms 85092 KB Output is correct
47 Correct 337 ms 68516 KB Output is correct
48 Correct 755 ms 85852 KB Output is correct
49 Correct 753 ms 85224 KB Output is correct
50 Correct 601 ms 139576 KB Output is correct
51 Correct 1593 ms 194684 KB Output is correct
52 Correct 120 ms 39868 KB Output is correct
53 Correct 739 ms 152692 KB Output is correct
54 Correct 1606 ms 201852 KB Output is correct
55 Correct 1323 ms 172808 KB Output is correct
56 Correct 741 ms 152720 KB Output is correct
57 Correct 837 ms 160748 KB Output is correct
58 Correct 813 ms 158088 KB Output is correct
59 Correct 761 ms 155580 KB Output is correct
60 Correct 696 ms 152816 KB Output is correct
61 Correct 1448 ms 189392 KB Output is correct
62 Correct 1056 ms 169772 KB Output is correct
63 Correct 1130 ms 180628 KB Output is correct
64 Correct 593 ms 154152 KB Output is correct
65 Correct 1255 ms 181376 KB Output is correct
66 Correct 1182 ms 173328 KB Output is correct
67 Correct 78 ms 19884 KB Output is correct
68 Correct 463 ms 74852 KB Output is correct
69 Correct 519 ms 97292 KB Output is correct
70 Correct 446 ms 79124 KB Output is correct
71 Correct 1008 ms 112432 KB Output is correct
72 Correct 748 ms 93068 KB Output is correct
73 Correct 432 ms 79392 KB Output is correct
74 Correct 490 ms 76392 KB Output is correct
75 Correct 460 ms 70328 KB Output is correct
76 Correct 509 ms 82360 KB Output is correct
77 Correct 465 ms 81080 KB Output is correct
78 Correct 992 ms 94976 KB Output is correct
79 Correct 891 ms 110368 KB Output is correct
80 Correct 790 ms 101104 KB Output is correct
81 Correct 388 ms 82780 KB Output is correct
82 Correct 933 ms 120664 KB Output is correct
83 Correct 824 ms 90496 KB Output is correct
84 Correct 563 ms 103912 KB Output is correct
85 Correct 1260 ms 126436 KB Output is correct
86 Correct 904 ms 96992 KB Output is correct
87 Correct 583 ms 104204 KB Output is correct
88 Correct 580 ms 90340 KB Output is correct
89 Correct 589 ms 106416 KB Output is correct
90 Correct 546 ms 105800 KB Output is correct
91 Correct 483 ms 106100 KB Output is correct
92 Correct 1133 ms 124248 KB Output is correct
93 Correct 658 ms 104720 KB Output is correct
94 Correct 598 ms 89204 KB Output is correct
95 Correct 419 ms 107988 KB Output is correct
96 Correct 864 ms 110028 KB Output is correct
97 Correct 807 ms 93708 KB Output is correct
98 Correct 776 ms 153636 KB Output is correct
99 Correct 1188 ms 132788 KB Output is correct
100 Correct 1215 ms 170496 KB Output is correct
101 Correct 640 ms 154372 KB Output is correct
102 Correct 715 ms 157528 KB Output is correct
103 Correct 694 ms 156928 KB Output is correct
104 Correct 705 ms 156964 KB Output is correct
105 Correct 561 ms 155712 KB Output is correct
106 Correct 1135 ms 172968 KB Output is correct
107 Correct 910 ms 135556 KB Output is correct
108 Correct 994 ms 167828 KB Output is correct
109 Correct 578 ms 157940 KB Output is correct
110 Correct 1022 ms 123424 KB Output is correct
111 Correct 1177 ms 173036 KB Output is correct