Submission #135293

# Submission time Handle Problem Language Result Execution time Memory
135293 2019-07-24T02:31:16 Z fredbr Beads and wires (APIO14_beads) C++17
57 / 100
472 ms 69788 KB
#include <bits/stdc++.h>
 
#pragma GCC optimize("O3")
 
using namespace std;
 
int const maxn = 303030;
int const inf = 0x3f3f3f3f;

struct Edge {
    int u, w, id;
};
 
struct FEdge {
    int a, b, w;
};

vector<Edge> v[maxn];
vector<FEdge> eg;

int dp[4*maxn][2];

inline int invalid(int x, int p) {
    return v[x].size() == 1;
}
 
int solve(int id, int t = 0) {
    int x = eg[id].b;
    int p = eg[id].a;

    if (dp[id][t] >= 0) return dp[id][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.id, 1) + e.w, solve(e.id, 0));
            }
        }
    }
    else {
        int sum = solve(id, 0);
 
        for (Edge const& e : v[x]) {
            if (e.u == p) continue;
 
            if (!invalid(e.u, x))
                d = max(d, sum - max(solve(e.id, 1) + e.w, solve(e.id, 0))
                           + e.w + solve(e.id, 0));
            else
                d = max(d, sum + e.w);
        }
    }
 
    return dp[id][t] = d;
}
 
int main() {
    memset(dp, -1, sizeof(dp));

    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, i*2});
        v[b].push_back({a, w, i*2+1});

        eg.push_back({a, b, w});
        eg.push_back({b, a, w});
    }

    for (int i = 1; i <= n; i++) {
        v[i+n].push_back({i, -inf, 2*n - 3 + i});
        eg.push_back({i+n, i, -inf});
    }

    int ans = 0;
    for (int i = 2*n-2; i < 3*n-2; i++) {
        ans = max(ans, solve(i));
    }

    cout << ans << "\n";
}
# Verdict Execution time Memory Grader output
1 Correct 16 ms 16892 KB Output is correct
2 Correct 16 ms 16888 KB Output is correct
3 Correct 16 ms 17016 KB Output is correct
4 Correct 16 ms 16888 KB Output is correct
5 Correct 16 ms 17016 KB Output is correct
6 Correct 16 ms 17016 KB Output is correct
7 Correct 16 ms 16932 KB Output is correct
8 Correct 16 ms 17016 KB Output is correct
9 Correct 16 ms 17016 KB Output is correct
10 Correct 16 ms 16888 KB Output is correct
11 Correct 16 ms 16888 KB Output is correct
12 Correct 16 ms 16888 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 16 ms 16892 KB Output is correct
2 Correct 16 ms 16888 KB Output is correct
3 Correct 16 ms 17016 KB Output is correct
4 Correct 16 ms 16888 KB Output is correct
5 Correct 16 ms 17016 KB Output is correct
6 Correct 16 ms 17016 KB Output is correct
7 Correct 16 ms 16932 KB Output is correct
8 Correct 16 ms 17016 KB Output is correct
9 Correct 16 ms 17016 KB Output is correct
10 Correct 16 ms 16888 KB Output is correct
11 Correct 16 ms 16888 KB Output is correct
12 Correct 16 ms 16888 KB Output is correct
13 Correct 16 ms 16888 KB Output is correct
14 Correct 16 ms 16888 KB Output is correct
15 Correct 16 ms 16888 KB Output is correct
16 Correct 16 ms 16888 KB Output is correct
17 Correct 16 ms 16892 KB Output is correct
18 Correct 16 ms 17016 KB Output is correct
19 Correct 17 ms 16888 KB Output is correct
20 Correct 17 ms 17016 KB Output is correct
21 Correct 17 ms 17016 KB Output is correct
22 Correct 17 ms 17020 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 16 ms 16892 KB Output is correct
2 Correct 16 ms 16888 KB Output is correct
3 Correct 16 ms 17016 KB Output is correct
4 Correct 16 ms 16888 KB Output is correct
5 Correct 16 ms 17016 KB Output is correct
6 Correct 16 ms 17016 KB Output is correct
7 Correct 16 ms 16932 KB Output is correct
8 Correct 16 ms 17016 KB Output is correct
9 Correct 16 ms 17016 KB Output is correct
10 Correct 16 ms 16888 KB Output is correct
11 Correct 16 ms 16888 KB Output is correct
12 Correct 16 ms 16888 KB Output is correct
13 Correct 16 ms 16888 KB Output is correct
14 Correct 16 ms 16888 KB Output is correct
15 Correct 16 ms 16888 KB Output is correct
16 Correct 16 ms 16888 KB Output is correct
17 Correct 16 ms 16892 KB Output is correct
18 Correct 16 ms 17016 KB Output is correct
19 Correct 17 ms 16888 KB Output is correct
20 Correct 17 ms 17016 KB Output is correct
21 Correct 17 ms 17016 KB Output is correct
22 Correct 17 ms 17020 KB Output is correct
23 Correct 22 ms 17528 KB Output is correct
24 Correct 21 ms 17528 KB Output is correct
25 Correct 21 ms 17528 KB Output is correct
26 Correct 26 ms 18036 KB Output is correct
27 Correct 26 ms 18096 KB Output is correct
28 Correct 472 ms 18100 KB Output is correct
29 Correct 223 ms 18100 KB Output is correct
30 Correct 276 ms 18100 KB Output is correct
31 Correct 181 ms 18484 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 16 ms 16892 KB Output is correct
2 Correct 16 ms 16888 KB Output is correct
3 Correct 16 ms 17016 KB Output is correct
4 Correct 16 ms 16888 KB Output is correct
5 Correct 16 ms 17016 KB Output is correct
6 Correct 16 ms 17016 KB Output is correct
7 Correct 16 ms 16932 KB Output is correct
8 Correct 16 ms 17016 KB Output is correct
9 Correct 16 ms 17016 KB Output is correct
10 Correct 16 ms 16888 KB Output is correct
11 Correct 16 ms 16888 KB Output is correct
12 Correct 16 ms 16888 KB Output is correct
13 Correct 16 ms 16888 KB Output is correct
14 Correct 16 ms 16888 KB Output is correct
15 Correct 16 ms 16888 KB Output is correct
16 Correct 16 ms 16888 KB Output is correct
17 Correct 16 ms 16892 KB Output is correct
18 Correct 16 ms 17016 KB Output is correct
19 Correct 17 ms 16888 KB Output is correct
20 Correct 17 ms 17016 KB Output is correct
21 Correct 17 ms 17016 KB Output is correct
22 Correct 17 ms 17020 KB Output is correct
23 Correct 22 ms 17528 KB Output is correct
24 Correct 21 ms 17528 KB Output is correct
25 Correct 21 ms 17528 KB Output is correct
26 Correct 26 ms 18036 KB Output is correct
27 Correct 26 ms 18096 KB Output is correct
28 Correct 472 ms 18100 KB Output is correct
29 Correct 223 ms 18100 KB Output is correct
30 Correct 276 ms 18100 KB Output is correct
31 Correct 181 ms 18484 KB Output is correct
32 Correct 93 ms 23124 KB Output is correct
33 Correct 75 ms 23080 KB Output is correct
34 Correct 76 ms 23216 KB Output is correct
35 Runtime error 225 ms 69788 KB Execution killed with signal 11 (could be triggered by violating memory limits)
36 Halted 0 ms 0 KB -