oj.uz

답안 #497591

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
497591 2021-12-23T10:23:22 Z Jarif_Rahman Unique Cities (JOI19_ho_t5) C++17
100 / 100
 1721 ms 199096 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);

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: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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 4 ms 1644 KB Output is correct
3 Correct 2 ms 1076 KB Output is correct
4 Correct 5 ms 1316 KB Output is correct
5 Correct 3 ms 1168 KB Output is correct
6 Correct 3 ms 1228 KB Output is correct
7 Correct 4 ms 1100 KB Output is correct
8 Correct 3 ms 1284 KB Output is correct
9 Correct 5 ms 1424 KB Output is correct
10 Correct 3 ms 1092 KB Output is correct
11 Correct 3 ms 1168 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 3 ms 1192 KB Output is correct
17 Correct 3 ms 1484 KB Output is correct
18 Correct 3 ms 1100 KB Output is correct
19 Correct 4 ms 1784 KB Output is correct
20 Correct 6 ms 1800 KB Output is correct
21 Correct 4 ms 1788 KB Output is correct
22 Correct 4 ms 1748 KB Output is correct
23 Correct 4 ms 1800 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 6 ms 1792 KB Output is correct
28 Correct 4 ms 1800 KB Output is correct
29 Correct 5 ms 1812 KB Output is correct
30 Correct 3 ms 1756 KB Output is correct
31 Correct 4 ms 1444 KB Output is correct
32 Correct 5 ms 1772 KB Output is correct

Subtask #2
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 206 ms 33156 KB Output is correct
2 Correct 550 ms 71344 KB Output is correct
3 Correct 55 ms 12780 KB Output is correct
4 Correct 422 ms 54824 KB Output is correct
5 Correct 1070 ms 99112 KB Output is correct
6 Correct 763 ms 93440 KB Output is correct
7 Correct 406 ms 55384 KB Output is correct
8 Correct 430 ms 61152 KB Output is correct
9 Correct 422 ms 63280 KB Output is correct
10 Correct 417 ms 60212 KB Output is correct
11 Correct 349 ms 68060 KB Output is correct
12 Correct 802 ms 109964 KB Output is correct
13 Correct 665 ms 78964 KB Output is correct
14 Correct 677 ms 84888 KB Output is correct
15 Correct 349 ms 68252 KB Output is correct
16 Correct 789 ms 85680 KB Output is correct
17 Correct 751 ms 84908 KB Output is correct

