oj.uz

Submission #198258

# Submission time Handle Problem Language Result Execution time Memory
198258 2020-01-25T09:01:34 Z parsa_mobed Beads and wires (APIO14_beads) C++14
57 / 100
 1000 ms 22736 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("O2")
#pragma GCC optimize ("unroll-loops")

using namespace std;
#define pii pair <int , int>
#define F first
#define S second

const int N = 2e5 + 10, inf = 1e9 + 5;
int dp[N][2], dpU[N][2], par[N], mx[N], E[N][3];
vector <int> g[N];

inline int adj(int v, int i) {return (v^E[i][0]^E[i][1]);}

void dfs(int v, int p = 0)
{
    par[v] = p;
    for (int i : g[v]) if (adj(v, i) != p) {
        dfs(adj(v, i), v);
        mx[adj(v, i)] = max(dp[adj(v, i)][1] + E[i][2], dp[adj(v, i)][0]);
        dp[v][0] += mx[adj(v, i)];
    }
    for (int i : g[v]) if (adj(v, i) != p)
        dp[v][1] = max(dp[v][1], dp[v][0] - mx[adj(v, i)] + dp[adj(v, i)][0] + E[i][2]);
}

void dfsUp(int v, int w = 0)
{
    int p = par[v];
    if (p == 0) dpU[v][0] = 0;
    if (p != 0) {
        dpU[v][0] = dpU[p][0] + dp[p][0] - mx[v];
        for (int i : g[p]) if (adj(p, i) != v && adj(p, i) != par[p])
            dpU[v][0] = max(dpU[v][0], dpU[p][0] + dp[p][0] - mx[adj(p, i)] + dp[adj(p, i)][0] + E[i][2] - mx[v] + w);
        dpU[v][0] = max(dpU[v][0], dpU[p][1] + dp[p][0] - mx[v] + w);
        dpU[v][1] = dpU[p][0] + dp[p][0] - mx[v] + w;
    }
    for (int i : g[v]) if (adj(v, i) != p) dfsUp(adj(v, i), E[i][2]);
}

int32_t main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int n; cin >> n;
    for (int i = 0; i < n - 1; i++) {
        cin >> E[i][0] >> E[i][1] >> E[i][2];
        g[E[i][0]].push_back(i);
        g[E[i][1]].push_back(i);
    }
    for (int i = 1; i <= n; i++) dp[i][1] = dpU[i][1] = -inf;
    dfs(1), dfsUp(1);
    int ans = 0;
    for (int i = 1; i <= n; i++) ans = max(ans, dp[i][0] + dpU[i][0]);
    printf("%d", ans);

    return 0;
}

Subtask #1
13.0 / 13.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 6 ms 4984 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 7 ms 5112 KB Output is correct
5 Correct 6 ms 5112 KB Output is correct
6 Correct 6 ms 5112 KB Output is correct
7 Correct 12 ms 5112 KB Output is correct
8 Correct 6 ms 5112 KB Output is correct
9 Correct 6 ms 5112 KB Output is correct
10 Correct 7 ms 5112 KB Output is correct
11 Correct 6 ms 4988 KB Output is correct
12 Correct 6 ms 5112 KB Output is correct
13 Correct 7 ms 5112 KB Output is correct
14 Correct 6 ms 5116 KB Output is correct
15 Correct 7 ms 5112 KB Output is correct
16 Correct 7 ms 5112 KB Output is correct
17 Correct 7 ms 5116 KB Output is correct
18 Correct 6 ms 5112 KB Output is correct
19 Correct 10 ms 5084 KB Output is correct
20 Correct 6 ms 5112 KB Output is correct
21 Correct 7 ms 5112 KB Output is correct
22 Correct 6 ms 5112 KB Output is correct
23 Correct 10 ms 5496 KB Output is correct
24 Correct 10 ms 5496 KB Output is correct
25 Correct 10 ms 5496 KB Output is correct
26 Correct 14 ms 5932 KB Output is correct
27 Correct 14 ms 5880 KB Output is correct
28 Correct 353 ms 6008 KB Output is correct
29 Correct 192 ms 6008 KB Output is correct
30 Correct 169 ms 6008 KB Output is correct
31 Correct 89 ms 6284 KB Output is correct

Subtask #4
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 6 ms 4984 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 7 ms 5112 KB Output is correct
5 Correct 6 ms 5112 KB Output is correct
6 Correct 6 ms 5112 KB Output is correct
7 Correct 12 ms 5112 KB Output is correct
8 Correct 6 ms 5112 KB Output is correct
9 Correct 6 ms 5112 KB Output is correct
10 Correct 7 ms 5112 KB Output is correct
11 Correct 6 ms 4988 KB Output is correct
12 Correct 6 ms 5112 KB Output is correct
13 Correct 7 ms 5112 KB Output is correct
14 Correct 6 ms 5116 KB Output is correct
15 Correct 7 ms 5112 KB Output is correct
16 Correct 7 ms 5112 KB Output is correct
17 Correct 7 ms 5116 KB Output is correct
18 Correct 6 ms 5112 KB Output is correct
19 Correct 10 ms 5084 KB Output is correct
20 Correct 6 ms 5112 KB Output is correct
21 Correct 7 ms 5112 KB Output is correct
22 Correct 6 ms 5112 KB Output is correct
23 Correct 10 ms 5496 KB Output is correct
24 Correct 10 ms 5496 KB Output is correct
25 Correct 10 ms 5496 KB Output is correct
26 Correct 14 ms 5932 KB Output is correct
27 Correct 14 ms 5880 KB Output is correct
28 Correct 353 ms 6008 KB Output is correct
29 Correct 192 ms 6008 KB Output is correct
30 Correct 169 ms 6008 KB Output is correct
31 Correct 89 ms 6284 KB Output is correct
32 Correct 61 ms 9360 KB Output is correct
33 Correct 59 ms 9240 KB Output is correct
34 Correct 81 ms 9412 KB Output is correct
35 Correct 412 ms 21988 KB Output is correct
36 Correct 359 ms 22136 KB Output is correct
37 Correct 287 ms 22136 KB Output is correct
38 Execution timed out 1066 ms 22736 KB Time limit exceeded
39 Halted 0 ms 0 KB -