oj.uz

Submission #991105

# Submission time Handle Problem Language Result Execution time Memory
991105 2024-06-01T09:47:53 Z borisAngelov Traffic (IOI10_traffic) C++17
50 / 100
 1085 ms 262144 KB 
#include "traffic.h"
#include <bits/stdc++.h>

using namespace std;

const int maxn = 1000005;
const long long inf = (1LL << 60);

int n;
int a[maxn];

vector<int> g[maxn];

struct SegmentTree
{
    long long tree[4 * maxn];
    long long lazy[4 * maxn];

    void pushLazy(int node, int l, int r)
    {
        tree[node] += lazy[node];

        if (l != r)
        {
            lazy[2 * node] += lazy[node];
            lazy[2 * node + 1] += lazy[node];
        }

        lazy[node] = 0;
    }

    void update(int node, int l, int r, int ql, int qr, long long delta)
    {
        pushLazy(node, l, r);

        if (l > qr || r < ql)
        {
            return;
        }

        if (ql <= l && r <= qr)
        {
            lazy[node] += delta;
            pushLazy(node, l, r);
            return;
        }

        int mid = (l + r) / 2;

        update(2 * node, l, mid, ql, qr, delta);
        update(2 * node + 1, mid + 1, r, ql, qr, delta);

        tree[node] = max(tree[2 * node], tree[2 * node + 1]);
    }

    long long query(int node, int l, int r, int ql, int qr)
    {
        pushLazy(node, l, r);

        if (l > qr || r < ql)
        {
            return -inf;
        }

        if (ql <= l && r <= qr)
        {
            return tree[node];
        }

        int mid = (l + r) / 2;

        return max(query(2 * node, l, mid, ql, qr), query(2 * node + 1, mid + 1, r, ql, qr));
    }
};

SegmentTree tree;

long long subtreeSum[maxn];
long long ans[maxn];

void dfsInit(int node, int par)
{
    subtreeSum[node] = a[node];

    for (int i = 0; i < g[node].size(); ++i)
    {
        if (g[node][i] != par)
        {
            dfsInit(g[node][i], node);
            subtreeSum[node] += subtreeSum[g[node][i]];
        }
    }

    tree.update(1, 1, n, node, node, subtreeSum[node]);
}

void dfsSolve(int node, int par)
{
    if (1 < node && node < n)
    {
        ans[node] = max(tree.query(1, 1, n, 1, node - 1), tree.query(1, 1, n, node + 1, n));
    }
    else if (node == 1)
    {
        ans[node] = tree.query(1, 1, n, 2, n);
    }
    else
    {
        ans[node] = tree.query(1, 1, n, 1, n - 1);
    }

    for (int i = 0; i < g[node].size(); ++i)
    {
        int to = g[node][i];

        if (to != par)
        {
            subtreeSum[node] -= subtreeSum[to];
            tree.update(1, 1, n, node, node, -subtreeSum[to]);
            subtreeSum[to] += subtreeSum[node];
            tree.update(1, 1, n, to, to, +subtreeSum[node]);

            dfsSolve(to, node);

            tree.update(1, 1, n, to, to, -subtreeSum[node]);
            subtreeSum[to] -= subtreeSum[node];
            tree.update(1, 1, n, node, node, +subtreeSum[to]);
            subtreeSum[node] += subtreeSum[to];
        }
    }
}

int LocateCentre(int N, int pp[], int S[], int D[])
{
    n = N;

    for (int i = 1; i <= n; ++i)
    {
        a[i] = pp[i - 1];
    }

    for (int i = 1; i <= n - 1; ++i)
    {
        int x = S[i - 1];
        int y = D[i - 1];

        ++x;
        ++y;

        g[x].push_back(y);
        g[y].push_back(x);
    }

    dfsInit(1, -1);
    dfsSolve(1, -1);

    long long big = inf;
    int node = -1;

    for (int i = 1; i <= n; ++i)
    {
        //cout << i << " :: " << ans[i] << endl;

        if (big > ans[i])
        {
            big = ans[i];
            node = i;
        }
    }

    //cout << big << endl;

    return node - 1;
}

Compilation message

traffic.cpp: In function 'void dfsInit(int, int)':
traffic.cpp:85:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 |     for (int i = 0; i < g[node].size(); ++i)
      |                     ~~^~~~~~~~~~~~~~~~
