Submission #494903

# Submission time Handle Problem Language Result Execution time Memory
494903 2021-12-17T11:18:05 Z Stickfish Beads and wires (APIO14_beads) C++17
57 / 100
1000 ms 14384 KB
#include <iostream>
#include <vector>
using namespace std;

const int MAXN = 2e5 + 123;
const int INF = 1.77013e9;
vector<pair<int, int>> edg[MAXN];
int dp[MAXN][2];

void update(int v, int rt) {
    dp[v][0] = dp[v][1] = 0;
    int rtw = -INF;
    for (auto [u, w] : edg[v]) {
        if (u == rt) {
            rtw = w;
            continue;
        }
        dp[v][0] += max(dp[u][0], dp[u][1]);
    }
    dp[v][1] = dp[v][0];
    if (rtw != -INF) {
        for (auto [u, w] : edg[v]) {
            if (u == rt)
                continue;
            dp[v][1] = max(dp[v][1], dp[v][0] + rtw + w + min(0, dp[u][0] - dp[u][1]));
        }
    }
}

void get_ans(int v, int rt) {
    for (auto [u, w] : edg[v]) {
        if (u == rt) {
            continue;
        }
        get_ans(u, v);
    }
    update(v, rt);
}

int dfs(int v, int rt) {
    int dpv0 = dp[v][0];
    int dpv1 = dp[v][1];
    int ans = dp[v][0];
    for (auto [u, w] : edg[v]) {
        if (u == rt)
            continue;
        int dpu0 = dp[u][0];
        int dpu1 = dp[u][1];
        update(v, u);
        update(u, -1);
        ans = max(ans, dfs(u, v));
        dp[v][0] = dpv0;
        dp[v][1] = dpv1;
        dp[u][0] = dpu0;
        dp[u][1] = dpu1;
    }
    return ans;
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int n;
    cin >> n;
    for (int i = 0; i < n - 1; ++i) {
        int u, v, d;
        cin >> u >> v >> d;
        --u, --v;
        edg[u].push_back({v, d});
        edg[v].push_back({u, d});
    }
    get_ans(0, -1);
    int ans = dfs(0, -1);
    cout << ans << endl;
}
# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 2 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 2 ms 4940 KB Output is correct
7 Correct 2 ms 4940 KB Output is correct
8 Correct 2 ms 4940 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 2 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 2 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 2 ms 4940 KB Output is correct
7 Correct 2 ms 4940 KB Output is correct
8 Correct 2 ms 4940 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 2 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 2 ms 4940 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct
15 Correct 2 ms 4940 KB Output is correct
16 Correct 2 ms 4940 KB Output is correct
17 Correct 3 ms 4940 KB Output is correct
18 Correct 3 ms 4940 KB Output is correct
19 Correct 3 ms 5068 KB Output is correct
20 Correct 3 ms 4940 KB Output is correct
21 Correct 3 ms 4940 KB Output is correct
22 Correct 3 ms 4940 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 2 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 2 ms 4940 KB Output is correct
7 Correct 2 ms 4940 KB Output is correct
8 Correct 2 ms 4940 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 2 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 2 ms 4940 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct
15 Correct 2 ms 4940 KB Output is correct
16 Correct 2 ms 4940 KB Output is correct
17 Correct 3 ms 4940 KB Output is correct
18 Correct 3 ms 4940 KB Output is correct
19 Correct 3 ms 5068 KB Output is correct
20 Correct 3 ms 4940 KB Output is correct
21 Correct 3 ms 4940 KB Output is correct
22 Correct 3 ms 4940 KB Output is correct
23 Correct 5 ms 5196 KB Output is correct
24 Correct 5 ms 5196 KB Output is correct
25 Correct 5 ms 5196 KB Output is correct
26 Correct 8 ms 5452 KB Output is correct
27 Correct 7 ms 5452 KB Output is correct
28 Correct 411 ms 5452 KB Output is correct
29 Correct 187 ms 5452 KB Output is correct
30 Correct 139 ms 5488 KB Output is correct
31 Correct 87 ms 5836 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 2 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 2 ms 4940 KB Output is correct
7 Correct 2 ms 4940 KB Output is correct
8 Correct 2 ms 4940 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 2 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 2 ms 4940 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct
15 Correct 2 ms 4940 KB Output is correct
16 Correct 2 ms 4940 KB Output is correct
17 Correct 3 ms 4940 KB Output is correct
18 Correct 3 ms 4940 KB Output is correct
19 Correct 3 ms 5068 KB Output is correct
20 Correct 3 ms 4940 KB Output is correct
21 Correct 3 ms 4940 KB Output is correct
22 Correct 3 ms 4940 KB Output is correct
23 Correct 5 ms 5196 KB Output is correct
24 Correct 5 ms 5196 KB Output is correct
25 Correct 5 ms 5196 KB Output is correct
26 Correct 8 ms 5452 KB Output is correct
27 Correct 7 ms 5452 KB Output is correct
28 Correct 411 ms 5452 KB Output is correct
29 Correct 187 ms 5452 KB Output is correct
30 Correct 139 ms 5488 KB Output is correct
31 Correct 87 ms 5836 KB Output is correct
32 Correct 26 ms 7284 KB Output is correct
33 Correct 30 ms 7200 KB Output is correct
34 Correct 27 ms 7232 KB Output is correct
35 Correct 173 ms 13976 KB Output is correct
36 Correct 177 ms 13988 KB Output is correct
37 Correct 176 ms 14052 KB Output is correct
38 Execution timed out 1081 ms 14384 KB Time limit exceeded
39 Halted 0 ms 0 KB -