oj.uz

Submission #145290

# Submission time Handle Problem Language Result Execution time Memory
145290 2019-08-19T14:08:27 Z dolphingarlic Beads and wires (APIO14_beads) C++14
100 / 100
 467 ms 32868 KB 
#include <bits/stdc++.h>
#pragma GCC Optimize("O3")
#define FOR(i, x, y) for (int i = x; i < y; i++)
#define MOD 1000000007
typedef long long ll;
using namespace std;

#define N 234567
#define mp make_pair
#define pb push_back
#define INF 1000000000000LL

int n, a, b;
ll w, pw[N], dp[N][2][2];
vector<pair<int, ll> > al[N];
void dfs(int node, int par) {
    if (al[node].size() == 1 && par != -1) return;
    ll sc = 0, bst_mid = -INF, bst_unuse_mid = -INF, bst_unuse_mid2 = -INF,
       bst_unuse_nomid = -INF, bst_unuse_nomid2 = -INF;
    int bst_unuse_mid_child, bst_unuse_mid_child2, bst_unuse_nomid_child,
        bst_unuse_nomid_child2;
    for (int i = 0; i < al[node].size(); i++)
        if (al[node][i].first != par) {
            int child = al[node][i].first;
            ll edge = al[node][i].second;
            pw[child] = edge;
            dfs(child, node);
            ll normsc = max(dp[child][0][0], dp[child][1][0]);
            sc += normsc;
            ll midsc = max(dp[child][0][1], dp[child][1][1]) - normsc;
            if (midsc > bst_mid) bst_mid = midsc;
            ll unuse_midsc = dp[child][0][1] + edge - normsc;
            if (unuse_midsc > bst_unuse_mid) {
                bst_unuse_mid2 = bst_unuse_mid;
                bst_unuse_mid_child2 = bst_unuse_mid_child;
                bst_unuse_mid = unuse_midsc;
                bst_unuse_mid_child = child;
            } else if (unuse_midsc > bst_unuse_mid2) {
                bst_unuse_mid2 = unuse_midsc;
                bst_unuse_mid_child2 = child;
            }
            ll unuse_nomidsc = dp[child][0][0] + edge - normsc;
            if (unuse_nomidsc > bst_unuse_nomid) {
                bst_unuse_nomid2 = bst_unuse_nomid;
                bst_unuse_nomid_child2 = bst_unuse_nomid_child;
                bst_unuse_nomid = unuse_nomidsc;
                bst_unuse_nomid_child = child;
            } else if (unuse_nomidsc > bst_unuse_nomid2) {
                bst_unuse_nomid2 = unuse_nomidsc;
                bst_unuse_nomid_child2 = child;
            }
        }
    dp[node][0][0] = sc;
    dp[node][0][1] = sc + max(0LL, bst_mid);
    dp[node][0][1] =
        max(dp[node][0][1], sc + bst_unuse_nomid + bst_unuse_nomid2);
    if (bst_unuse_mid_child != bst_unuse_nomid_child)
        dp[node][0][1] =
            max(dp[node][0][1], sc + bst_unuse_nomid + bst_unuse_mid);
    else {
        dp[node][0][1] =
            max(dp[node][0][1], sc + bst_unuse_nomid2 + bst_unuse_mid);
        dp[node][0][1] =
            max(dp[node][0][1], sc + bst_unuse_nomid + bst_unuse_mid2);
    }

    dp[node][1][0] = sc + pw[node] + bst_unuse_nomid;
    dp[node][1][1] = sc + pw[node] + bst_unuse_mid;
}

int main() {
    cin >> n;
    for (int i = 0; i < n - 1; i++) {
        cin >> a >> b >> w;
        al[a].pb(mp(b, w));
        al[b].pb(mp(a, w));
    }
    dfs(1, -1);

    cout << max(dp[1][0][1], dp[1][0][0]) << '\n';
    return 0;
}

Compilation message

beads.cpp:2:0: warning: ignoring #pragma GCC Optimize [-Wunknown-pragmas]
 #pragma GCC Optimize("O3")
 
beads.cpp: In function 'void dfs(int, int)':
beads.cpp:22:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < al[node].size(); i++)
                     ~~^~~~~~~~~~~~~~~~~
beads.cpp:20:30: warning: variable 'bst_unuse_mid_child2' set but not used [-Wunused-but-set-variable]
     int bst_unuse_mid_child, bst_unuse_mid_child2, bst_unuse_nomid_child,
                              ^~~~~~~~~~~~~~~~~~~~
