oj.uz

답안 #808572

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
808572 2023-08-05T07:55:58 Z FedShat 수도 (JOI20_capital_city) C++17
100 / 100
 1940 ms 367728 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr ll INFLL = numeric_limits<ll>::max() / 2;

template<class T>
istream &operator>>(istream &is, vector<T> &a) {
    for (auto &i : a) {
        is >> i;
    }
    return is;
}

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

struct LCA {
    vector<int> depth, parent, up;

    LCA() {}
    LCA(int n) {
        depth.resize(n);
        parent.resize(n);
        up.resize(n);
    }

    void add_leaf(int v, int par) {
        parent[v] = par;
        depth[v] = depth[par] + 1;
        if (depth[par] - depth[up[par]] == depth[up[par]] - depth[up[up[par]]]) {
            up[v] = up[up[par]];
        } else {
            up[v] = par;
        }
    }

    int la(int v, int k) {
        int h = max(depth[v] - k, 0);
        while (depth[v] != h) {
            if (depth[up[v]] >= h) {
                v = up[v];
            } else {
                v = parent[v];
            }
        }
        return v;
    }

    int lca(int v, int u) {
        if (depth[v] > depth[u]) {
            v = la(v, depth[v] - depth[u]);
        } else {
            u = la(u, depth[u] - depth[v]);
        }
        while (v != u) {
            if (up[v] != up[u]) {
                v = up[v];
                u = up[u];
            } else {
                v = parent[v];
                u = parent[u];
            }
        }
        return v;
    }
};

vector<vector<int>> tr, g, gg;
vector<int> tin, tout, c, ggg;
int timer = 0;
LCA st;
constexpr int LG = 18;

void add(int v, int p) {
    g.emplace_back();
    ggg[v] = g.size() - 1;
    g.back().push_back(c[v]);
    gg[0][v] = ggg[p];
    for (int i = 1; i < LG; ++i) {
        g.emplace_back();
        gg[i][v] = g.size() - 1;
        g.back().emplace_back(gg[i - 1][v]);
        g.back().emplace_back(gg[i - 1][st.la(v, 1 << (i - 1))]);
    }
}

void dfs(int v, int p) {
    tin[v] = timer++;
    if (p == -1) {
        g.emplace_back();
        ggg[v] = g.size() - 1;
        g.back().push_back(c[v]);
    }
    for (auto u : tr[v]) {
        if (u != p) {
            st.add_leaf(u, v);
            add(u, v);
            dfs(u, v);
        }
    }
    tout[v] = timer;
}

vector<int> val;
vector<int> curst;
vector<int> cond, siz;
int cnt = 0;
int k;

