oj.uz

Submission #115417

# Submission time Handle Problem Language Result Execution time Memory
115417 2019-06-07T10:27:52 Z zubec Beads and wires (APIO14_beads) C++14
100 / 100
 201 ms 23408 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;

const int N = 200100;

vector <pair<int, int> > g[N];

ll dp[4][N];

int n;

void dfs(int v, int p, int lenTo){

    ll sum = 0;

    ll mx1 = -1e15, mx2 = -1e15, mx3 = -1e15;

    for (int i = 0; i < g[v].size(); i++){
        int to = g[v][i].first, len = g[v][i].second;
        if (to == p)
            continue;
        dfs(to, v, len);
        sum += max(dp[0][to], dp[1][to]);

        mx1 = max(mx1, max(dp[2][to], dp[3][to]) - max(dp[0][to], dp[1][to]));

        mx2 = max(mx2, dp[0][to] + len - max(dp[0][to], dp[1][to]));
        mx3 = max(mx3, dp[2][to] + len - max(dp[0][to], dp[1][to]));

    }

    dp[0][v] = max(0ll, sum);
    dp[2][v] = max(0ll, sum + mx1);

    if (v != 1){
        dp[1][v] = max(0ll, sum + mx2 + lenTo);
        dp[3][v] = max(0ll, sum + mx3 + lenTo);
    }

    mx1 = mx2 = -1e15;
    for (int i = 0; i < g[v].size(); i++){
        int to = g[v][i].first, len = g[v][i].second;
        if (to == p)
            continue;

        dp[2][v] = max(dp[2][v], sum + mx1 + max(dp[0][to], dp[2][to]) + len - max(dp[0][to], dp[1][to]) );
        dp[2][v] = max(dp[2][v], sum + mx2 + dp[0][to] + len - max(dp[0][to], dp[1][to]));

        mx1 = max(mx1, dp[0][to] + len - max(dp[0][to], dp[1][to]));
        mx2 = max(mx2, dp[2][to] + len - max(dp[0][to], dp[1][to]));

    }


}

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

    cin >> n;
    for (int i = 2; i <= n; i++){
        int u, v, c;
        cin >> u >> v >> c;
        g[u].push_back({v, c});
        g[v].push_back({u, c});
    }

    dfs(1, 0, 0);

    cout << max({dp[0][1], dp[1][1], dp[2][1], dp[3][1]});

}

/**



*/

Compilation message

beads.cpp: In function 'void dfs(int, int, int)':
beads.cpp:20:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < g[v].size(); i++){
                     ~~^~~~~~~~~~~~~
beads.cpp:43:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < g[v].size(); i++){
                     ~~^~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
29.0 / 29.0

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

Subtask #4
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5120 KB Output is correct
2 Correct 6 ms 4992 KB Output is correct
3 Correct 6 ms 5120 KB Output is correct
4 Correct 6 ms 5248 KB Output is correct
5 Correct 6 ms 5120 KB Output is correct
6 Correct 6 ms 5120 KB Output is correct
7 Correct 7 ms 5120 KB Output is correct
8 Correct 6 ms 5120 KB Output is correct
9 Correct 6 ms 5120 KB Output is correct
10 Correct 8 ms 5120 KB Output is correct
11 Correct 6 ms 5120 KB Output is correct
12 Correct 6 ms 5120 KB Output is correct
13 Correct 7 ms 5120 KB Output is correct
14 Correct 6 ms 5120 KB Output is correct
15 Correct 6 ms 5120 KB Output is correct
16 Correct 5 ms 5120 KB Output is correct
17 Correct 5 ms 5120 KB Output is correct
18 Correct 6 ms 5120 KB Output is correct
19 Correct 6 ms 5120 KB Output is correct
20 Correct 6 ms 5120 KB Output is correct
21 Correct 6 ms 5120 KB Output is correct
22 Correct 7 ms 5120 KB Output is correct
23 Correct 8 ms 5376 KB Output is correct
24 Correct 8 ms 5376 KB Output is correct
25 Correct 9 ms 5376 KB Output is correct
26 Correct 11 ms 5760 KB Output is correct
27 Correct 11 ms 5760 KB Output is correct
28 Correct 10 ms 5760 KB Output is correct
29 Correct 12 ms 5760 KB Output is correct
30 Correct 11 ms 5828 KB Output is correct
31 Correct 18 ms 6144 KB Output is correct
32 Correct 38 ms 8424 KB Output is correct
33 Correct 73 ms 8568 KB Output is correct
34 Correct 35 ms 8448 KB Output is correct
35 Correct 199 ms 18872 KB Output is correct
36 Correct 201 ms 18808 KB Output is correct
37 Correct 191 ms 18920 KB Output is correct
38 Correct 140 ms 19172 KB Output is correct
39 Correct 145 ms 19160 KB Output is correct
40 Correct 152 ms 19044 KB Output is correct
41 Correct 196 ms 23408 KB Output is correct