oj.uz

Submission #344783

# Submission time Handle Problem Language Result Execution time Memory
344783 2021-01-06T14:23:32 Z Sara Beads and wires (APIO14_beads) C++14
100 / 100
 234 ms 30428 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define ll long long int
#define F first
#define S second
#define pb push_back
#define v00 dp[0][0][v]
#define v01 dp[0][1][v]
#define v10 dp[1][0][v]
#define v11 dp[1][1][v]
#define u00 dp[0][0][u]
#define u01 dp[0][1][u]
#define u10 dp[1][0][u]
#define u11 dp[1][1][u]

const ll M = 5;
const ll N = 2e5 + 5;
const ll LOG = 20;
const int MOD = 1e9 + 7;
const ll INF = 1e9 + 5;

ll n, dp[M][M][N];
vector < pair <int, ll> > adj[N]; 

// dp[0][0][v] : (in sub[v] down : 0) && (v up_dn : 0) -> ok : v is emp
// dp[0][1][v] : (in sub[v] down : 0) && (v up_dn : 1) -> ok : v is up_dn
// dp[1][0][v] : (in sub[v] down : 1) && (v up_dn : 0) -> ok : v is dn || v is emp
// dp[1][1][v] : (in sub[v] down : 1) && (v up_dn : 1) -> ok : v is up_dn

void dfs(int v = 1, int p = 0, ll up = -INF){
    v00 = 0;
    v01 = v10 = v11 = -INF;
    ll hlp[] = {0, -INF, -INF, -INF};
    for (auto i : adj[v]){
        int u = i.F;
        ll dn = i.S;
        if (u == p) continue;
        dfs(u, v, i.S); 
        v11 = max({v11 + max(u00, u01), v00 + up + dn + u10});
        v10 = max({v10 + max(u00, u01), v00 + max(u10, u11)});
        v01 = max(v01 + max(u00, u01), v00 + up + dn + u00);
        v00 = v00 + max(u00, u01);
        hlp[3] = max({hlp[3] + max(u00, u01), hlp[2] + dn + u00, hlp[1] + dn + max(u00, u10)});
        hlp[2] = max(hlp[2] + max(u00, u01), hlp[0] + dn + max(u00, u10));
        hlp[1] = max(hlp[1] + max(u00, u01), hlp[0] + dn + u00);
        hlp[0] = hlp[0] + max(u00, u01);
    }
    v10 = max(v10, hlp[3]);
    return;
}

int main() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    cin >> n;
    for (int i = 0; i < n - 1; i ++){
        int u, v, w;
        cin >> u >> v >> w;
        adj[u].pb({v, w});
        adj[v].pb({u, w});
    }
    dfs();
    cout << max(dp[0][0][1], dp[1][0][1]) << '\n';
    return 0;
}
/*
10
4 10 2
1 2 21
1 3 13
6 7 1
7 9 5
2 4 3
2 5 8
1 6 55
6 8 34
*/

Subtask #1
13.0 / 13.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5100 KB Output is correct
2 Correct 4 ms 5100 KB Output is correct
3 Correct 4 ms 5100 KB Output is correct
4 Correct 4 ms 5100 KB Output is correct
5 Correct 4 ms 5100 KB Output is correct
6 Correct 4 ms 5100 KB Output is correct
7 Correct 4 ms 5100 KB Output is correct
8 Correct 4 ms 5100 KB Output is correct
9 Correct 4 ms 5100 KB Output is correct
10 Correct 4 ms 5100 KB Output is correct
11 Correct 4 ms 5100 KB Output is correct
12 Correct 5 ms 5100 KB Output is correct
13 Correct 4 ms 5100 KB Output is correct
14 Correct 4 ms 5100 KB Output is correct
15 Correct 4 ms 5100 KB Output is correct
16 Correct 4 ms 5100 KB Output is correct
17 Correct 4 ms 5100 KB Output is correct
18 Correct 4 ms 5100 KB Output is correct
19 Correct 4 ms 5100 KB Output is correct
20 Correct 4 ms 5100 KB Output is correct
21 Correct 4 ms 5100 KB Output is correct
22 Correct 4 ms 5100 KB Output is correct
23 Correct 6 ms 5484 KB Output is correct
24 Correct 6 ms 5484 KB Output is correct
25 Correct 6 ms 5484 KB Output is correct
26 Correct 9 ms 5996 KB Output is correct
27 Correct 9 ms 5996 KB Output is correct
28 Correct 8 ms 5992 KB Output is correct
29 Correct 8 ms 5996 KB Output is correct
30 Correct 9 ms 6124 KB Output is correct
31 Correct 9 ms 6508 KB Output is correct

Subtask #4
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5100 KB Output is correct
2 Correct 4 ms 5100 KB Output is correct
3 Correct 4 ms 5100 KB Output is correct
4 Correct 4 ms 5100 KB Output is correct
5 Correct 4 ms 5100 KB Output is correct
6 Correct 4 ms 5100 KB Output is correct
7 Correct 4 ms 5100 KB Output is correct
8 Correct 4 ms 5100 KB Output is correct
9 Correct 4 ms 5100 KB Output is correct
10 Correct 4 ms 5100 KB Output is correct
11 Correct 4 ms 5100 KB Output is correct
12 Correct 5 ms 5100 KB Output is correct
13 Correct 4 ms 5100 KB Output is correct
14 Correct 4 ms 5100 KB Output is correct
15 Correct 4 ms 5100 KB Output is correct
16 Correct 4 ms 5100 KB Output is correct
17 Correct 4 ms 5100 KB Output is correct
18 Correct 4 ms 5100 KB Output is correct
19 Correct 4 ms 5100 KB Output is correct
20 Correct 4 ms 5100 KB Output is correct
21 Correct 4 ms 5100 KB Output is correct
22 Correct 4 ms 5100 KB Output is correct
23 Correct 6 ms 5484 KB Output is correct
24 Correct 6 ms 5484 KB Output is correct
25 Correct 6 ms 5484 KB Output is correct
26 Correct 9 ms 5996 KB Output is correct
27 Correct 9 ms 5996 KB Output is correct
28 Correct 8 ms 5992 KB Output is correct
29 Correct 8 ms 5996 KB Output is correct
30 Correct 9 ms 6124 KB Output is correct
31 Correct 9 ms 6508 KB Output is correct
32 Correct 33 ms 9964 KB Output is correct
33 Correct 36 ms 9964 KB Output is correct
34 Correct 38 ms 9964 KB Output is correct
35 Correct 234 ms 25084 KB Output is correct
36 Correct 212 ms 25068 KB Output is correct
37 Correct 207 ms 25068 KB Output is correct
38 Correct 149 ms 24404 KB Output is correct
39 Correct 161 ms 24260 KB Output is correct
40 Correct 165 ms 24520 KB Output is correct
41 Correct 206 ms 30428 KB Output is correct