oj.uz

Submission #677744

# Submission time Handle Problem Language Result Execution time Memory
677744 2023-01-04T09:34:04 Z bashkort Power Plant (JOI20_power) C++17
0 / 100
 1 ms 320 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;


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

    int n;
    cin >> n;

    vector<vector<int>> g(n);

    for (int i = 1; i < n; ++i) {
        int a, b;
        cin >> a >> b;
        --a, --b;

        g[a].push_back(b);
        g[b].push_back(a);
    }

    string str;
    cin >> str;

    vector<bool> active(n);
    for (int i = 0; i < n; ++i) {
        active[i] = str[i] - '0';
    }

    if (active == vector(n, false)) {
        cout << 0 << '\n';
        return 0;
    }

    vector<int> dp(n);

    function<void(int, int)> dfs = [&](int v, int p) {
        for (int to : g[v]) {
            if (to != p) {
                dfs(to, v);
                dp[v] += dp[to];
            }
        }
        dp[v] -= active[v];

        if (active[v]) {
            dp[v] = max(dp[v], 1);
        }

        dp[v] = max(dp[v], 0);
    };
    dfs(0, -1);

    int ans = 1;
    function<void(int, int, int)> gfs = [&](int v, int p, int up) {
        int sum = 0;
        for (int to : g[v]) {
            if (to != p) {
                sum += dp[to];
            }
        }
        ans = max(ans, sum + up - active[v]);
        for (int to : g[v]) {
            if (to != p) {
                int k = max(sum - dp[to], int(active[v]));
                ans = max(ans, dp[to] + k);
                gfs(to, v, k);
            }
        }
    };
    gfs(0, -1, 0);

    cout << ans << '\n';

    return 0;
}

Subtask #1
0.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 320 KB Output is correct
3 Correct 0 ms 316 KB Output is correct
4 Correct 0 ms 316 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 312 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Incorrect 0 ms 212 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #2
0.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 320 KB Output is correct
3 Correct 0 ms 316 KB Output is correct
4 Correct 0 ms 316 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 312 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Incorrect 0 ms 212 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #3
0.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 320 KB Output is correct
3 Correct 0 ms 316 KB Output is correct
4 Correct 0 ms 316 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 312 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Incorrect 0 ms 212 KB Output isn't correct
13 Halted 0 ms 0 KB -