oj.uz

Submission #135081

# Submission time Handle Problem Language Result Execution time Memory
135081 2019-07-23T15:39:09 Z fredbr Beads and wires (APIO14_beads) C++17
28 / 100
 1000 ms 1144 KB 
#include <bits/stdc++.h>

#pragma GCC optimize("O3")

using namespace std;

int const maxn = 10001;

struct Edge {
    int u, w;
};

vector<Edge> v[maxn];

int dp[maxn][2];

inline int invalid(int x, int p) {
    return v[x].size() == 1 and v[x].front().u == p;
}

int solve(int x, int p = -1, int t = 0) {
    if (dp[x][t] >= 0) return dp[x][t];

    int d = 0;

    if (t == 0) {
        for (Edge const& e : v[x]) {
            if (e.u == p) continue;

            if (!invalid(e.u, x)) {
                d += max(solve(e.u, x, 1) + e.w, solve(e.u, x, 0));
            }
        }
    }
    else {
        int sum = solve(x, p, 0);

        for (Edge const& e : v[x]) {
            if (e.u == p) continue;

            if (!invalid(e.u, x))
                d = max(d, sum - max(solve(e.u, x, 1) + e.w, solve(e.u, x, 0))
                           + e.w + solve(e.u, x, 0));
            else
                d = max(d, sum + e.w);
        }
    }

    return dp[x][t] = d;
}

inline int test(int x) {
    memset(dp, -1, sizeof(dp));

    return solve(x);
}

int main() {
    ios::sync_with_stdio(false), cin.tie(nullptr);

    int n;
    cin >> n;

    for (int i = 0; i < n-1; i++) {
        int a, b, w;
        cin >> a >> b >> w;

        v[a].push_back({b, w});
        v[b].push_back({a, w});
    }

    int ans = 0;
    for (int i = 1; i <= n; i++)
        if (v[i].size() == 1)
            ans = max(ans, test(i));

    cout << ans << "\n";
}

Subtask #1
13.0 / 13.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 2 ms 632 KB Output is correct
3 Correct 2 ms 632 KB Output is correct
4 Correct 2 ms 632 KB Output is correct
5 Correct 2 ms 632 KB Output is correct
6 Correct 2 ms 636 KB Output is correct
7 Correct 2 ms 632 KB Output is correct
8 Correct 2 ms 632 KB Output is correct
9 Correct 2 ms 632 KB Output is correct
10 Correct 2 ms 636 KB Output is correct
11 Correct 2 ms 632 KB Output is correct
12 Correct 2 ms 632 KB Output is correct
13 Correct 3 ms 632 KB Output is correct
14 Correct 3 ms 632 KB Output is correct
15 Correct 3 ms 632 KB Output is correct
16 Correct 3 ms 632 KB Output is correct
17 Correct 3 ms 636 KB Output is correct
18 Correct 3 ms 632 KB Output is correct
19 Correct 3 ms 632 KB Output is correct
20 Correct 3 ms 652 KB Output is correct
21 Correct 3 ms 636 KB Output is correct
22 Correct 3 ms 632 KB Output is correct
23 Correct 553 ms 980 KB Output is correct
24 Correct 552 ms 1016 KB Output is correct
25 Correct 552 ms 1016 KB Output is correct
26 Execution timed out 1044 ms 1144 KB Time limit exceeded
27 Halted 0 ms 0 KB -

Subtask #4
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 2 ms 632 KB Output is correct
3 Correct 2 ms 632 KB Output is correct
4 Correct 2 ms 632 KB Output is correct
5 Correct 2 ms 632 KB Output is correct
6 Correct 2 ms 636 KB Output is correct
7 Correct 2 ms 632 KB Output is correct
8 Correct 2 ms 632 KB Output is correct
9 Correct 2 ms 632 KB Output is correct
10 Correct 2 ms 636 KB Output is correct
11 Correct 2 ms 632 KB Output is correct
12 Correct 2 ms 632 KB Output is correct
13 Correct 3 ms 632 KB Output is correct
14 Correct 3 ms 632 KB Output is correct
15 Correct 3 ms 632 KB Output is correct
16 Correct 3 ms 632 KB Output is correct
17 Correct 3 ms 636 KB Output is correct
18 Correct 3 ms 632 KB Output is correct
19 Correct 3 ms 632 KB Output is correct
20 Correct 3 ms 652 KB Output is correct
21 Correct 3 ms 636 KB Output is correct
22 Correct 3 ms 632 KB Output is correct
23 Correct 553 ms 980 KB Output is correct
24 Correct 552 ms 1016 KB Output is correct
25 Correct 552 ms 1016 KB Output is correct
26 Execution timed out 1044 ms 1144 KB Time limit exceeded
27 Halted 0 ms 0 KB -