oj.uz

Submission #348344

# Submission time Handle Problem Language Result Execution time Memory
348344 2021-01-14T17:05:18 Z parsabahrami Beads and wires (APIO14_beads) C++17
100 / 100
 216 ms 30556 KB 
// Call my Name and Save me from The Dark
#include <bits/stdc++.h>
 
using namespace std;

typedef long long int ll;
typedef pair<int, ll> pii;
 
#define SZ(x)                       (int) x.size()
#define F                           first
#define S                           second

const int N = 2e5 + 10, MOD = 1e9 + 7;
ll dp[2][2][N], shit[N]; int n;
vector<pii> adj[N];

void DFS(int v, int p = -1) {
    dp[0][0][v] = 0, dp[1][0][v] = dp[0][1][v] = dp[1][1][v] = shit[v] = -MOD;
    for (pii u : adj[v]) {
        if (u.F != p) DFS(u.F, v);
    }
    for (pii u : adj[v]) {
        if (u.F != p) {
            //printf("%d %lld %lld %lld %lld %lld\n", v, dp[0][0][v], dp[0][1][v], dp[1][0][v], dp[1][1][v], shit[v]);
            int x11 = dp[1][1][v], x01 = dp[0][1][v], x10 = dp[1][0][v], x00 = dp[0][0][v], sv = shit[v];
            dp[0][0][v] += max(dp[0][0][u.F], dp[0][1][u.F] + u.S);
            dp[0][1][v] = max(x01 + max(dp[0][0][u.F], dp[0][1][u.F] + u.S), x00 + dp[0][0][u.F] + u.S);
            dp[1][0][v] = max({x00 + max(dp[1][0][u.F], dp[1][1][u.F] + u.S), u.S + x01 + max(dp[0][0][u.F], dp[1][0][u.F]), x10 + max(dp[0][0][u.F], dp[0][1][u.F] + u.S)});
            dp[1][0][v] = max(dp[1][0][v], x11 + u.S + dp[0][0][u.F]);
            dp[1][1][v] = max(u.S + x00 + dp[1][0][u.F], x11 + max(dp[0][0][u.F], dp[0][1][u.F] + u.S));
            shit[v] = max(sv + max(dp[0][0][u.F], dp[0][1][u.F] + u.S), x00 + max(dp[1][0][u.F], dp[1][1][u.F] + u.S));
        }
    }
    //printf("%d %lld %lld %lld %lld %lld\n", v, dp[0][0][v], dp[0][1][v], dp[1][0][v], dp[1][1][v], shit[v]);
}

int main() {
    scanf("%d", &n);
    for (int i = 1; i < n; i++) {
        int u, v; ll w; scanf("%d%d%lld", &u, &v, &w);
        adj[u].push_back({v, w});
        adj[v].push_back({u, w});
    }
    DFS(1);
    printf("%lld\n", max({dp[1][0][1], dp[0][0][1], shit[1]}));
    return 0;
}

Compilation message

beads.cpp: In function 'int main()':
beads.cpp:38:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   38 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
beads.cpp:40:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   40 |         int u, v; ll w; scanf("%d%d%lld", &u, &v, &w);
      |                         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5100 KB Output is correct
2 Correct 4 ms 5100 KB Output is correct
3 Correct 3 ms 5100 KB Output is correct
4 Correct 5 ms 5100 KB Output is correct
5 Correct 4 ms 5100 KB Output is correct
6 Correct 4 ms 5100 KB Output is correct
7 Correct 3 ms 5100 KB Output is correct
8 Correct 4 ms 5100 KB Output is correct
9 Correct 4 ms 5100 KB Output is correct
10 Correct 4 ms 5100 KB Output is correct
11 Correct 3 ms 5100 KB Output is correct
12 Correct 4 ms 5100 KB Output is correct
13 Correct 4 ms 5100 KB Output is correct
14 Correct 4 ms 5100 KB Output is correct
15 Correct 4 ms 5100 KB Output is correct
16 Correct 4 ms 5228 KB Output is correct
17 Correct 4 ms 5248 KB Output is correct
18 Correct 4 ms 5100 KB Output is correct
19 Correct 4 ms 5100 KB Output is correct
20 Correct 4 ms 5100 KB Output is correct
21 Correct 4 ms 5100 KB Output is correct
22 Correct 4 ms 5100 KB Output is correct
23 Correct 6 ms 5612 KB Output is correct
24 Correct 6 ms 5612 KB Output is correct
25 Correct 6 ms 5612 KB Output is correct
26 Correct 9 ms 6124 KB Output is correct
27 Correct 9 ms 6124 KB Output is correct
28 Correct 9 ms 6124 KB Output is correct
29 Correct 9 ms 6144 KB Output is correct
30 Correct 8 ms 6124 KB Output is correct
31 Correct 9 ms 6508 KB Output is correct

Subtask #4
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5100 KB Output is correct
2 Correct 4 ms 5100 KB Output is correct
3 Correct 3 ms 5100 KB Output is correct
4 Correct 5 ms 5100 KB Output is correct
5 Correct 4 ms 5100 KB Output is correct
6 Correct 4 ms 5100 KB Output is correct
7 Correct 3 ms 5100 KB Output is correct
8 Correct 4 ms 5100 KB Output is correct
9 Correct 4 ms 5100 KB Output is correct
10 Correct 4 ms 5100 KB Output is correct
11 Correct 3 ms 5100 KB Output is correct
12 Correct 4 ms 5100 KB Output is correct
13 Correct 4 ms 5100 KB Output is correct
14 Correct 4 ms 5100 KB Output is correct
15 Correct 4 ms 5100 KB Output is correct
16 Correct 4 ms 5228 KB Output is correct
17 Correct 4 ms 5248 KB Output is correct
18 Correct 4 ms 5100 KB Output is correct
19 Correct 4 ms 5100 KB Output is correct
20 Correct 4 ms 5100 KB Output is correct
21 Correct 4 ms 5100 KB Output is correct
22 Correct 4 ms 5100 KB Output is correct
23 Correct 6 ms 5612 KB Output is correct
24 Correct 6 ms 5612 KB Output is correct
25 Correct 6 ms 5612 KB Output is correct
26 Correct 9 ms 6124 KB Output is correct
27 Correct 9 ms 6124 KB Output is correct
28 Correct 9 ms 6124 KB Output is correct
29 Correct 9 ms 6144 KB Output is correct
30 Correct 8 ms 6124 KB Output is correct
31 Correct 9 ms 6508 KB Output is correct
32 Correct 37 ms 10348 KB Output is correct
33 Correct 39 ms 10348 KB Output is correct
34 Correct 37 ms 10348 KB Output is correct
35 Correct 213 ms 26604 KB Output is correct
36 Correct 216 ms 26732 KB Output is correct
37 Correct 208 ms 26604 KB Output is correct
38 Correct 163 ms 26072 KB Output is correct
39 Correct 157 ms 25792 KB Output is correct
40 Correct 166 ms 25928 KB Output is correct
41 Correct 215 ms 30556 KB Output is correct