oj.uz

Submission #931605

# Submission time Handle Problem Language Result Execution time Memory
931605 2024-02-22T06:48:10 Z vjudge1 Capital City (JOI20_capital_city) C++17
11 / 100
 223 ms 6100 KB 
#include <bits/stdc++.h>
using namespace std;

#ifdef DEBUG
#include "debug.h"
#else
#define debug(...) 0
#endif

typedef long long ll;

const int N = 2e3 + 4;

int n, k, c[N], cnt[N];
bool have[N], seen[N];
vector<int> T[N], D[N];

void dfs1(int v, int p) {
    have[c[v]] = 1;
    for (int u : T[v]) {
        if (u != p) {
            dfs1(u, v);
        }
    }
}

void dfs2(int v) {
    seen[v] = 1;
    for (int u : D[v]) {
        if (seen[u] == 0) {
            dfs2(u);
        }
    }
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    cin >> n >> k;
    for (int i = 1; i < n; i++) {
        int v, u;
        cin >> v >> u;
        v--; u--;
        T[v].push_back(u);
        T[u].push_back(v);
    }
    for (int i = 0; i < n; i++) {
        cin >> c[i];
        c[i]--;
    }

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            cnt[j] = have[j] = 0;
        }
        for (int v : T[i]) {
            dfs1(v, i);
            for (int j = 0; j < n; j++) {
                cnt[j] += have[j];
                have[j] = 0;
            }
        }
        for (int j = 0; j < k; j++) {
            if (cnt[j] >= 2) {
                D[j].push_back(c[i]);
            }
        }
    }

    int ans = k;
    for (int i = 0; i < k; i++) {
        for (int j = 0; j < k; j++) {
            seen[j] = 0;
        }
        dfs2(i);
        
        int cand = 0;
        for (int j = 0; j < k; j++) {
            cand += seen[j];
        }
        ans = min(ans, cand);
    }
    cout << ans - 1;

    return 0;
}

Subtask #1
1.0 / 1.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 55 ms 724 KB Output is correct
12 Correct 54 ms 604 KB Output is correct
13 Correct 54 ms 604 KB Output is correct
14 Correct 54 ms 604 KB Output is correct
15 Correct 36 ms 860 KB Output is correct
16 Correct 45 ms 1108 KB Output is correct
17 Correct 37 ms 1616 KB Output is correct
18 Correct 38 ms 1624 KB Output is correct
19 Correct 38 ms 1768 KB Output is correct
20 Correct 38 ms 1620 KB Output is correct
21 Correct 38 ms 1624 KB Output is correct
22 Correct 223 ms 5992 KB Output is correct
23 Correct 208 ms 6100 KB Output is correct
24 Correct 38 ms 876 KB Output is correct
25 Correct 61 ms 760 KB Output is correct
26 Correct 57 ms 728 KB Output is correct
27 Correct 58 ms 604 KB Output is correct
28 Correct 53 ms 872 KB Output is correct
29 Correct 54 ms 860 KB Output is correct
30 Correct 53 ms 828 KB Output is correct

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 600 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 59.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 55 ms 724 KB Output is correct
12 Correct 54 ms 604 KB Output is correct
13 Correct 54 ms 604 KB Output is correct
14 Correct 54 ms 604 KB Output is correct
15 Correct 36 ms 860 KB Output is correct
16 Correct 45 ms 1108 KB Output is correct
17 Correct 37 ms 1616 KB Output is correct
18 Correct 38 ms 1624 KB Output is correct
19 Correct 38 ms 1768 KB Output is correct
20 Correct 38 ms 1620 KB Output is correct
21 Correct 38 ms 1624 KB Output is correct
22 Correct 223 ms 5992 KB Output is correct
23 Correct 208 ms 6100 KB Output is correct
24 Correct 38 ms 876 KB Output is correct
25 Correct 61 ms 760 KB Output is correct
26 Correct 57 ms 728 KB Output is correct
27 Correct 58 ms 604 KB Output is correct
28 Correct 53 ms 872 KB Output is correct
29 Correct 54 ms 860 KB Output is correct
30 Correct 53 ms 828 KB Output is correct
31 Runtime error 2 ms 600 KB Execution killed with signal 11
32 Halted 0 ms 0 KB -