oj.uz

Submission #722576

# Submission time Handle Problem Language Result Execution time Memory
722576 2023-04-12T11:18:51 Z stevancv Beads and wires (APIO14_beads) C++14
100 / 100
 212 ms 23020 KB 
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
const int N = 2e5 + 2;
const int inf = 1e9;
vector<pair<int, int>> g[N];
int dp[N][2];
void Dfs(int s, int e, int val) {
    int sum = 0; int mx = -inf;
    for (auto z : g[s]) {
        int u = z.first; int v = z.second;
        if (u == e) continue;
        Dfs(u, s, v);
        sum += max(dp[u][0], dp[u][1]);
        smax(mx, dp[u][0] + v + val - max(dp[u][0], dp[u][1]));
    }
    dp[s][0] = sum; dp[s][1] = sum + mx;
}
int sol, up[N][2];
void Dfs1(int s, int e, int val) {
    smax(sol, max(up[s][0], up[s][1]) + dp[s][0]);
    int x, y;
    x = y = -inf;
    for (auto z : g[s]) {
        int u = z.first; int v = z.second;
        if (u == e) continue;
        int o = dp[u][0] + v - max(dp[u][0], dp[u][1]);
        if (o > x) y = x, x = o;
        else if (o > y) y = o;
    }
    for (auto z : g[s]) {
        int u = z.first; int v = z.second;
        if (u == e) continue;
        int uk = dp[s][0] - max(dp[u][0], dp[u][1]);
        if (s > 1) up[u][1] = up[s][0] + val + v + uk;
        int o = dp[u][0] + v - max(dp[u][0], dp[u][1]);
        int kolko = x;
        if (o == x) kolko = y;
        if (kolko != -inf) smax(up[u][1], v + uk + kolko + max(up[s][0], up[s][1]));
        up[u][0] = max(up[s][0], up[s][1]) + uk;
        Dfs1(u, s, v);
    }
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n; cin >> n;
    for (int i = 0; i < n - 1; i++) {
        int u, v, w;
        cin >> u >> v >> w;
        g[u].push_back({v, w});
        g[v].push_back({u, w});
    }
    Dfs(1, 0, 0);
    Dfs1(1, 0, 0);
    cout << sol << en;
    return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 3 ms 5020 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 4 ms 5000 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 3 ms 5020 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 4 ms 5000 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 5028 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 5024 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 3 ms 5020 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 4 ms 5000 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 5028 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 5024 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 5 ms 5332 KB Output is correct
24 Correct 5 ms 5252 KB Output is correct
25 Correct 5 ms 5292 KB Output is correct
26 Correct 7 ms 5676 KB Output is correct
27 Correct 7 ms 5588 KB Output is correct
28 Correct 8 ms 5672 KB Output is correct
29 Correct 7 ms 5676 KB Output is correct
30 Correct 6 ms 5716 KB Output is correct
31 Correct 8 ms 5980 KB Output is correct

Subtask #4
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 3 ms 5020 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 4 ms 5000 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 5028 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 5024 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 5 ms 5332 KB Output is correct
24 Correct 5 ms 5252 KB Output is correct
25 Correct 5 ms 5292 KB Output is correct
26 Correct 7 ms 5676 KB Output is correct
27 Correct 7 ms 5588 KB Output is correct
28 Correct 8 ms 5672 KB Output is correct
29 Correct 7 ms 5676 KB Output is correct
30 Correct 6 ms 5716 KB Output is correct
31 Correct 8 ms 5980 KB Output is correct
32 Correct 27 ms 8428 KB Output is correct
33 Correct 28 ms 8332 KB Output is correct
34 Correct 26 ms 8356 KB Output is correct
35 Correct 174 ms 19016 KB Output is correct
36 Correct 212 ms 19048 KB Output is correct
37 Correct 146 ms 19028 KB Output is correct
38 Correct 106 ms 19512 KB Output is correct
39 Correct 124 ms 19404 KB Output is correct
40 Correct 115 ms 19388 KB Output is correct
41 Correct 154 ms 23020 KB Output is correct