oj.uz

Submission #46321

# Submission time Handle Problem Language Result Execution time Memory
46321 2018-04-19T06:04:09 Z RayaBurong25_1 Beads and wires (APIO14_beads) C++14
100 / 100
 256 ms 17900 KB 
#include <stdio.h>
#include <vector>
#define INF 2000000007
std::vector<std::pair<int, int> > AdjList[200005];
int Black[200005];
int White[200005];
int max(int a, int b)
{
    return (a > b)?a:b;
}
void dfsSub(int u, int pa)
{
    int i, v, s = AdjList[u].size();
    // White[u] = -INF;
    Black[u] = -INF;
    for (i = 0; i < s; i++)
    {
        v = AdjList[u][i].first;
        if (v != pa)
        {
            dfsSub(v, u);
            White[u] += max(Black[v] + AdjList[u][i].second, White[v]);
        }
    }
    for (i = 0; i < s; i++)
    {
        v = AdjList[u][i].first;
        if (v != pa)
        {
            Black[u] = max(Black[u], White[u] - max(Black[v] + AdjList[u][i].second, White[v]) + AdjList[u][i].second + White[v]);
        }
    }
    // printf("u%d w%d b%d\n", u, White[u], Black[u]);
}
int Ans = 0;
void dfs(int u, int pa, int B, int W, int C)
{
    int i, v, s = AdjList[u].size();
    int R = White[u] + max(W, B + C);
    // printf("u%d R%d\n", u, R);
    int S, P = 0, Pi, Q = 0, Qi;
    Ans = max(Ans, R);
    for (i = 0; i < s; i++)
    {
        v = AdjList[u][i].first;
        if (v != pa)
        {
            S = R - max(White[v], Black[v] + AdjList[u][i].second) + AdjList[u][i].second + White[v];
            if (S >= P)
            {
                Q = P; Qi = Pi;
                P = S; Pi = v;
            }
            else if (S >= Q)
            {
                Q = S; Qi = v;
            }
        }
        else
        {
            S = R - max(W, B + C) + C + W;
            if (S >= P)
            {
                Q = P; Qi = Pi;
                P = S; Pi = v;
            }
            else if (S >= Q)
            {
                Q = S; Qi = v;
            }
        }
    }
    for (i = 0; i < s; i++)
    {
        v = AdjList[u][i].first;
        if (v != pa)
        {
            if (v == Pi)
                dfs(v, u, Q - max(White[v], Black[v] + AdjList[u][i].second), R - max(White[v], Black[v] + AdjList[u][i].second), AdjList[u][i].second);
            else
                dfs(v, u, P - max(White[v], Black[v] + AdjList[u][i].second), R - max(White[v], Black[v] + AdjList[u][i].second), AdjList[u][i].second);
        }
    }
}
int main()
{
    int N;
    scanf("%d", &N);
    int i, a, b, c;
    for (i = 0; i < N - 1; i++)
    {
        scanf("%d %d %d", &a, &b, &c);
        AdjList[a].push_back({b, c});
        AdjList[b].push_back({a, c});
    }
    dfsSub(1, 0);
    dfs(1, 0, 0, 0, 0);
    printf("%d", Ans);
}

Compilation message

beads.cpp: In function 'void dfs(int, int, int, int, int)':
beads.cpp:41:30: warning: variable 'Qi' set but not used [-Wunused-but-set-variable]
     int S, P = 0, Pi, Q = 0, Qi;
                              ^~
beads.cpp: In function 'int main()':
beads.cpp:88:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &N);
     ~~~~~^~~~~~~~~~
