oj.uz

Submission #469218

# Submission time Handle Problem Language Result Execution time Memory
469218 2021-08-31T06:57:06 Z amirmohammad_nezami Beads and wires (APIO14_beads) C++14
100 / 100
 201 ms 22284 KB 
#include <bits/stdc++.h>
using namespace std;

#define F first
#define S second
#define PB push_back
#define _sz(e) e.size()
#define pii pair <int , int>
#define FAST ios::sync_with_stdio(0); cin.tie(0);

const int maxn = 2e5 + 4 , N = 1e6 + 4 , mod = 1e9 + 7 , INF = 1e9;

int n , dp[maxn] , gp[maxn] , zp[maxn];
vector <pii> edges[maxn];

void dfs(int v , int p = -1 , int W = 0) {
    for (auto u : edges[v]) {
        if(u.F != p) dfs(u.F , v , u.S); 
    }
    for (auto u : edges[v]) {
        if(u.F != p) {
            dp[v] += max(dp[u.F] , gp[u.F]);
        }
    }
    for (auto u : edges[v]) {
        if(u.F != p) {
            int others = dp[v] - max(dp[u.F] , gp[u.F]);
            gp[v] = max(gp[v] , dp[u.F] + u.S + W + others);
        }
    }

    zp[v] = dp[v];
    int mx1 = -INF , mx2 = -INF;
    for (auto u : edges[v]) {
        if(u.F != p) {
            int val = dp[u.F] + u.S - max(dp[u.F] , gp[u.F]);
            if(val > mx1) {
                mx2 = mx1; 
                mx1 = val;
            }
            else if(val > mx2) {
                mx2 = val;
            }
        }
    }
    for (auto u : edges[v]) {
        if(u.F != p) {
            int others = dp[v] - max(dp[u.F] , gp[u.F]);
            int val = (mx1 == dp[u.F] + u.S - max(dp[u.F] , gp[u.F]) ? mx2 : mx1);

            zp[v] = max(zp[v] , zp[u.F] + others);
            zp[v] = max(zp[v] , zp[u.F] + u.S + others + val);

            for (auto x : edges[u.F]) {
                if(x.F != v) {
                    int u_others = dp[u.F] - max(dp[x.F] , gp[x.F]);
                    zp[v] = max(zp[v] , zp[x.F] + x.S + u.S + others + u_others);
                }
            }
        }
    }
}

int main() {
    FAST;
    cin >> n;
    for (int i = 0; i < n - 1; ++i) {
        int x , y , z; cin >> x >> y >> z;
        x-- , y--;
        edges[x].PB({y , z});
        edges[y].PB({x , z});
    }
    dfs(0);

    cout << zp[0] << '\n';
}

Subtask #1
13.0 / 13.0

# 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 5024 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 5024 KB Output is correct
6 Correct 3 ms 4940 KB Output is correct
7 Correct 3 ms 5024 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4928 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct

Subtask #2
15.0 / 15.0

# 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 5024 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 5024 KB Output is correct
6 Correct 3 ms 4940 KB Output is correct
7 Correct 3 ms 5024 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4928 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 4 ms 4940 KB Output is correct
17 Correct 4 ms 4940 KB Output is correct
18 Correct 4 ms 4940 KB Output is correct
19 Correct 4 ms 4940 KB Output is correct
20 Correct 3 ms 5020 KB Output is correct
21 Correct 3 ms 5020 KB Output is correct
22 Correct 3 ms 4940 KB Output is correct

Subtask #3
29.0 / 29.0

# 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 5024 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 5024 KB Output is correct
6 Correct 3 ms 4940 KB Output is correct
7 Correct 3 ms 5024 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4928 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 4 ms 4940 KB Output is correct
17 Correct 4 ms 4940 KB Output is correct
18 Correct 4 ms 4940 KB Output is correct
19 Correct 4 ms 4940 KB Output is correct
20 Correct 3 ms 5020 KB Output is correct
21 Correct 3 ms 5020 KB Output is correct
22 Correct 3 ms 4940 KB Output is correct
23 Correct 6 ms 5324 KB Output is correct
24 Correct 6 ms 5324 KB Output is correct
25 Correct 6 ms 5324 KB Output is correct
26 Correct 8 ms 5608 KB Output is correct
27 Correct 9 ms 5668 KB Output is correct
28 Correct 8 ms 5708 KB Output is correct
29 Correct 8 ms 5620 KB Output is correct
30 Correct 8 ms 5580 KB Output is correct
31 Correct 9 ms 5924 KB Output is correct

Subtask #4
43.0 / 43.0

# 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 5024 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 5024 KB Output is correct
6 Correct 3 ms 4940 KB Output is correct
7 Correct 3 ms 5024 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4928 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 4 ms 4940 KB Output is correct
17 Correct 4 ms 4940 KB Output is correct
18 Correct 4 ms 4940 KB Output is correct
19 Correct 4 ms 4940 KB Output is correct
20 Correct 3 ms 5020 KB Output is correct
21 Correct 3 ms 5020 KB Output is correct
22 Correct 3 ms 4940 KB Output is correct
23 Correct 6 ms 5324 KB Output is correct
24 Correct 6 ms 5324 KB Output is correct
25 Correct 6 ms 5324 KB Output is correct
26 Correct 8 ms 5608 KB Output is correct
27 Correct 9 ms 5668 KB Output is correct
28 Correct 8 ms 5708 KB Output is correct
29 Correct 8 ms 5620 KB Output is correct
30 Correct 8 ms 5580 KB Output is correct
31 Correct 9 ms 5924 KB Output is correct
32 Correct 36 ms 8188 KB Output is correct
33 Correct 35 ms 8200 KB Output is correct
34 Correct 33 ms 8244 KB Output is correct
35 Correct 186 ms 18288 KB Output is correct
36 Correct 194 ms 18272 KB Output is correct
37 Correct 186 ms 18540 KB Output is correct
38 Correct 138 ms 18632 KB Output is correct
39 Correct 129 ms 17164 KB Output is correct
40 Correct 148 ms 18556 KB Output is correct
41 Correct 201 ms 22284 KB Output is correct