int dfs_scc(int j) {
    static int timer = 0;
    int low = val[j] = ++timer, x;
    curst.push_back(j);
    for (auto e : g[j]) {
        if (cond[e] < 0) {
            low = min(low, val[e] ? val[e] : dfs_scc(e));
        }
    }
    if (low == val[j]) {
        do {
            x = curst.back();
            curst.pop_back();
            siz[cnt] += (x < k);
            cond[x] = cnt;
        } while (x != j);
        ++cnt;
    }
    return val[j] = low;
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
#ifdef __APPLE__
    freopen("input.txt", "r", stdin);
#endif
    int n;
    cin >> n >> k;
    tr.resize(n);
    for (int i = 0; i < n - 1; ++i) {
        int u, v;
        cin >> u >> v;
        --u;
        --v;
        tr[u].push_back(v);
        tr[v].push_back(u);
    }
    c.resize(n);
    cin >> c;
    for (auto &i : c) {
        --i;
    }
    tin.resize(n);
    tout.resize(n);
    st = LCA(n);
    g.resize(k);
    gg.resize(LG, vector<int>(n));
    ggg.resize(n);
    dfs(0, -1);
    vector<vector<int>> cc(k);
    for (int i = 0; i < n; ++i) {
        cc[c[i]].push_back(i);
    }
    auto add_edges = [&](int v, int d) {
        int cv = c[v];
        // for (int i = 0; i < d; ++i) {
        //     v = st.up[0][v];
        //     g[cv].push_back(c[v]);
        // }
        // if (cv == 2) {
        //     cout << "nigga\n";
        // }
        for (int i = LG - 1; i >= 0; --i) {
            if (d >= (1 << i)) {
                g[cv].push_back(gg[i][v]);
                d -= (1 << i);
                v = st.la(v, (1 << i));
            }
        }
    };
    for (int i = 0; i < k; ++i) {
        sort(cc[i].begin(), cc[i].end(), [&](int u, int v) {
            return tin[u] < tin[v];
        });
        for (int j = 0; j + 1 < (int) cc[i].size(); ++j) {
            int l = st.lca(cc[i][j], cc[i][j + 1]);
            add_edges(cc[i][j], st.depth[cc[i][j]] - st.depth[l]);
            add_edges(cc[i][j + 1], st.depth[cc[i][j + 1]] - st.depth[l]);
        }
    }
    // for (int i = 0; i < (int) g.size(); ++i) {
    //     for (int j : g[i]) {
    //         cout << i + 1 << " " << j + 1 << "\n";
    //     }
    // }
    int sz = g.size();
    val.resize(sz);
    cond.resize(sz, -1);
    siz.resize(sz);
    for (int i = 0; i < sz; ++i) {
        if (cond[i] < 0) {
            dfs_scc(i);
        }
    }
    vector<int> iznas(cnt);
    for (int i = 0; i < sz; ++i) {
        for (auto j : g[i]) {
            if (cond[i] != cond[j]) {
                ++iznas[cond[i]];
            }
        }
    }
    // debug(siz);
    // debug(iznas);
    int ans = INF;
    for (int i = 0; i < cnt; ++i) {
        if (iznas[i] == 0) {
            ans = min(ans, siz[i]);
        }
    }
    cout << ans - 1 << "\n";
}

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 212 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 6 ms 3248 KB Output is correct
12 Correct 6 ms 3248 KB Output is correct
13 Correct 6 ms 3248 KB Output is correct
14 Correct 5 ms 3248 KB Output is correct
15 Correct 6 ms 3304 KB Output is correct
16 Correct 6 ms 3264 KB Output is correct
17 Correct 5 ms 3364 KB Output is correct
18 Correct 6 ms 3232 KB Output is correct
19 Correct 6 ms 3348 KB Output is correct
20 Correct 5 ms 3236 KB Output is correct
21 Correct 6 ms 3360 KB Output is correct
22 Correct 6 ms 3468 KB Output is correct
23 Correct 6 ms 3636 KB Output is correct
24 Correct 8 ms 3376 KB Output is correct
25 Correct 6 ms 3328 KB Output is correct
26 Correct 6 ms 3416 KB Output is correct
27 Correct 7 ms 3376 KB Output is correct
28 Correct 6 ms 3348 KB Output is correct
29 Correct 6 ms 3320 KB Output is correct
30 Correct 6 ms 3352 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1901 ms 367728 KB Output is correct
2 Correct 1199 ms 319512 KB Output is correct
3 Correct 1940 ms 332944 KB Output is correct
4 Correct 1083 ms 319544 KB Output is correct
5 Correct 1782 ms 362880 KB Output is correct
6 Correct 1072 ms 319308 KB Output is correct
7 Correct 1733 ms 350724 KB Output is correct
8 Correct 991 ms 317236 KB Output is correct
9 Correct 1486 ms 307984 KB Output is correct
10 Correct 1354 ms 305656 KB Output is correct
11 Correct 1373 ms 308472 KB Output is correct
12 Correct 1401 ms 311048 KB Output is correct
13 Correct 1466 ms 305192 KB Output is correct
14 Correct 1475 ms 311504 KB Output is correct
15 Correct 1411 ms 311084 KB Output is correct
16 Correct 1416 ms 305996 KB Output is correct
17 Correct 1374 ms 306484 KB Output is correct
18 Correct 1373 ms 306760 KB Output is correct
19 Correct 1401 ms 309792 KB Output is correct
20 Correct 1438 ms 312396 KB Output is correct
21 Correct 1 ms 212 KB Output is correct