beads.cpp:92: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);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
beads.cpp: In function 'void dfs(int, int, int, int, int)':
beads.cpp:78:13: warning: 'Pi' may be used uninitialized in this function [-Wmaybe-uninitialized]
             if (v == Pi)
             ^~

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 6 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 5 ms 4992 KB Output is correct
7 Correct 6 ms 4992 KB Output is correct
8 Correct 5 ms 4992 KB Output is correct
9 Correct 5 ms 4964 KB Output is correct
10 Correct 5 ms 4992 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 6 ms 4992 KB Output is correct
2 Correct 5 ms 4992 KB Output is correct
3 Correct 6 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 5 ms 4992 KB Output is correct
7 Correct 6 ms 4992 KB Output is correct
8 Correct 5 ms 4992 KB Output is correct
9 Correct 5 ms 4964 KB Output is correct
10 Correct 5 ms 4992 KB Output is correct
11 Correct 5 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 5 ms 4992 KB Output is correct
16 Correct 6 ms 4992 KB Output is correct
17 Correct 6 ms 4992 KB Output is correct
18 Correct 6 ms 4992 KB Output is correct
19 Correct 6 ms 5120 KB Output is correct
20 Correct 6 ms 4992 KB Output is correct
21 Correct 6 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 6 ms 4992 KB Output is correct
2 Correct 5 ms 4992 KB Output is correct
3 Correct 6 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 5 ms 4992 KB Output is correct
7 Correct 6 ms 4992 KB Output is correct
8 Correct 5 ms 4992 KB Output is correct
9 Correct 5 ms 4964 KB Output is correct
10 Correct 5 ms 4992 KB Output is correct
11 Correct 5 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 5 ms 4992 KB Output is correct
16 Correct 6 ms 4992 KB Output is correct
17 Correct 6 ms 4992 KB Output is correct
18 Correct 6 ms 4992 KB Output is correct
19 Correct 6 ms 5120 KB Output is correct
20 Correct 6 ms 4992 KB Output is correct
21 Correct 6 ms 5120 KB Output is correct
22 Correct 6 ms 4992 KB Output is correct
23 Correct 8 ms 5248 KB Output is correct
24 Correct 8 ms 5248 KB Output is correct
25 Correct 8 ms 5248 KB Output is correct
26 Correct 12 ms 5504 KB Output is correct
27 Correct 12 ms 5504 KB Output is correct
28 Correct 10 ms 5504 KB Output is correct
29 Correct 10 ms 5504 KB Output is correct
30 Correct 11 ms 5504 KB Output is correct
31 Correct 11 ms 5888 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 6 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 5 ms 4992 KB Output is correct
7 Correct 6 ms 4992 KB Output is correct
8 Correct 5 ms 4992 KB Output is correct
9 Correct 5 ms 4964 KB Output is correct
10 Correct 5 ms 4992 KB Output is correct
11 Correct 5 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 5 ms 4992 KB Output is correct
16 Correct 6 ms 4992 KB Output is correct
17 Correct 6 ms 4992 KB Output is correct
18 Correct 6 ms 4992 KB Output is correct
19 Correct 6 ms 5120 KB Output is correct
20 Correct 6 ms 4992 KB Output is correct
21 Correct 6 ms 5120 KB Output is correct
22 Correct 6 ms 4992 KB Output is correct
23 Correct 8 ms 5248 KB Output is correct
24 Correct 8 ms 5248 KB Output is correct
25 Correct 8 ms 5248 KB Output is correct
26 Correct 12 ms 5504 KB Output is correct
27 Correct 12 ms 5504 KB Output is correct
28 Correct 10 ms 5504 KB Output is correct
29 Correct 10 ms 5504 KB Output is correct
30 Correct 11 ms 5504 KB Output is correct
31 Correct 11 ms 5888 KB Output is correct
32 Correct 37 ms 7288 KB Output is correct
33 Correct 40 ms 7296 KB Output is correct
34 Correct 47 ms 7288 KB Output is correct
35 Correct 243 ms 14180 KB Output is correct
36 Correct 238 ms 14200 KB Output is correct
37 Correct 244 ms 14196 KB Output is correct
38 Correct 149 ms 14492 KB Output is correct
39 Correct 149 ms 13684 KB Output is correct
40 Correct 166 ms 14260 KB Output is correct
41 Correct 256 ms 17900 KB Output is correct