traffic.cpp: In function 'void dfsSolve(int, int)':
traffic.cpp:112:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  112 |     for (int i = 0; i < g[node].size(); ++i)
      |                     ~~^~~~~~~~~~~~~~~~

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 33112 KB Output is correct
2 Correct 5 ms 33116 KB Output is correct
3 Correct 5 ms 33116 KB Output is correct
4 Correct 5 ms 33248 KB Output is correct
5 Correct 4 ms 33116 KB Output is correct
6 Correct 5 ms 33288 KB Output is correct
7 Correct 4 ms 33116 KB Output is correct
8 Correct 5 ms 33116 KB Output is correct
9 Correct 4 ms 33116 KB Output is correct
10 Correct 5 ms 33204 KB Output is correct
11 Correct 5 ms 33116 KB Output is correct
12 Correct 5 ms 33116 KB Output is correct
13 Correct 5 ms 33116 KB Output is correct
14 Correct 5 ms 33116 KB Output is correct
15 Correct 6 ms 33116 KB Output is correct
16 Correct 5 ms 33116 KB Output is correct
17 Correct 5 ms 33296 KB Output is correct
18 Correct 6 ms 33116 KB Output is correct
19 Correct 5 ms 33116 KB Output is correct
20 Correct 5 ms 33224 KB Output is correct
21 Correct 5 ms 33116 KB Output is correct
22 Correct 5 ms 33256 KB Output is correct
23 Correct 4 ms 33116 KB Output is correct
24 Correct 5 ms 33264 KB Output is correct
25 Correct 5 ms 33116 KB Output is correct
26 Correct 5 ms 33116 KB Output is correct
27 Correct 5 ms 33284 KB Output is correct
28 Correct 5 ms 33372 KB Output is correct
29 Correct 5 ms 33372 KB Output is correct
30 Correct 5 ms 33204 KB Output is correct
31 Correct 5 ms 33372 KB Output is correct
32 Correct 5 ms 33372 KB Output is correct
33 Correct 5 ms 33372 KB Output is correct
34 Correct 5 ms 33116 KB Output is correct
35 Correct 5 ms 33372 KB Output is correct
36 Correct 5 ms 33372 KB Output is correct
37 Correct 5 ms 33372 KB Output is correct
38 Correct 5 ms 33368 KB Output is correct
39 Correct 6 ms 33624 KB Output is correct
40 Correct 6 ms 33368 KB Output is correct
41 Correct 6 ms 33372 KB Output is correct
42 Correct 5 ms 33372 KB Output is correct
43 Correct 4 ms 31184 KB Output is correct
44 Correct 5 ms 33240 KB Output is correct
45 Correct 5 ms 33116 KB Output is correct
46 Correct 4 ms 33116 KB Output is correct
47 Correct 5 ms 33116 KB Output is correct

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 33112 KB Output is correct
2 Correct 5 ms 33116 KB Output is correct
3 Correct 5 ms 33116 KB Output is correct
4 Correct 5 ms 33248 KB Output is correct
5 Correct 4 ms 33116 KB Output is correct
6 Correct 5 ms 33288 KB Output is correct
7 Correct 4 ms 33116 KB Output is correct
8 Correct 5 ms 33116 KB Output is correct
9 Correct 4 ms 33116 KB Output is correct
10 Correct 5 ms 33204 KB Output is correct
11 Correct 5 ms 33116 KB Output is correct
12 Correct 5 ms 33116 KB Output is correct
13 Correct 5 ms 33116 KB Output is correct
14 Correct 5 ms 33116 KB Output is correct
15 Correct 6 ms 33116 KB Output is correct
16 Correct 5 ms 33116 KB Output is correct
17 Correct 5 ms 33296 KB Output is correct
18 Correct 6 ms 33116 KB Output is correct
19 Correct 5 ms 33116 KB Output is correct
20 Correct 5 ms 33224 KB Output is correct
21 Correct 5 ms 33116 KB Output is correct
22 Correct 5 ms 33256 KB Output is correct
23 Correct 4 ms 33116 KB Output is correct
24 Correct 5 ms 33264 KB Output is correct
25 Correct 5 ms 33116 KB Output is correct
26 Correct 5 ms 33116 KB Output is correct
27 Correct 5 ms 33284 KB Output is correct
28 Correct 5 ms 33372 KB Output is correct
29 Correct 5 ms 33372 KB Output is correct
30 Correct 5 ms 33204 KB Output is correct
31 Correct 5 ms 33372 KB Output is correct
32 Correct 5 ms 33372 KB Output is correct
33 Correct 5 ms 33372 KB Output is correct
34 Correct 5 ms 33116 KB Output is correct
35 Correct 5 ms 33372 KB Output is correct
36 Correct 5 ms 33372 KB Output is correct
37 Correct 5 ms 33372 KB Output is correct
38 Correct 5 ms 33368 KB Output is correct
39 Correct 6 ms 33624 KB Output is correct
40 Correct 6 ms 33368 KB Output is correct
41 Correct 6 ms 33372 KB Output is correct
42 Correct 5 ms 33372 KB Output is correct
43 Correct 4 ms 31184 KB Output is correct
44 Correct 5 ms 33240 KB Output is correct
45 Correct 5 ms 33116 KB Output is correct
46 Correct 4 ms 33116 KB Output is correct
47 Correct 5 ms 33116 KB Output is correct
48 Correct 5 ms 33116 KB Output is correct
49 Correct 4 ms 33116 KB Output is correct
50 Correct 4 ms 33116 KB Output is correct
51 Correct 5 ms 33112 KB Output is correct
52 Correct 5 ms 33116 KB Output is correct
53 Correct 5 ms 33116 KB Output is correct
54 Correct 5 ms 33116 KB Output is correct
55 Correct 5 ms 33116 KB Output is correct
56 Correct 5 ms 33288 KB Output is correct
57 Correct 5 ms 33112 KB Output is correct
58 Correct 5 ms 33220 KB Output is correct
59 Correct 5 ms 33116 KB Output is correct
60 Correct 5 ms 33116 KB Output is correct
61 Correct 5 ms 33116 KB Output is correct
62 Correct 5 ms 33112 KB Output is correct
63 Correct 5 ms 33112 KB Output is correct
64 Correct 5 ms 33116 KB Output is correct
65 Correct 5 ms 33116 KB Output is correct
66 Correct 5 ms 33116 KB Output is correct
67 Correct 5 ms 33116 KB Output is correct
68 Correct 71 ms 50600 KB Output is correct
69 Correct 182 ms 67196 KB Output is correct
70 Correct 5 ms 33368 KB Output is correct
71 Correct 216 ms 83848 KB Output is correct
72 Correct 274 ms 96336 KB Output is correct
73 Correct 417 ms 109208 KB Output is correct
74 Correct 454 ms 133968 KB Output is correct
75 Correct 524 ms 150872 KB Output is correct
76 Correct 655 ms 165456 KB Output is correct
77 Correct 670 ms 180312 KB Output is correct
78 Correct 780 ms 192852 KB Output is correct
79 Correct 811 ms 224340 KB Output is correct
80 Correct 890 ms 238668 KB Output is correct
81 Correct 5 ms 33112 KB Output is correct
82 Correct 999 ms 251320 KB Output is correct
83 Correct 1085 ms 262144 KB Output is correct
84 Runtime error 852 ms 262144 KB Execution killed with signal 9
85 Halted 0 ms 0 KB -

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 33112 KB Output is correct
2 Correct 5 ms 33116 KB Output is correct
3 Correct 5 ms 33116 KB Output is correct
4 Correct 5 ms 33248 KB Output is correct
5 Correct 4 ms 33116 KB Output is correct
6 Correct 5 ms 33288 KB Output is correct
7 Correct 4 ms 33116 KB Output is correct
8 Correct 5 ms 33116 KB Output is correct
9 Correct 4 ms 33116 KB Output is correct
10 Correct 5 ms 33204 KB Output is correct
11 Correct 5 ms 33116 KB Output is correct
12 Correct 5 ms 33116 KB Output is correct
13 Correct 5 ms 33116 KB Output is correct
14 Correct 5 ms 33116 KB Output is correct
15 Correct 6 ms 33116 KB Output is correct
16 Correct 5 ms 33116 KB Output is correct
17 Correct 5 ms 33296 KB Output is correct
18 Correct 6 ms 33116 KB Output is correct
19 Correct 5 ms 33116 KB Output is correct
20 Correct 5 ms 33224 KB Output is correct
21 Correct 5 ms 33116 KB Output is correct
22 Correct 5 ms 33256 KB Output is correct
23 Correct 4 ms 33116 KB Output is correct
24 Correct 5 ms 33264 KB Output is correct
25 Correct 5 ms 33116 KB Output is correct
26 Correct 5 ms 33116 KB Output is correct
27 Correct 5 ms 33284 KB Output is correct
28 Correct 5 ms 33372 KB Output is correct
29 Correct 5 ms 33372 KB Output is correct
30 Correct 5 ms 33204 KB Output is correct
31 Correct 5 ms 33372 KB Output is correct
32 Correct 5 ms 33372 KB Output is correct
33 Correct 5 ms 33372 KB Output is correct
34 Correct 5 ms 33116 KB Output is correct
35 Correct 5 ms 33372 KB Output is correct
36 Correct 5 ms 33372 KB Output is correct
37 Correct 5 ms 33372 KB Output is correct
38 Correct 5 ms 33368 KB Output is correct
39 Correct 6 ms 33624 KB Output is correct
40 Correct 6 ms 33368 KB Output is correct
41 Correct 6 ms 33372 KB Output is correct
42 Correct 5 ms 33372 KB Output is correct
43 Correct 4 ms 31184 KB Output is correct
44 Correct 5 ms 33240 KB Output is correct
45 Correct 5 ms 33116 KB Output is correct
46 Correct 4 ms 33116 KB Output is correct
47 Correct 5 ms 33116 KB Output is correct
48 Correct 5 ms 33116 KB Output is correct
49 Correct 4 ms 33116 KB Output is correct
50 Correct 5 ms 33116 KB Output is correct
51 Correct 5 ms 33116 KB Output is correct
52 Correct 4 ms 33116 KB Output is correct
53 Correct 4 ms 33116 KB Output is correct
54 Correct 5 ms 33116 KB Output is correct
55 Correct 5 ms 33164 KB Output is correct
56 Correct 5 ms 33116 KB Output is correct
57 Correct 5 ms 33292 KB Output is correct
58 Correct 5 ms 33116 KB Output is correct
59 Correct 5 ms 33116 KB Output is correct
60 Correct 5 ms 33296 KB Output is correct
61 Correct 5 ms 33208 KB Output is correct
62 Correct 5 ms 33116 KB Output is correct
63 Correct 5 ms 33116 KB Output is correct
64 Correct 5 ms 33116 KB Output is correct
65 Correct 4 ms 33116 KB Output is correct
66 Correct 5 ms 33112 KB Output is correct
67 Correct 5 ms 33116 KB Output is correct
68 Correct 5 ms 33116 KB Output is correct
69 Correct 5 ms 33116 KB Output is correct
70 Correct 5 ms 33248 KB Output is correct
71 Correct 5 ms 33116 KB Output is correct
72 Correct 5 ms 33116 KB Output is correct
73 Correct 5 ms 33116 KB Output is correct
74 Correct 5 ms 33112 KB Output is correct
75 Correct 5 ms 33116 KB Output is correct
76 Correct 5 ms 33116 KB Output is correct
77 Correct 5 ms 33116 KB Output is correct
78 Correct 5 ms 33332 KB Output is correct
79 Correct 5 ms 33112 KB Output is correct
80 Correct 5 ms 33328 KB Output is correct
81 Correct 4 ms 31064 KB Output is correct
82 Correct 5 ms 33116 KB Output is correct
83 Correct 6 ms 33116 KB Output is correct
84 Correct 6 ms 33116 KB Output is correct
85 Correct 6 ms 33116 KB Output is correct
86 Correct 6 ms 33116 KB Output is correct
87 Correct 5 ms 33116 KB Output is correct
88 Correct 5 ms 33116 KB Output is correct
89 Correct 6 ms 33268 KB Output is correct
90 Correct 7 ms 33372 KB Output is correct
91 Correct 6 ms 33116 KB Output is correct
92 Correct 5 ms 33116 KB Output is correct
93 Correct 6 ms 33372 KB Output is correct
94 Correct 5 ms 33372 KB Output is correct
95 Correct 5 ms 33372 KB Output is correct
96 Correct 5 ms 33116 KB Output is correct
97 Correct 4 ms 33116 KB Output is correct
98 Correct 5 ms 33112 KB Output is correct
99 Correct 5 ms 33116 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 33112 KB Output is correct
2 Correct 5 ms 33116 KB Output is correct
3 Correct 5 ms 33116 KB Output is correct
4 Correct 5 ms 33248 KB Output is correct
5 Correct 4 ms 33116 KB Output is correct
6 Correct 5 ms 33288 KB Output is correct
7 Correct 4 ms 33116 KB Output is correct
8 Correct 5 ms 33116 KB Output is correct
9 Correct 4 ms 33116 KB Output is correct
10 Correct 5 ms 33204 KB Output is correct
11 Correct 5 ms 33116 KB Output is correct
12 Correct 5 ms 33116 KB Output is correct
13 Correct 5 ms 33116 KB Output is correct
14 Correct 5 ms 33116 KB Output is correct
15 Correct 6 ms 33116 KB Output is correct
16 Correct 5 ms 33116 KB Output is correct
17 Correct 5 ms 33296 KB Output is correct
18 Correct 6 ms 33116 KB Output is correct
19 Correct 5 ms 33116 KB Output is correct
20 Correct 5 ms 33224 KB Output is correct
21 Correct 5 ms 33116 KB Output is correct
22 Correct 5 ms 33256 KB Output is correct
23 Correct 4 ms 33116 KB Output is correct
24 Correct 5 ms 33264 KB Output is correct
25 Correct 5 ms 33116 KB Output is correct
26 Correct 5 ms 33116 KB Output is correct
27 Correct 5 ms 33284 KB Output is correct
28 Correct 5 ms 33372 KB Output is correct
29 Correct 5 ms 33372 KB Output is correct
30 Correct 5 ms 33204 KB Output is correct
31 Correct 5 ms 33372 KB Output is correct
32 Correct 5 ms 33372 KB Output is correct
33 Correct 5 ms 33372 KB Output is correct
34 Correct 5 ms 33116 KB Output is correct
35 Correct 5 ms 33372 KB Output is correct
36 Correct 5 ms 33372 KB Output is correct
37 Correct 5 ms 33372 KB Output is correct
38 Correct 5 ms 33368 KB Output is correct
39 Correct 6 ms 33624 KB Output is correct
40 Correct 6 ms 33368 KB Output is correct
41 Correct 6 ms 33372 KB Output is correct
42 Correct 5 ms 33372 KB Output is correct
43 Correct 4 ms 31184 KB Output is correct
44 Correct 5 ms 33240 KB Output is correct
45 Correct 5 ms 33116 KB Output is correct
46 Correct 4 ms 33116 KB Output is correct
47 Correct 5 ms 33116 KB Output is correct
48 Correct 5 ms 33116 KB Output is correct
49 Correct 4 ms 33116 KB Output is correct
50 Correct 4 ms 33116 KB Output is correct
51 Correct 5 ms 33112 KB Output is correct
52 Correct 5 ms 33116 KB Output is correct
53 Correct 5 ms 33116 KB Output is correct
54 Correct 5 ms 33116 KB Output is correct
55 Correct 5 ms 33116 KB Output is correct
56 Correct 5 ms 33288 KB Output is correct
57 Correct 5 ms 33112 KB Output is correct
58 Correct 5 ms 33220 KB Output is correct
59 Correct 5 ms 33116 KB Output is correct
60 Correct 5 ms 33116 KB Output is correct
61 Correct 5 ms 33116 KB Output is correct
62 Correct 5 ms 33112 KB Output is correct
63 Correct 5 ms 33112 KB Output is correct
64 Correct 5 ms 33116 KB Output is correct
65 Correct 5 ms 33116 KB Output is correct
66 Correct 5 ms 33116 KB Output is correct
67 Correct 5 ms 33116 KB Output is correct
68 Correct 71 ms 50600 KB Output is correct
69 Correct 182 ms 67196 KB Output is correct
70 Correct 5 ms 33368 KB Output is correct
71 Correct 216 ms 83848 KB Output is correct
72 Correct 274 ms 96336 KB Output is correct
73 Correct 417 ms 109208 KB Output is correct
74 Correct 454 ms 133968 KB Output is correct
75 Correct 524 ms 150872 KB Output is correct
76 Correct 655 ms 165456 KB Output is correct
77 Correct 670 ms 180312 KB Output is correct
78 Correct 780 ms 192852 KB Output is correct
79 Correct 811 ms 224340 KB Output is correct
80 Correct 890 ms 238668 KB Output is correct
81 Correct 5 ms 33112 KB Output is correct
82 Correct 999 ms 251320 KB Output is correct
83 Correct 1085 ms 262144 KB Output is correct
84 Runtime error 852 ms 262144 KB Execution killed with signal 9
85 Halted 0 ms 0 KB -