oj.uz

Submission #582737

# Submission time Handle Problem Language Result Execution time Memory
582737 2022-06-24T11:09:18 Z elkernos Capital City (JOI20_capital_city) C++17
100 / 100
 1207 ms 45260 KB 
#include <bits/stdc++.h>

using namespace std;

int main()
{
    cin.tie(nullptr)->sync_with_stdio(0);
    int n, k;
    cin >> n >> k;
    vector<int> m(n + 1);
    vector<vector<int>> gg(k + 1), g(n + 1);
    for(int i = 1; i < n; i++) {
        int a, b;
        cin >> a >> b;
        g[a].push_back(b);
        g[b].push_back(a);
    }
    for(int i = 1; i <= n; i++) {
        cin >> m[i];
        gg[m[i]].push_back(i);
    }
    vector<int> sub(n + 1), par(n + 1), cnt(k + 1);
    vector<bool> used(n + 1), onq(k + 1);
    function<int(int, int, int)> subsz = [&](int u, int p, int c) {
        sub[u] = 1;
        par[u] = p;
        cnt[m[u]] += c;
        onq[m[u]] = 0;
        for(int to : g[u]) {
            if(to == p || used[to]) {
                continue;
            }
            sub[u] += subsz(to, u, c);
        }
        return sub[u];
    };
    function<int(int, int, int)> getcen = [&](int u, int p, int d) {
        for(int to : g[u]) {
            if(to == p || used[to]) {
                continue;
            }
            if(sub[to] > d / 2) {
                return getcen(to, u, d);
            }
        }
        return u;
    };
    int ans = n;
    function<void(int)> rek = [&](int u) {
        subsz(u, u, 0);
        u = getcen(u, u, sub[u]);
        subsz(u, u, 1);
        int use = 0;
        queue<int> q;
        onq[m[u]] = 1;
        q.push(m[u]);
        while(!q.empty()) {
            int v = q.front();
            q.pop();
            if(cnt[v] != (int)gg[v].size()) {
                use = n;
                break;
            }
            for(int to : gg[v]) {
                int look = m[par[to]];
                if(onq[look] == 0) {
                    q.push(look);
                    onq[look] = 1;
                    use++;
                }
            }
        }
        ans = min(ans, use);
        subsz(u, u, -1);
        used[u] = true;
        for(int to : g[u]) {
            if(used[to]) {
                continue;
            }
            rek(to);
        }
    };
    rek(1);
    cout << ans << '\n';
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 3 ms 524 KB Output is correct
12 Correct 3 ms 452 KB Output is correct
13 Correct 3 ms 468 KB Output is correct
14 Correct 3 ms 512 KB Output is correct
15 Correct 3 ms 596 KB Output is correct
16 Correct 3 ms 468 KB Output is correct
17 Correct 3 ms 608 KB Output is correct
18 Correct 3 ms 548 KB Output is correct
19 Correct 3 ms 596 KB Output is correct
20 Correct 3 ms 596 KB Output is correct
21 Correct 3 ms 596 KB Output is correct
22 Correct 3 ms 724 KB Output is correct
23 Correct 3 ms 596 KB Output is correct
24 Correct 3 ms 608 KB Output is correct
25 Correct 4 ms 596 KB Output is correct
26 Correct 4 ms 596 KB Output is correct
27 Correct 4 ms 596 KB Output is correct
28 Correct 4 ms 596 KB Output is correct
29 Correct 3 ms 596 KB Output is correct
30 Correct 4 ms 592 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1047 ms 44536 KB Output is correct
2 Correct 410 ms 45132 KB Output is correct
3 Correct 991 ms 44112 KB Output is correct
4 Correct 412 ms 45200 KB Output is correct
5 Correct 998 ms 39696 KB Output is correct
6 Correct 410 ms 45136 KB Output is correct
7 Correct 1063 ms 40092 KB Output is correct
8 Correct 408 ms 44168 KB Output is correct
9 Correct 1175 ms 36860 KB Output is correct
10 Correct 1098 ms 33456 KB Output is correct
11 Correct 1187 ms 37652 KB Output is correct
12 Correct 1128 ms 41276 KB Output is correct
13 Correct 1131 ms 32856 KB Output is correct
14 Correct 1092 ms 41656 KB Output is correct
15 Correct 1076 ms 41132 KB Output is correct
16 Correct 1037 ms 34252 KB Output is correct
17 Correct 1102 ms 34960 KB Output is correct
18 Correct 1076 ms 35100 KB Output is correct
19 Correct 1089 ms 39580 KB Output is correct
20 Correct 1124 ms 42792 KB Output is correct
21 Correct 1 ms 212 KB Output is correct

Subtask #4
59.0 / 59.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 3 ms 524 KB Output is correct
12 Correct 3 ms 452 KB Output is correct
13 Correct 3 ms 468 KB Output is correct
14 Correct 3 ms 512 KB Output is correct
15 Correct 3 ms 596 KB Output is correct
16 Correct 3 ms 468 KB Output is correct
17 Correct 3 ms 608 KB Output is correct
18 Correct 3 ms 548 KB Output is correct
19 Correct 3 ms 596 KB Output is correct
20 Correct 3 ms 596 KB Output is correct
21 Correct 3 ms 596 KB Output is correct
22 Correct 3 ms 724 KB Output is correct
23 Correct 3 ms 596 KB Output is correct
24 Correct 3 ms 608 KB Output is correct
25 Correct 4 ms 596 KB Output is correct
26 Correct 4 ms 596 KB Output is correct
27 Correct 4 ms 596 KB Output is correct
28 Correct 4 ms 596 KB Output is correct
29 Correct 3 ms 596 KB Output is correct
30 Correct 4 ms 592 KB Output is correct
31 Correct 1047 ms 44536 KB Output is correct
32 Correct 410 ms 45132 KB Output is correct
33 Correct 991 ms 44112 KB Output is correct
34 Correct 412 ms 45200 KB Output is correct
35 Correct 998 ms 39696 KB Output is correct
36 Correct 410 ms 45136 KB Output is correct
37 Correct 1063 ms 40092 KB Output is correct
38 Correct 408 ms 44168 KB Output is correct
39 Correct 1175 ms 36860 KB Output is correct
40 Correct 1098 ms 33456 KB Output is correct
41 Correct 1187 ms 37652 KB Output is correct
42 Correct 1128 ms 41276 KB Output is correct
43 Correct 1131 ms 32856 KB Output is correct
44 Correct 1092 ms 41656 KB Output is correct
45 Correct 1076 ms 41132 KB Output is correct
46 Correct 1037 ms 34252 KB Output is correct
47 Correct 1102 ms 34960 KB Output is correct
48 Correct 1076 ms 35100 KB Output is correct
49 Correct 1089 ms 39580 KB Output is correct
50 Correct 1124 ms 42792 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 634 ms 19524 KB Output is correct
53 Correct 708 ms 19448 KB Output is correct
54 Correct 664 ms 19452 KB Output is correct
55 Correct 734 ms 19420 KB Output is correct
56 Correct 674 ms 19452 KB Output is correct
57 Correct 773 ms 19392 KB Output is correct
58 Correct 741 ms 25880 KB Output is correct
59 Correct 718 ms 26352 KB Output is correct
60 Correct 850 ms 25388 KB Output is correct
61 Correct 972 ms 24888 KB Output is correct
62 Correct 411 ms 45144 KB Output is correct
63 Correct 415 ms 45260 KB Output is correct
64 Correct 431 ms 44552 KB Output is correct
65 Correct 406 ms 45060 KB Output is correct
66 Correct 524 ms 32124 KB Output is correct
67 Correct 562 ms 31948 KB Output is correct
68 Correct 651 ms 32104 KB Output is correct
69 Correct 590 ms 32024 KB Output is correct
70 Correct 654 ms 32020 KB Output is correct
71 Correct 670 ms 32024 KB Output is correct
72 Correct 685 ms 32032 KB Output is correct
73 Correct 617 ms 30852 KB Output is correct
74 Correct 589 ms 32196 KB Output is correct
75 Correct 589 ms 32140 KB Output is correct
76 Correct 942 ms 31176 KB Output is correct
77 Correct 850 ms 28564 KB Output is correct
78 Correct 1042 ms 34868 KB Output is correct
79 Correct 1124 ms 32060 KB Output is correct
80 Correct 1202 ms 42108 KB Output is correct
81 Correct 1125 ms 37068 KB Output is correct
82 Correct 1207 ms 37320 KB Output is correct
83 Correct 1166 ms 32652 KB Output is correct
84 Correct 1158 ms 40836 KB Output is correct
85 Correct 1091 ms 38668 KB Output is correct
86 Correct 1163 ms 32048 KB Output is correct
87 Correct 1207 ms 34516 KB Output is correct
88 Correct 995 ms 36044 KB Output is correct
89 Correct 948 ms 30472 KB Output is correct
90 Correct 991 ms 30304 KB Output is correct
91 Correct 993 ms 33740 KB Output is correct
92 Correct 928 ms 31660 KB Output is correct
93 Correct 1010 ms 31156 KB Output is correct
94 Correct 967 ms 30328 KB Output is correct
95 Correct 1028 ms 32404 KB Output is correct
96 Correct 961 ms 30588 KB Output is correct
97 Correct 1032 ms 33460 KB Output is correct