oj.uz

Submission #497593

# Submission time Handle Problem Language Result Execution time Memory
497593 2021-12-23T10:25:00 Z Jarif_Rahman Unique Cities (JOI19_ho_t5) C++17
100 / 100
 1761 ms 199244 KB 
#include <bits/stdc++.h>

#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")

#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);

inline 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};
}

inline 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);
    }
}

inline 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:4: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    4 | #pragma GCC optimization ("O3")
      | 
joi2019_ho_t5.cpp:5: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    5 | #pragma GCC optimization ("unroll-loops")
      | 
joi2019_ho_t5.cpp: In constructor 'persistent_segtree::persistent_segtree(int)':
joi2019_ho_t5.cpp:36:9: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
   36 |         while(k <= n) k*=2; k*=2;
      |         ^~~~~
joi2019_ho_t5.cpp:36:29: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
   36 |         while(k <= n) k*=2; k*=2;
      |                             ^

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 5 ms 1636 KB Output is correct
3 Correct 2 ms 1068 KB Output is correct
4 Correct 4 ms 1360 KB Output is correct
5 Correct 3 ms 1096 KB Output is correct
6 Correct 4 ms 1228 KB Output is correct
7 Correct 3 ms 1092 KB Output is correct
8 Correct 5 ms 1288 KB Output is correct
9 Correct 4 ms 1388 KB Output is correct
10 Correct 3 ms 1084 KB Output is correct
11 Correct 3 ms 1164 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 1072 KB Output is correct
15 Correct 3 ms 1212 KB Output is correct
16 Correct 3 ms 1132 KB Output is correct
17 Correct 3 ms 1464 KB Output is correct
18 Correct 3 ms 1088 KB Output is correct
19 Correct 4 ms 1784 KB Output is correct
20 Correct 5 ms 1800 KB Output is correct
21 Correct 5 ms 1792 KB Output is correct
22 Correct 4 ms 1696 KB Output is correct
23 Correct 4 ms 1744 KB Output is correct
24 Correct 4 ms 1784 KB Output is correct
25 Correct 4 ms 1784 KB Output is correct
26 Correct 4 ms 1760 KB Output is correct
27 Correct 5 ms 1804 KB Output is correct
28 Correct 5 ms 1792 KB Output is correct
29 Correct 6 ms 1800 KB Output is correct
30 Correct 3 ms 1780 KB Output is correct
31 Correct 3 ms 1432 KB Output is correct
32 Correct 5 ms 1792 KB Output is correct

Subtask #2
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 218 ms 33076 KB Output is correct
2 Correct 539 ms 71316 KB Output is correct
3 Correct 66 ms 12780 KB Output is correct
4 Correct 425 ms 54884 KB Output is correct
5 Correct 1097 ms 99156 KB Output is correct
6 Correct 780 ms 93460 KB Output is correct
7 Correct 413 ms 55500 KB Output is correct
8 Correct 439 ms 61128 KB Output is correct
9 Correct 470 ms 63272 KB Output is correct
10 Correct 427 ms 60328 KB Output is correct
11 Correct 365 ms 68156 KB Output is correct
12 Correct 805 ms 109900 KB Output is correct
13 Correct 768 ms 79084 KB Output is correct
14 Correct 757 ms 84936 KB Output is correct
15 Correct 362 ms 68316 KB Output is correct
16 Correct 831 ms 85668 KB Output is correct
17 Correct 811 ms 84916 KB Output is correct

