oj.uz

Submission #135210

# Submission time Handle Problem Language Result Execution time Memory
135210 2019-07-23T20:11:04 Z fredbr Beads and wires (APIO14_beads) C++17
28 / 100
 1000 ms 1272 KB 
#include <bits/stdc++.h>
 
#pragma GCC optimize("O3")
 
using namespace std;
 
int const maxn = 10001;
 
struct Edge {
    int u, w, id;
};
 
struct FEdge {
    int a, b, w;
};

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

int dp[2*maxn][2];

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

    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.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[x][t] = d;
}
 
inline int test(int x) {
    memset(dp, -1, sizeof(dp));
 
    return max(solve(x), solve(x, 1) + eg[x].w);
}
 
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, i*2});
        v[b].push_back({a, w, i*2+1});

        eg.push_back({a, b, w});
        eg.push_back({b, a, w});
    }
 
    int ans = 0;
    for (int i = 0; i < 2*n - 2; i++)
        ans = max(ans, test(i));
 
    cout << ans << "\n";
}

Subtask #1
13.0 / 13.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 760 KB Output is correct
2 Correct 3 ms 760 KB Output is correct
3 Correct 3 ms 760 KB Output is correct
4 Correct 3 ms 760 KB Output is correct
5 Correct 3 ms 760 KB Output is correct
6 Correct 3 ms 760 KB Output is correct
7 Correct 2 ms 760 KB Output is correct
8 Correct 2 ms 760 KB Output is correct
9 Correct 2 ms 760 KB Output is correct
10 Correct 3 ms 760 KB Output is correct
11 Correct 2 ms 748 KB Output is correct
12 Correct 2 ms 760 KB Output is correct
13 Correct 4 ms 760 KB Output is correct
14 Correct 4 ms 760 KB Output is correct
15 Correct 4 ms 760 KB Output is correct
16 Correct 7 ms 760 KB Output is correct
17 Correct 7 ms 760 KB Output is correct
18 Correct 7 ms 760 KB Output is correct
19 Correct 7 ms 732 KB Output is correct
20 Correct 6 ms 764 KB Output is correct
21 Correct 7 ms 760 KB Output is correct
22 Correct 6 ms 760 KB Output is correct
23 Execution timed out 1064 ms 1272 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #4
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 760 KB Output is correct
2 Correct 3 ms 760 KB Output is correct
3 Correct 3 ms 760 KB Output is correct
4 Correct 3 ms 760 KB Output is correct
5 Correct 3 ms 760 KB Output is correct
6 Correct 3 ms 760 KB Output is correct
7 Correct 2 ms 760 KB Output is correct
8 Correct 2 ms 760 KB Output is correct
9 Correct 2 ms 760 KB Output is correct
10 Correct 3 ms 760 KB Output is correct
11 Correct 2 ms 748 KB Output is correct
12 Correct 2 ms 760 KB Output is correct
13 Correct 4 ms 760 KB Output is correct
14 Correct 4 ms 760 KB Output is correct
15 Correct 4 ms 760 KB Output is correct
16 Correct 7 ms 760 KB Output is correct
17 Correct 7 ms 760 KB Output is correct
18 Correct 7 ms 760 KB Output is correct
19 Correct 7 ms 732 KB Output is correct
20 Correct 6 ms 764 KB Output is correct
21 Correct 7 ms 760 KB Output is correct
22 Correct 6 ms 760 KB Output is correct
23 Execution timed out 1064 ms 1272 KB Time limit exceeded
24 Halted 0 ms 0 KB -