oj.uz

Submission #99784

# Submission time Handle Problem Language Result Execution time Memory
99784 2019-03-07T08:41:50 Z PeppaPig Beads and wires (APIO14_beads) C++14
100 / 100
 315 ms 31464 KB 
#include <bits/stdc++.h>

#define pii pair<int, int>
#define x first
#define y second

using namespace std;

const int N = 2e5+5;

int n, dp[N][4];
vector<pii> g[N];

void dfs(int u, int p) {
    for(pii v : g[u]) if(v.x != p) dfs(v.x, u);

    vector<int> V, W, M;
    vector<pii> V1, V2;
    for(pii v : g[u]) if(v.x != p) {
        V.emplace_back(v.x), W.emplace_back(v.y);
        M.emplace_back(max(dp[v.x][0], dp[v.x][2] + v.y));
        dp[u][0] += M.back();
        V1.emplace_back(M.back() - dp[v.x][0] - v.y, v.x);
        V2.emplace_back(M.back() - dp[v.x][1] - v.y, v.x);
    }
    sort(V1.begin(), V1.end()), sort(V2.begin(), V2.end());
    dp[u][1] = dp[u][2] = dp[u][3] = -1e9;

    for(int i = 0; i < min(2, (int)V1.size()); i++) for(int j = 0; j < min(2, (int)V2.size()); j++)
        if(V1[i].y != V2[j].y) dp[u][1] = max(dp[u][1], dp[u][0] - V1[i].x - V2[j].x);

    if(V1.size() >= 2) dp[u][1] = max(dp[u][1], dp[u][0] - V1[0].x - V1[1].x);

    for(int i = 0; i < V.size(); i++) {
        dp[u][2] = max(dp[u][2], dp[u][0] - M[i] + dp[V[i]][0] + W[i]);
        dp[u][3] = max(dp[u][3], dp[u][0] - M[i] + dp[V[i]][1] + W[i]);
    }

    for(int i = 0; i < V.size(); i++) 
        dp[u][1] = max(dp[u][1], dp[u][0] - M[i] + max(dp[V[i]][1], dp[V[i]][3] + W[i]));
}

int main() {
    scanf("%d", &n);
    for(int i = 1, a, b, c; i < n; i++) {
        scanf("%d %d %d", &a, &b, &c);
        g[a].emplace_back(b, c), g[b].emplace_back(a, c);
    }
    dfs(1, 1);
    printf("%d\n", max(dp[1][0], dp[1][1]));

    return 0;
}

Compilation message

beads.cpp: In function 'void dfs(int, int)':
beads.cpp:34:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < V.size(); i++) {
                    ~~^~~~~~~~~~
beads.cpp:39:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < V.size(); i++) 
                    ~~^~~~~~~~~~
beads.cpp: In function 'int main()':
beads.cpp:44:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
beads.cpp:46:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %d", &a, &b, &c);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4992 KB Output is correct
2 Correct 5 ms 4992 KB Output is correct
3 Correct 6 ms 5104 KB Output is correct
4 Correct 6 ms 4992 KB Output is correct
5 Correct 6 ms 4992 KB Output is correct
6 Correct 6 ms 4992 KB Output is correct
7 Correct 5 ms 4992 KB Output is correct
8 Correct 6 ms 4992 KB Output is correct
9 Correct 6 ms 4992 KB Output is correct
10 Correct 5 ms 5120 KB Output is correct
11 Correct 5 ms 4992 KB Output is correct
12 Correct 5 ms 4992 KB Output is correct
13 Correct 6 ms 5120 KB Output is correct
14 Correct 6 ms 4992 KB Output is correct
15 Correct 6 ms 4992 KB Output is correct
16 Correct 5 ms 4992 KB Output is correct
17 Correct 6 ms 4984 KB Output is correct
18 Correct 6 ms 4992 KB Output is correct
19 Correct 6 ms 5120 KB Output is correct
20 Correct 5 ms 4992 KB Output is correct
21 Correct 7 ms 5120 KB Output is correct
22 Correct 6 ms 4992 KB Output is correct
23 Correct 9 ms 5248 KB Output is correct
24 Correct 10 ms 5376 KB Output is correct
25 Correct 10 ms 5376 KB Output is correct
26 Correct 14 ms 5684 KB Output is correct
27 Correct 14 ms 5632 KB Output is correct
28 Correct 13 ms 6272 KB Output is correct
29 Correct 13 ms 5888 KB Output is correct
30 Correct 13 ms 5888 KB Output is correct
31 Correct 14 ms 6784 KB Output is correct

Subtask #4
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4992 KB Output is correct
2 Correct 5 ms 4992 KB Output is correct
3 Correct 6 ms 5104 KB Output is correct
4 Correct 6 ms 4992 KB Output is correct
5 Correct 6 ms 4992 KB Output is correct
6 Correct 6 ms 4992 KB Output is correct
7 Correct 5 ms 4992 KB Output is correct
8 Correct 6 ms 4992 KB Output is correct
9 Correct 6 ms 4992 KB Output is correct
10 Correct 5 ms 5120 KB Output is correct
11 Correct 5 ms 4992 KB Output is correct
12 Correct 5 ms 4992 KB Output is correct
13 Correct 6 ms 5120 KB Output is correct
14 Correct 6 ms 4992 KB Output is correct
15 Correct 6 ms 4992 KB Output is correct
16 Correct 5 ms 4992 KB Output is correct
17 Correct 6 ms 4984 KB Output is correct
18 Correct 6 ms 4992 KB Output is correct
19 Correct 6 ms 5120 KB Output is correct
20 Correct 5 ms 4992 KB Output is correct
21 Correct 7 ms 5120 KB Output is correct
22 Correct 6 ms 4992 KB Output is correct
23 Correct 9 ms 5248 KB Output is correct
24 Correct 10 ms 5376 KB Output is correct
25 Correct 10 ms 5376 KB Output is correct
26 Correct 14 ms 5684 KB Output is correct
27 Correct 14 ms 5632 KB Output is correct
28 Correct 13 ms 6272 KB Output is correct
29 Correct 13 ms 5888 KB Output is correct
30 Correct 13 ms 5888 KB Output is correct
31 Correct 14 ms 6784 KB Output is correct
32 Correct 57 ms 8388 KB Output is correct
33 Correct 58 ms 8312 KB Output is correct
34 Correct 50 ms 8412 KB Output is correct
35 Correct 273 ms 16340 KB Output is correct
36 Correct 277 ms 16376 KB Output is correct
37 Correct 287 ms 16376 KB Output is correct
38 Correct 232 ms 25448 KB Output is correct
39 Correct 216 ms 20872 KB Output is correct
40 Correct 228 ms 18544 KB Output is correct
41 Correct 315 ms 31464 KB Output is correct