oj.uz

Submission #338391

# Submission time Handle Problem Language Result Execution time Memory
338391 2020-12-23T05:00:04 Z KoD Cats or Dogs (JOI18_catdog) C++17
38 / 100
 34 ms 4332 KB 
#include <bits/stdc++.h>

template <class T>
using Vec = std::vector<T>;

constexpr int INF = 1000000000;

int N;
Vec<Vec<int>> graph;
Vec<int> state;
Vec<std::array<int, 3>> dp;

void initialize(int N_, Vec<int> A, Vec<int> B) {
    N = N_;
    assert(N <= 1000);
    graph.resize(N);
    state.resize(N);
    dp.resize(N);
    for (int i = 0; i < N - 1; ++i) {
        graph[A[i] - 1].push_back(B[i] - 1);
        graph[B[i] - 1].push_back(A[i] - 1);
    }
}

void dfs(int u, int p) {
    dp[u][state[u]] = 0;
    if (state[u] == 0) {
        dp[u][1] = 0;
        dp[u][2] = 0;
    }
    for (auto v: graph[u]) {
        if (v != p) {
            dfs(v, u);
            const auto NoEffect = std::min(dp[v][0], std::min(dp[v][1], dp[v][2]) + 1);
            dp[u][state[u]] += std::min(NoEffect, dp[v][state[u]]);
            if (state[u] == 0) {
                dp[u][1] += std::min(NoEffect, dp[v][1]);
                dp[u][2] += std::min(NoEffect, dp[v][2]);
            }
        }
    }
}

int solve() {
    for (int i = 0; i < N; ++i) {
        dp[i].fill(INF);
    }
    dfs(0, -1);
    return std::min({ dp[0][0], dp[0][1], dp[0][2] });
}

int cat(int u) {
    state[u - 1] = 1;
    return solve();
}

int dog(int u) {
    state[u - 1] = 2;
    return solve();
}

int neighbor(int u) {
    state[u - 1] = 0;
    return solve();
}

#ifdef __APPLE__
int main() {
    int N;
    std::cin >> N;
    Vec<int> A(N - 1), B(N - 1);
    for (int i = 0; i < N - 1; ++i) {
        std::cin >> A[i] >> B[i];
    }
    initialize(N, A, B);
    int Q;
    std::cin >> Q;
    for (int i = 0; i < N; ++i) {
        int T, v;
        std::cin >> T >> v;
        if (T == 1) {
            std::cout << cat(v) << '\n';
        }
        if (T == 2) {
            std::cout << dog(v) << '\n';
        }
        if (T == 3) {
            std::cout << neighbor(v) << '\n';
        }
    }
    return 0;
}
#endif

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 16 ms 448 KB Output is correct
18 Correct 20 ms 364 KB Output is correct
19 Correct 11 ms 492 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 3 ms 364 KB Output is correct
22 Correct 4 ms 364 KB Output is correct
23 Correct 23 ms 364 KB Output is correct
24 Correct 19 ms 364 KB Output is correct
25 Correct 9 ms 492 KB Output is correct
26 Correct 4 ms 364 KB Output is correct
27 Correct 3 ms 364 KB Output is correct
28 Correct 5 ms 364 KB Output is correct
29 Correct 25 ms 492 KB Output is correct
30 Correct 3 ms 364 KB Output is correct
31 Correct 2 ms 364 KB Output is correct
32 Correct 5 ms 364 KB Output is correct

Subtask #3
0 / 62.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 16 ms 448 KB Output is correct
18 Correct 20 ms 364 KB Output is correct
19 Correct 11 ms 492 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 3 ms 364 KB Output is correct
22 Correct 4 ms 364 KB Output is correct
23 Correct 23 ms 364 KB Output is correct
24 Correct 19 ms 364 KB Output is correct
25 Correct 9 ms 492 KB Output is correct
26 Correct 4 ms 364 KB Output is correct
27 Correct 3 ms 364 KB Output is correct
28 Correct 5 ms 364 KB Output is correct
29 Correct 25 ms 492 KB Output is correct
30 Correct 3 ms 364 KB Output is correct
31 Correct 2 ms 364 KB Output is correct
32 Correct 5 ms 364 KB Output is correct
33 Runtime error 34 ms 4332 KB Execution killed with signal 6 (could be triggered by violating memory limits)
34 Halted 0 ms 0 KB -