Subtask #4
59.0 / 59.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 6 ms 3248 KB Output is correct
12 Correct 6 ms 3248 KB Output is correct
13 Correct 6 ms 3248 KB Output is correct
14 Correct 5 ms 3248 KB Output is correct
15 Correct 6 ms 3304 KB Output is correct
16 Correct 6 ms 3264 KB Output is correct
17 Correct 5 ms 3364 KB Output is correct
18 Correct 6 ms 3232 KB Output is correct
19 Correct 6 ms 3348 KB Output is correct
20 Correct 5 ms 3236 KB Output is correct
21 Correct 6 ms 3360 KB Output is correct
22 Correct 6 ms 3468 KB Output is correct
23 Correct 6 ms 3636 KB Output is correct
24 Correct 8 ms 3376 KB Output is correct
25 Correct 6 ms 3328 KB Output is correct
26 Correct 6 ms 3416 KB Output is correct
27 Correct 7 ms 3376 KB Output is correct
28 Correct 6 ms 3348 KB Output is correct
29 Correct 6 ms 3320 KB Output is correct
30 Correct 6 ms 3352 KB Output is correct
31 Correct 1901 ms 367728 KB Output is correct
32 Correct 1199 ms 319512 KB Output is correct
33 Correct 1940 ms 332944 KB Output is correct
34 Correct 1083 ms 319544 KB Output is correct
35 Correct 1782 ms 362880 KB Output is correct
36 Correct 1072 ms 319308 KB Output is correct
37 Correct 1733 ms 350724 KB Output is correct
38 Correct 991 ms 317236 KB Output is correct
39 Correct 1486 ms 307984 KB Output is correct
40 Correct 1354 ms 305656 KB Output is correct
41 Correct 1373 ms 308472 KB Output is correct
42 Correct 1401 ms 311048 KB Output is correct
43 Correct 1466 ms 305192 KB Output is correct
44 Correct 1475 ms 311504 KB Output is correct
45 Correct 1411 ms 311084 KB Output is correct
46 Correct 1416 ms 305996 KB Output is correct
47 Correct 1374 ms 306484 KB Output is correct
48 Correct 1373 ms 306760 KB Output is correct
49 Correct 1401 ms 309792 KB Output is correct
50 Correct 1438 ms 312396 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 980 ms 304476 KB Output is correct
53 Correct 968 ms 304628 KB Output is correct
54 Correct 1035 ms 304668 KB Output is correct
55 Correct 1042 ms 304532 KB Output is correct
56 Correct 958 ms 304500 KB Output is correct
57 Correct 981 ms 304528 KB Output is correct
58 Correct 1286 ms 305564 KB Output is correct
59 Correct 1333 ms 309008 KB Output is correct
60 Correct 1521 ms 308336 KB Output is correct
61 Correct 1580 ms 304432 KB Output is correct
62 Correct 1097 ms 319516 KB Output is correct
63 Correct 1031 ms 319452 KB Output is correct
64 Correct 1000 ms 317688 KB Output is correct
65 Correct 1030 ms 319376 KB Output is correct
66 Correct 1173 ms 304460 KB Output is correct
67 Correct 1199 ms 305132 KB Output is correct
68 Correct 1163 ms 304404 KB Output is correct
69 Correct 1223 ms 304404 KB Output is correct
70 Correct 1212 ms 304356 KB Output is correct
71 Correct 1201 ms 304352 KB Output is correct
72 Correct 1207 ms 304360 KB Output is correct
73 Correct 1389 ms 304908 KB Output is correct
74 Correct 1236 ms 304384 KB Output is correct
75 Correct 1192 ms 304312 KB Output is correct
76 Correct 1342 ms 306628 KB Output is correct
77 Correct 1227 ms 305976 KB Output is correct
78 Correct 1429 ms 306368 KB Output is correct
79 Correct 1473 ms 306656 KB Output is correct
80 Correct 1366 ms 311888 KB Output is correct
81 Correct 1388 ms 308328 KB Output is correct
82 Correct 1419 ms 308252 KB Output is correct
83 Correct 1335 ms 304912 KB Output is correct
84 Correct 1393 ms 312972 KB Output is correct
85 Correct 1380 ms 309316 KB Output is correct
86 Correct 1344 ms 304608 KB Output is correct
87 Correct 1359 ms 306348 KB Output is correct
88 Correct 1664 ms 308340 KB Output is correct
89 Correct 1560 ms 304108 KB Output is correct
90 Correct 1525 ms 303068 KB Output is correct
91 Correct 1587 ms 305564 KB Output is correct
92 Correct 1585 ms 304896 KB Output is correct
93 Correct 1543 ms 304572 KB Output is correct
94 Correct 1650 ms 303944 KB Output is correct
95 Correct 1562 ms 305640 KB Output is correct
96 Correct 1606 ms 304420 KB Output is correct
97 Correct 1573 ms 306344 KB Output is correct