beads.cpp:21:9: warning: variable 'bst_unuse_nomid_child2' set but not used [-Wunused-but-set-variable]
         bst_unuse_nomid_child2;
         ^~~~~~~~~~~~~~~~~~~~~~
beads.cpp:57:5: warning: 'bst_unuse_nomid_child' may be used uninitialized in this function [-Wmaybe-uninitialized]
     if (bst_unuse_mid_child != bst_unuse_nomid_child)
     ^~
beads.cpp:57:5: warning: 'bst_unuse_mid_child' may be used uninitialized in this function [-Wmaybe-uninitialized]

Subtask #1
13.0 / 13.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 5880 KB Output is correct
2 Correct 7 ms 5880 KB Output is correct
3 Correct 7 ms 5880 KB Output is correct
4 Correct 7 ms 5880 KB Output is correct
5 Correct 7 ms 5880 KB Output is correct
6 Correct 7 ms 5880 KB Output is correct
7 Correct 7 ms 6008 KB Output is correct
8 Correct 7 ms 5880 KB Output is correct
9 Correct 7 ms 5880 KB Output is correct
10 Correct 7 ms 5880 KB Output is correct
11 Correct 7 ms 5880 KB Output is correct
12 Correct 7 ms 6008 KB Output is correct
13 Correct 9 ms 6008 KB Output is correct
14 Correct 7 ms 5880 KB Output is correct
15 Correct 9 ms 5880 KB Output is correct
16 Correct 9 ms 5852 KB Output is correct
17 Correct 7 ms 5880 KB Output is correct
18 Correct 9 ms 5880 KB Output is correct
19 Correct 7 ms 5880 KB Output is correct
20 Correct 7 ms 5880 KB Output is correct
21 Correct 9 ms 5876 KB Output is correct
22 Correct 8 ms 5880 KB Output is correct
23 Correct 15 ms 6520 KB Output is correct
24 Correct 17 ms 6392 KB Output is correct
25 Correct 18 ms 6392 KB Output is correct
26 Correct 25 ms 6908 KB Output is correct
27 Correct 27 ms 6904 KB Output is correct
28 Correct 27 ms 6900 KB Output is correct
29 Correct 26 ms 6520 KB Output is correct
30 Correct 26 ms 6904 KB Output is correct
31 Correct 29 ms 7416 KB Output is correct

Subtask #4
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 5880 KB Output is correct
2 Correct 7 ms 5880 KB Output is correct
3 Correct 7 ms 5880 KB Output is correct
4 Correct 7 ms 5880 KB Output is correct
5 Correct 7 ms 5880 KB Output is correct
6 Correct 7 ms 5880 KB Output is correct
7 Correct 7 ms 6008 KB Output is correct
8 Correct 7 ms 5880 KB Output is correct
9 Correct 7 ms 5880 KB Output is correct
10 Correct 7 ms 5880 KB Output is correct
11 Correct 7 ms 5880 KB Output is correct
12 Correct 7 ms 6008 KB Output is correct
13 Correct 9 ms 6008 KB Output is correct
14 Correct 7 ms 5880 KB Output is correct
15 Correct 9 ms 5880 KB Output is correct
16 Correct 9 ms 5852 KB Output is correct
17 Correct 7 ms 5880 KB Output is correct
18 Correct 9 ms 5880 KB Output is correct
19 Correct 7 ms 5880 KB Output is correct
20 Correct 7 ms 5880 KB Output is correct
21 Correct 9 ms 5876 KB Output is correct
22 Correct 8 ms 5880 KB Output is correct
23 Correct 15 ms 6520 KB Output is correct
24 Correct 17 ms 6392 KB Output is correct
25 Correct 18 ms 6392 KB Output is correct
26 Correct 25 ms 6908 KB Output is correct
27 Correct 27 ms 6904 KB Output is correct
28 Correct 27 ms 6900 KB Output is correct
29 Correct 26 ms 6520 KB Output is correct
30 Correct 26 ms 6904 KB Output is correct
31 Correct 29 ms 7416 KB Output is correct
32 Correct 114 ms 11176 KB Output is correct
33 Correct 102 ms 11100 KB Output is correct
34 Correct 116 ms 11216 KB Output is correct
35 Correct 461 ms 27632 KB Output is correct
36 Correct 467 ms 27536 KB Output is correct
37 Correct 458 ms 27528 KB Output is correct
38 Correct 409 ms 26864 KB Output is correct
39 Correct 374 ms 20552 KB Output is correct
40 Correct 408 ms 26712 KB Output is correct
41 Correct 451 ms 32868 KB Output is correct