oj.uz

Submission #106586

# Submission time Handle Problem Language Result Execution time Memory
106586 2019-04-19T06:51:03 Z Kastanda Beads and wires (APIO14_beads) C++11
100 / 100
 244 ms 20460 KB 
#include<bits/stdc++.h>
#define pb push_back
#define x first
#define y second
using namespace std;
const int N = 200005;
int n, dp[N][2], dp2[N][2];
vector < pair < int , int > > Adj[N];
void DFS(int v, int p, int w)
{
    int Mx = 0;
    for (auto &u : Adj[v])
        if (u.x != p)
        {
            DFS(u.x, v, u.y);
            dp[v][0] += dp[u.x][1];
            Mx = max(Mx, dp[u.x][0] + u.y + w - dp[u.x][1]);
        }
    dp[v][1] = dp[v][0] + Mx;
}
void DFS2(int v, int p, int w)
{
    dp2[v][0] = dp[v][0];
    dp2[v][1] = dp[v][1];
    int sum = 0, MX[] = {INT_MIN, INT_MIN};
    for (auto &u : Adj[v])
        if (u.x != p)
        {
            DFS2(u.x, v, u.y);
            sum += dp[u.x][1];
            if (MX[1] < dp[u.x][0] + u.y - dp[u.x][1])
                MX[1] = dp[u.x][0] + u.y - dp[u.x][1];
            if (MX[0] < MX[1])
                swap(MX[0], MX[1]);
        }
    for (auto &u : Adj[v])
        if (u.x != p)
        {
            bool tp = (MX[0] == dp[u.x][0] + u.y - dp[u.x][1]);
            dp2[v][0] = max(dp2[v][0], dp2[u.x][1] + sum - dp[u.x][1]);
            dp2[v][0] = max(dp2[v][0], dp2[u.x][0] + u.y + sum - dp[u.x][1] + MX[tp]);
            dp2[v][1] = max(dp2[v][1], dp2[v][0]);
            dp2[v][1] = max(dp2[v][1], dp2[u.x][0] + u.y + w + sum - dp[u.x][1]);
        }
}
int main()
{
    scanf("%d", &n);
    for (int i = 1; i < n; i++)
    {
        int v, u, w;
        scanf("%d%d%d", &v, &u, &w);
        Adj[v].pb({u, w});
        Adj[u].pb({v, w});
    }
    DFS(1, 0, 0);
    DFS2(1, 0, 0);
    return !printf("%d", dp2[1][0]);
}

Compilation message

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

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4992 KB Output is correct
2 Correct 5 ms 4992 KB Output is correct
3 Correct 5 ms 4992 KB Output is correct
4 Correct 5 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 6 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 6 ms 4992 KB Output is correct
11 Correct 6 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 6 ms 4992 KB Output is correct
2 Correct 5 ms 4992 KB Output is correct
3 Correct 5 ms 4992 KB Output is correct
4 Correct 5 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 6 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 6 ms 4992 KB Output is correct
11 Correct 6 ms 4992 KB Output is correct
12 Correct 5 ms 4992 KB Output is correct
13 Correct 5 ms 4992 KB Output is correct
14 Correct 5 ms 4992 KB Output is correct
15 Correct 6 ms 4992 KB Output is correct
16 Correct 6 ms 5120 KB Output is correct
17 Correct 6 ms 5120 KB Output is correct
18 Correct 6 ms 5120 KB Output is correct
19 Correct 6 ms 5120 KB Output is correct
20 Correct 5 ms 5120 KB Output is correct
21 Correct 6 ms 4992 KB Output is correct
22 Correct 6 ms 5120 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4992 KB Output is correct
2 Correct 5 ms 4992 KB Output is correct
3 Correct 5 ms 4992 KB Output is correct
4 Correct 5 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 6 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 6 ms 4992 KB Output is correct
11 Correct 6 ms 4992 KB Output is correct
12 Correct 5 ms 4992 KB Output is correct
13 Correct 5 ms 4992 KB Output is correct
14 Correct 5 ms 4992 KB Output is correct
15 Correct 6 ms 4992 KB Output is correct
16 Correct 6 ms 5120 KB Output is correct
17 Correct 6 ms 5120 KB Output is correct
18 Correct 6 ms 5120 KB Output is correct
19 Correct 6 ms 5120 KB Output is correct
20 Correct 5 ms 5120 KB Output is correct
21 Correct 6 ms 4992 KB Output is correct
22 Correct 6 ms 5120 KB Output is correct
23 Correct 8 ms 5376 KB Output is correct
24 Correct 8 ms 5376 KB Output is correct
25 Correct 8 ms 5248 KB Output is correct
26 Correct 11 ms 5632 KB Output is correct
27 Correct 12 ms 5632 KB Output is correct
28 Correct 10 ms 5632 KB Output is correct
29 Correct 10 ms 5632 KB Output is correct
30 Correct 10 ms 5504 KB Output is correct
31 Correct 11 ms 6016 KB Output is correct

Subtask #4
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4992 KB Output is correct
2 Correct 5 ms 4992 KB Output is correct
3 Correct 5 ms 4992 KB Output is correct
4 Correct 5 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 6 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 6 ms 4992 KB Output is correct
11 Correct 6 ms 4992 KB Output is correct
12 Correct 5 ms 4992 KB Output is correct
13 Correct 5 ms 4992 KB Output is correct
14 Correct 5 ms 4992 KB Output is correct
15 Correct 6 ms 4992 KB Output is correct
16 Correct 6 ms 5120 KB Output is correct
17 Correct 6 ms 5120 KB Output is correct
18 Correct 6 ms 5120 KB Output is correct
19 Correct 6 ms 5120 KB Output is correct
20 Correct 5 ms 5120 KB Output is correct
21 Correct 6 ms 4992 KB Output is correct
22 Correct 6 ms 5120 KB Output is correct
23 Correct 8 ms 5376 KB Output is correct
24 Correct 8 ms 5376 KB Output is correct
25 Correct 8 ms 5248 KB Output is correct
26 Correct 11 ms 5632 KB Output is correct
27 Correct 12 ms 5632 KB Output is correct
28 Correct 10 ms 5632 KB Output is correct
29 Correct 10 ms 5632 KB Output is correct
30 Correct 10 ms 5504 KB Output is correct
31 Correct 11 ms 6016 KB Output is correct
32 Correct 40 ms 7672 KB Output is correct
33 Correct 35 ms 7672 KB Output is correct
34 Correct 38 ms 7680 KB Output is correct
35 Correct 244 ms 15864 KB Output is correct
36 Correct 237 ms 15608 KB Output is correct
37 Correct 225 ms 15876 KB Output is correct
38 Correct 154 ms 16104 KB Output is correct
39 Correct 161 ms 16056 KB Output is correct
40 Correct 149 ms 15840 KB Output is correct
41 Correct 237 ms 20460 KB Output is correct