oj.uz

Submission #546248

# Submission time Handle Problem Language Result Execution time Memory
546248 2022-04-06T20:28:28 Z Ooops_sorry Beads and wires (APIO14_beads) C++14
100 / 100
 230 ms 42060 KB 
#include<bits/stdc++.h>

using namespace std;

#define int long long
#define pb push_back
#define ld double
#define ll __int128

mt19937 rnd(51);

const int N = 2e5 + 10, INF = 1e18;
vector<pair<int,int>> g[N];
int res[N][2][2];

void dfs(int v, int p) {
    bool was = 0;
    vector<vector<int>> dp(3, vector<int>(3, -INF));
    dp[0][0] = 0;
    for (auto [to, c] : g[v]) {
        if (to != p) {
            dfs(to, v);
            was = 1;
            vector<vector<int>> dpp(3, vector<int>(3, -INF));
            for (int j = 0; j < 3; j++) {
                for (int k = 0; k < 3; k++) {
                    if (dp[j][k] == -INF) continue;
                    dpp[j][k] = max({dpp[j][k], dp[j][k] + res[to][1][1] + c, dp[j][k] + res[to][1][0]});
                    if (j + 1 < 3) {
                        if (k != 1) dpp[j + 1][k] = max(dpp[j + 1][k], dp[j][k] + res[to][1][0] + c);
                    }
                    if (k == 0) {
                        if (j == 0) {
                            dpp[j][1] = max(dpp[j][1], dp[j][k] + res[to][0][0]);
                            dpp[j][1] = max(dpp[j][1], dp[j][k] + res[to][0][1] + c);
                        }
                        if (j + 1 < 3) {
                            dpp[j + 1][2] = max(dpp[j + 1][2], dp[j][k] + res[to][0][0] + c);
                        }
                    }
                }
            }
            swap(dp, dpp);
        }
    }
    if (!was) {
        res[v][0][0] = res[v][0][1] = res[v][1][1] = -INF;
        res[v][1][0] = 0;
    } else {
        res[v][1][1] = dp[1][0];
        res[v][1][0] = dp[0][0];
        res[v][0][0] = max({dp[0][1], dp[2][0], dp[2][1], dp[2][2]});
        res[v][0][1] = dp[1][2];
    }
}

signed main() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
#endif // LOCAL
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin >> n;
    for (int i = 0; i < n - 1; i++) {
        int a, b, c;
        cin >> a >> b >> c;
        a--, b--;
        g[a].pb({b, c});
        g[b].pb({a, c});
    }
    dfs(0, -1);
    cout << max(res[0][0][0], res[0][1][0]) << endl;
    return 0;
}

Compilation message

beads.cpp: In function 'void dfs(long long int, long long int)':
beads.cpp:20:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   20 |     for (auto [to, c] : g[v]) {
      |               ^

Subtask #1
13.0 / 13.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 4 ms 4948 KB Output is correct
3 Correct 3 ms 5076 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 5036 KB Output is correct
11 Correct 3 ms 5036 KB Output is correct
12 Correct 3 ms 5032 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 5040 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 5032 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 5032 KB Output is correct
21 Correct 3 ms 5032 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 6 ms 5460 KB Output is correct
24 Correct 6 ms 5432 KB Output is correct
25 Correct 6 ms 5428 KB Output is correct
26 Correct 9 ms 5952 KB Output is correct
27 Correct 9 ms 5972 KB Output is correct
28 Correct 9 ms 5968 KB Output is correct
29 Correct 9 ms 5972 KB Output is correct
30 Correct 9 ms 5940 KB Output is correct
31 Correct 11 ms 7508 KB Output is correct

Subtask #4
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 4 ms 4948 KB Output is correct
3 Correct 3 ms 5076 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 5036 KB Output is correct
11 Correct 3 ms 5036 KB Output is correct
12 Correct 3 ms 5032 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 5040 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 5032 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 5032 KB Output is correct
21 Correct 3 ms 5032 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 6 ms 5460 KB Output is correct
24 Correct 6 ms 5432 KB Output is correct
25 Correct 6 ms 5428 KB Output is correct
26 Correct 9 ms 5952 KB Output is correct
27 Correct 9 ms 5972 KB Output is correct
28 Correct 9 ms 5968 KB Output is correct
29 Correct 9 ms 5972 KB Output is correct
30 Correct 9 ms 5940 KB Output is correct
31 Correct 11 ms 7508 KB Output is correct
32 Correct 44 ms 9920 KB Output is correct
33 Correct 44 ms 9804 KB Output is correct
34 Correct 38 ms 9932 KB Output is correct
35 Correct 225 ms 25060 KB Output is correct
36 Correct 230 ms 25008 KB Output is correct
37 Correct 211 ms 25072 KB Output is correct
38 Correct 181 ms 24368 KB Output is correct
39 Correct 162 ms 24232 KB Output is correct
40 Correct 167 ms 24264 KB Output is correct
41 Correct 230 ms 42060 KB Output is correct