Subtask #3
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 640 ms 139480 KB Output is correct
2 Correct 1587 ms 193012 KB Output is correct
3 Correct 134 ms 39692 KB Output is correct
4 Correct 801 ms 150056 KB Output is correct
5 Correct 1721 ms 199096 KB Output is correct
6 Correct 1383 ms 170392 KB Output is correct
7 Correct 798 ms 150152 KB Output is correct
8 Correct 891 ms 158164 KB Output is correct
9 Correct 912 ms 155604 KB Output is correct
10 Correct 827 ms 153244 KB Output is correct
11 Correct 752 ms 150456 KB Output is correct
12 Correct 1533 ms 187008 KB Output is correct
13 Correct 1097 ms 167272 KB Output is correct
14 Correct 1212 ms 177980 KB Output is correct
15 Correct 619 ms 151592 KB Output is correct
16 Correct 1369 ms 178832 KB Output is correct
17 Correct 1259 ms 170728 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 4 ms 1644 KB Output is correct
3 Correct 2 ms 1076 KB Output is correct
4 Correct 5 ms 1316 KB Output is correct
5 Correct 3 ms 1168 KB Output is correct
6 Correct 3 ms 1228 KB Output is correct
7 Correct 4 ms 1100 KB Output is correct
8 Correct 3 ms 1284 KB Output is correct
9 Correct 5 ms 1424 KB Output is correct
10 Correct 3 ms 1092 KB Output is correct
11 Correct 3 ms 1168 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 3 ms 1192 KB Output is correct
17 Correct 3 ms 1484 KB Output is correct
18 Correct 3 ms 1100 KB Output is correct
19 Correct 4 ms 1784 KB Output is correct
20 Correct 6 ms 1800 KB Output is correct
21 Correct 4 ms 1788 KB Output is correct
22 Correct 4 ms 1748 KB Output is correct
23 Correct 4 ms 1800 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 6 ms 1792 KB Output is correct
28 Correct 4 ms 1800 KB Output is correct
29 Correct 5 ms 1812 KB Output is correct
30 Correct 3 ms 1756 KB Output is correct
31 Correct 4 ms 1444 KB Output is correct
32 Correct 5 ms 1772 KB Output is correct
33 Correct 206 ms 33156 KB Output is correct
34 Correct 550 ms 71344 KB Output is correct
35 Correct 55 ms 12780 KB Output is correct
36 Correct 422 ms 54824 KB Output is correct
37 Correct 1070 ms 99112 KB Output is correct
38 Correct 763 ms 93440 KB Output is correct
39 Correct 406 ms 55384 KB Output is correct
40 Correct 430 ms 61152 KB Output is correct
41 Correct 422 ms 63280 KB Output is correct
42 Correct 417 ms 60212 KB Output is correct
43 Correct 349 ms 68060 KB Output is correct
44 Correct 802 ms 109964 KB Output is correct
45 Correct 665 ms 78964 KB Output is correct
46 Correct 677 ms 84888 KB Output is correct
47 Correct 349 ms 68252 KB Output is correct
48 Correct 789 ms 85680 KB Output is correct
49 Correct 751 ms 84908 KB Output is correct
50 Correct 640 ms 139480 KB Output is correct
51 Correct 1587 ms 193012 KB Output is correct
52 Correct 134 ms 39692 KB Output is correct
53 Correct 801 ms 150056 KB Output is correct
54 Correct 1721 ms 199096 KB Output is correct
55 Correct 1383 ms 170392 KB Output is correct
56 Correct 798 ms 150152 KB Output is correct
57 Correct 891 ms 158164 KB Output is correct
58 Correct 912 ms 155604 KB Output is correct
59 Correct 827 ms 153244 KB Output is correct
60 Correct 752 ms 150456 KB Output is correct
61 Correct 1533 ms 187008 KB Output is correct
62 Correct 1097 ms 167272 KB Output is correct
63 Correct 1212 ms 177980 KB Output is correct
64 Correct 619 ms 151592 KB Output is correct
65 Correct 1369 ms 178832 KB Output is correct
66 Correct 1259 ms 170728 KB Output is correct
67 Correct 75 ms 19656 KB Output is correct
68 Correct 483 ms 73448 KB Output is correct
69 Correct 602 ms 95408 KB Output is correct
70 Correct 472 ms 76384 KB Output is correct
71 Correct 1084 ms 109832 KB Output is correct
72 Correct 845 ms 90248 KB Output is correct
73 Correct 477 ms 76728 KB Output is correct
74 Correct 531 ms 73652 KB Output is correct
75 Correct 464 ms 67668 KB Output is correct
76 Correct 481 ms 79576 KB Output is correct
77 Correct 422 ms 78460 KB Output is correct
78 Correct 901 ms 92416 KB Output is correct
79 Correct 812 ms 107620 KB Output is correct
80 Correct 688 ms 98440 KB Output is correct
81 Correct 363 ms 80508 KB Output is correct
82 Correct 851 ms 118064 KB Output is correct
83 Correct 799 ms 87648 KB Output is correct
84 Correct 515 ms 100916 KB Output is correct
85 Correct 1161 ms 123632 KB Output is correct
86 Correct 843 ms 94056 KB Output is correct
87 Correct 528 ms 101252 KB Output is correct
88 Correct 541 ms 87464 KB Output is correct
89 Correct 591 ms 103552 KB Output is correct
90 Correct 539 ms 102784 KB Output is correct
91 Correct 475 ms 102912 KB Output is correct
92 Correct 1140 ms 121244 KB Output is correct
93 Correct 648 ms 101532 KB Output is correct
94 Correct 601 ms 86260 KB Output is correct
95 Correct 436 ms 104956 KB Output is correct
96 Correct 902 ms 107060 KB Output is correct
97 Correct 832 ms 90656 KB Output is correct
98 Correct 773 ms 149948 KB Output is correct
99 Correct 1196 ms 129584 KB Output is correct
100 Correct 1224 ms 166812 KB Output is correct
101 Correct 635 ms 150736 KB Output is correct
102 Correct 725 ms 153924 KB Output is correct
103 Correct 710 ms 153472 KB Output is correct
104 Correct 728 ms 153408 KB Output is correct
105 Correct 567 ms 152220 KB Output is correct
106 Correct 1131 ms 169276 KB Output is correct
107 Correct 934 ms 132092 KB Output is correct
108 Correct 994 ms 164024 KB Output is correct
109 Correct 579 ms 154040 KB Output is correct
110 Correct 1002 ms 119620 KB Output is correct
111 Correct 1159 ms 169196 KB Output is correct