Subtask #3
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 631 ms 139632 KB Output is correct
2 Correct 1653 ms 193016 KB Output is correct
3 Correct 122 ms 39456 KB Output is correct
4 Correct 819 ms 150256 KB Output is correct
5 Correct 1761 ms 199244 KB Output is correct
6 Correct 1285 ms 170620 KB Output is correct
7 Correct 775 ms 150380 KB Output is correct
8 Correct 872 ms 158344 KB Output is correct
9 Correct 848 ms 155904 KB Output is correct
10 Correct 809 ms 153380 KB Output is correct
11 Correct 720 ms 150656 KB Output is correct
12 Correct 1552 ms 186968 KB Output is correct
13 Correct 1082 ms 167584 KB Output is correct
14 Correct 1229 ms 178324 KB Output is correct
15 Correct 623 ms 151916 KB Output is correct
16 Correct 1304 ms 178952 KB Output is correct
17 Correct 1263 ms 170972 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 5 ms 1636 KB Output is correct
3 Correct 2 ms 1068 KB Output is correct
4 Correct 4 ms 1360 KB Output is correct
5 Correct 3 ms 1096 KB Output is correct
6 Correct 4 ms 1228 KB Output is correct
7 Correct 3 ms 1092 KB Output is correct
8 Correct 5 ms 1288 KB Output is correct
9 Correct 4 ms 1388 KB Output is correct
10 Correct 3 ms 1084 KB Output is correct
11 Correct 3 ms 1164 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 1072 KB Output is correct
15 Correct 3 ms 1212 KB Output is correct
16 Correct 3 ms 1132 KB Output is correct
17 Correct 3 ms 1464 KB Output is correct
18 Correct 3 ms 1088 KB Output is correct
19 Correct 4 ms 1784 KB Output is correct
20 Correct 5 ms 1800 KB Output is correct
21 Correct 5 ms 1792 KB Output is correct
22 Correct 4 ms 1696 KB Output is correct
23 Correct 4 ms 1744 KB Output is correct
24 Correct 4 ms 1784 KB Output is correct
25 Correct 4 ms 1784 KB Output is correct
26 Correct 4 ms 1760 KB Output is correct
27 Correct 5 ms 1804 KB Output is correct
28 Correct 5 ms 1792 KB Output is correct
29 Correct 6 ms 1800 KB Output is correct
30 Correct 3 ms 1780 KB Output is correct
31 Correct 3 ms 1432 KB Output is correct
32 Correct 5 ms 1792 KB Output is correct
33 Correct 218 ms 33076 KB Output is correct
34 Correct 539 ms 71316 KB Output is correct
35 Correct 66 ms 12780 KB Output is correct
36 Correct 425 ms 54884 KB Output is correct
37 Correct 1097 ms 99156 KB Output is correct
38 Correct 780 ms 93460 KB Output is correct
39 Correct 413 ms 55500 KB Output is correct
40 Correct 439 ms 61128 KB Output is correct
41 Correct 470 ms 63272 KB Output is correct
42 Correct 427 ms 60328 KB Output is correct
43 Correct 365 ms 68156 KB Output is correct
44 Correct 805 ms 109900 KB Output is correct
45 Correct 768 ms 79084 KB Output is correct
46 Correct 757 ms 84936 KB Output is correct
47 Correct 362 ms 68316 KB Output is correct
48 Correct 831 ms 85668 KB Output is correct
49 Correct 811 ms 84916 KB Output is correct
50 Correct 631 ms 139632 KB Output is correct
51 Correct 1653 ms 193016 KB Output is correct
52 Correct 122 ms 39456 KB Output is correct
53 Correct 819 ms 150256 KB Output is correct
54 Correct 1761 ms 199244 KB Output is correct
55 Correct 1285 ms 170620 KB Output is correct
56 Correct 775 ms 150380 KB Output is correct
57 Correct 872 ms 158344 KB Output is correct
58 Correct 848 ms 155904 KB Output is correct
59 Correct 809 ms 153380 KB Output is correct
60 Correct 720 ms 150656 KB Output is correct
61 Correct 1552 ms 186968 KB Output is correct
62 Correct 1082 ms 167584 KB Output is correct
63 Correct 1229 ms 178324 KB Output is correct
64 Correct 623 ms 151916 KB Output is correct
65 Correct 1304 ms 178952 KB Output is correct
66 Correct 1263 ms 170972 KB Output is correct
67 Correct 74 ms 19540 KB Output is correct
68 Correct 481 ms 73512 KB Output is correct
69 Correct 622 ms 95636 KB Output is correct
70 Correct 476 ms 76512 KB Output is correct
71 Correct 1096 ms 110020 KB Output is correct
72 Correct 849 ms 90604 KB Output is correct
73 Correct 444 ms 76832 KB Output is correct
74 Correct 517 ms 73896 KB Output is correct
75 Correct 503 ms 67788 KB Output is correct
76 Correct 494 ms 79812 KB Output is correct
77 Correct 438 ms 78580 KB Output is correct
78 Correct 966 ms 92748 KB Output is correct
79 Correct 848 ms 108004 KB Output is correct
80 Correct 791 ms 98876 KB Output is correct
81 Correct 374 ms 80788 KB Output is correct
82 Correct 865 ms 118364 KB Output is correct
83 Correct 789 ms 88156 KB Output is correct
84 Correct 528 ms 101252 KB Output is correct
85 Correct 1181 ms 123900 KB Output is correct
86 Correct 846 ms 94452 KB Output is correct
87 Correct 514 ms 101576 KB Output is correct
88 Correct 549 ms 87744 KB Output is correct
89 Correct 574 ms 103932 KB Output is correct
90 Correct 538 ms 103140 KB Output is correct
91 Correct 520 ms 103492 KB Output is correct
92 Correct 1182 ms 121504 KB Output is correct
93 Correct 705 ms 101912 KB Output is correct
94 Correct 675 ms 86672 KB Output is correct
95 Correct 444 ms 105420 KB Output is correct
96 Correct 888 ms 107520 KB Output is correct
97 Correct 837 ms 91148 KB Output is correct
98 Correct 799 ms 150424 KB Output is correct
99 Correct 1188 ms 130100 KB Output is correct
100 Correct 1244 ms 167420 KB Output is correct
101 Correct 651 ms 151024 KB Output is correct
102 Correct 725 ms 154228 KB Output is correct
103 Correct 728 ms 153644 KB Output is correct
104 Correct 707 ms 153796 KB Output is correct
105 Correct 605 ms 152584 KB Output is correct
106 Correct 1152 ms 169596 KB Output is correct
107 Correct 986 ms 132444 KB Output is correct
108 Correct 999 ms 164324 KB Output is correct
109 Correct 576 ms 154448 KB Output is correct
110 Correct 1026 ms 120216 KB Output is correct
111 Correct 1150 ms 169616 KB Output is correct