oj.uz

Submission #672414

# Submission time Handle Problem Language Result Execution time Memory
672414 2022-12-16T03:18:32 Z LittleCube Dynamic Diameter (CEOI19_diameter) C++14
100 / 100
 738 ms 48688 KB 
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define F first
#define S second
using namespace std;

int N, Q, in[100005], out[100005], child[100005], t, pre[100005];
ll w, lazy[800005], edge[100005];
vector<pii> E[100005];

struct node
{
    ll a, b, c, ab, bc, abc;
} seg[800005];

node merge(node L, node R)
{
    return node{max(L.a, R.a),
                max(L.b, R.b),
                max(L.c, R.c),
                max({L.ab, R.ab, L.a + R.b}),
                max({L.bc, R.bc, L.b + R.c}),
                max({L.abc, R.abc, L.ab + R.c, L.a + R.bc})};
}

void apply(int i, ll tag)
{
    lazy[i] += tag;
    seg[i] = node{seg[i].a + tag, seg[i].b - 2 * tag, seg[i].c + tag, seg[i].ab - tag, seg[i].bc - tag, seg[i].abc};
}

void modify(int mL, int mR, ll val, int i = 1, int L = 1, int R = 2 * N)
{
    if (mL <= L && R <= mR)
        apply(i, val);
    else if (R < mL || mR < L)
        return;
    else
    {
        int mid = (L + R) / 2;
        apply(i << 1, lazy[i]);
        apply(i << 1 | 1, lazy[i]);
        lazy[i] = 0;
        modify(mL, mR, val, i << 1, L, mid);
        modify(mL, mR, val, i << 1 | 1, mid + 1, R);
        seg[i] = merge(seg[i << 1], seg[i << 1 | 1]);
    }
}

void dfs(int u)
{
    in[u] = ++t;
    out[u] = t;
    for (auto [v, i] : E[u])
        if (pre[u] != v)
        {
            pre[v] = u;
            child[i] = v;
            dfs(v);
            out[u] = ++t;
        }
}

signed main()
{
    cin >> N >> Q >> w;
    for (int i = 1; i < N; i++)
    {
        int u, v;
        cin >> u >> v >> edge[i];
        E[u].emplace_back(pii(v, i));
        E[v].emplace_back(pii(u, i));
    }
    dfs(1);
    for (int i = 1; i < N; i++)
        modify(in[child[i]], out[child[i]], edge[i]);
    ll last = 0;
    for (int i = 1; i <= Q; i++)
    {
        ll d, e;
        cin >> d >> e;
        d = (d + last) % (N - 1) + 1;
        e = (e + last) % w;
        modify(in[child[d]], out[child[d]], e - edge[d]);
        edge[d] = e;
        cout << (last = seg[1].abc) << '\n';
    }
}

Compilation message

diameter.cpp: In function 'void dfs(int)':
diameter.cpp:55:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   55 |     for (auto [v, i] : E[u])
      |               ^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2772 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2660 KB Output is correct
7 Correct 2 ms 2664 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2660 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2660 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 3 ms 2644 KB Output is correct
14 Correct 2 ms 2660 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2772 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2660 KB Output is correct
7 Correct 2 ms 2664 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2660 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2660 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 3 ms 2644 KB Output is correct
14 Correct 2 ms 2660 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 19 ms 3028 KB Output is correct
20 Correct 14 ms 3052 KB Output is correct
21 Correct 14 ms 3076 KB Output is correct
22 Correct 16 ms 3024 KB Output is correct
23 Correct 20 ms 4872 KB Output is correct
24 Correct 20 ms 4936 KB Output is correct
25 Correct 20 ms 4960 KB Output is correct
26 Correct 23 ms 5204 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2660 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 7 ms 2680 KB Output is correct
4 Correct 37 ms 2832 KB Output is correct
5 Correct 176 ms 3804 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2772 KB Output is correct
8 Correct 2 ms 2800 KB Output is correct
9 Correct 6 ms 2804 KB Output is correct
10 Correct 45 ms 3044 KB Output is correct
11 Correct 212 ms 4128 KB Output is correct
12 Correct 8 ms 4820 KB Output is correct
13 Correct 8 ms 4848 KB Output is correct
14 Correct 12 ms 4900 KB Output is correct
15 Correct 50 ms 5060 KB Output is correct
16 Correct 219 ms 6300 KB Output is correct
17 Correct 133 ms 38816 KB Output is correct
18 Correct 129 ms 38784 KB Output is correct
19 Correct 132 ms 38892 KB Output is correct
20 Correct 192 ms 39248 KB Output is correct
21 Correct 407 ms 40592 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2900 KB Output is correct
2 Correct 24 ms 3136 KB Output is correct
3 Correct 110 ms 3664 KB Output is correct
4 Correct 225 ms 4304 KB Output is correct
5 Correct 23 ms 7064 KB Output is correct
6 Correct 39 ms 7152 KB Output is correct
7 Correct 130 ms 7768 KB Output is correct
8 Correct 253 ms 8556 KB Output is correct
9 Correct 98 ms 20944 KB Output is correct
10 Correct 103 ms 21076 KB Output is correct
11 Correct 208 ms 21764 KB Output is correct
12 Correct 349 ms 22604 KB Output is correct
13 Correct 159 ms 39208 KB Output is correct
14 Correct 189 ms 39312 KB Output is correct
15 Correct 299 ms 40056 KB Output is correct
16 Correct 440 ms 40820 KB Output is correct
17 Correct 406 ms 40612 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 542 ms 43112 KB Output is correct
2 Correct 544 ms 43104 KB Output is correct
3 Correct 546 ms 43048 KB Output is correct
4 Correct 558 ms 43124 KB Output is correct
5 Correct 532 ms 43084 KB Output is correct
6 Correct 506 ms 43232 KB Output is correct
7 Correct 579 ms 45232 KB Output is correct
8 Correct 578 ms 45308 KB Output is correct
9 Correct 570 ms 45184 KB Output is correct
10 Correct 555 ms 45356 KB Output is correct
11 Correct 576 ms 45136 KB Output is correct
12 Correct 524 ms 44944 KB Output is correct
13 Correct 709 ms 48688 KB Output is correct
14 Correct 654 ms 48640 KB Output is correct
15 Correct 712 ms 48684 KB Output is correct
16 Correct 691 ms 48592 KB Output is correct
17 Correct 729 ms 48120 KB Output is correct
18 Correct 586 ms 46164 KB Output is correct
19 Correct 659 ms 48652 KB Output is correct
20 Correct 657 ms 48676 KB Output is correct
21 Correct 665 ms 48640 KB Output is correct
22 Correct 738 ms 48688 KB Output is correct
23 Correct 669 ms 48116 KB Output is correct
24 Correct 650 ms 46020 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2772 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2660 KB Output is correct
7 Correct 2 ms 2664 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2660 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2660 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 3 ms 2644 KB Output is correct
14 Correct 2 ms 2660 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 19 ms 3028 KB Output is correct
20 Correct 14 ms 3052 KB Output is correct
21 Correct 14 ms 3076 KB Output is correct
22 Correct 16 ms 3024 KB Output is correct
23 Correct 20 ms 4872 KB Output is correct
24 Correct 20 ms 4936 KB Output is correct
25 Correct 20 ms 4960 KB Output is correct
26 Correct 23 ms 5204 KB Output is correct
27 Correct 2 ms 2660 KB Output is correct
28 Correct 2 ms 2644 KB Output is correct
29 Correct 7 ms 2680 KB Output is correct
30 Correct 37 ms 2832 KB Output is correct
31 Correct 176 ms 3804 KB Output is correct
32 Correct 2 ms 2644 KB Output is correct
33 Correct 2 ms 2772 KB Output is correct
34 Correct 2 ms 2800 KB Output is correct
35 Correct 6 ms 2804 KB Output is correct
36 Correct 45 ms 3044 KB Output is correct
37 Correct 212 ms 4128 KB Output is correct
38 Correct 8 ms 4820 KB Output is correct
39 Correct 8 ms 4848 KB Output is correct
40 Correct 12 ms 4900 KB Output is correct
41 Correct 50 ms 5060 KB Output is correct
42 Correct 219 ms 6300 KB Output is correct
43 Correct 133 ms 38816 KB Output is correct
44 Correct 129 ms 38784 KB Output is correct
45 Correct 132 ms 38892 KB Output is correct
46 Correct 192 ms 39248 KB Output is correct
47 Correct 407 ms 40592 KB Output is correct
48 Correct 5 ms 2900 KB Output is correct
49 Correct 24 ms 3136 KB Output is correct
50 Correct 110 ms 3664 KB Output is correct
51 Correct 225 ms 4304 KB Output is correct
52 Correct 23 ms 7064 KB Output is correct
53 Correct 39 ms 7152 KB Output is correct
54 Correct 130 ms 7768 KB Output is correct
55 Correct 253 ms 8556 KB Output is correct
56 Correct 98 ms 20944 KB Output is correct
57 Correct 103 ms 21076 KB Output is correct
58 Correct 208 ms 21764 KB Output is correct
59 Correct 349 ms 22604 KB Output is correct
60 Correct 159 ms 39208 KB Output is correct
61 Correct 189 ms 39312 KB Output is correct
62 Correct 299 ms 40056 KB Output is correct
63 Correct 440 ms 40820 KB Output is correct
64 Correct 406 ms 40612 KB Output is correct
65 Correct 542 ms 43112 KB Output is correct
66 Correct 544 ms 43104 KB Output is correct
67 Correct 546 ms 43048 KB Output is correct
68 Correct 558 ms 43124 KB Output is correct
69 Correct 532 ms 43084 KB Output is correct
70 Correct 506 ms 43232 KB Output is correct
71 Correct 579 ms 45232 KB Output is correct
72 Correct 578 ms 45308 KB Output is correct
73 Correct 570 ms 45184 KB Output is correct
74 Correct 555 ms 45356 KB Output is correct
75 Correct 576 ms 45136 KB Output is correct
76 Correct 524 ms 44944 KB Output is correct
77 Correct 709 ms 48688 KB Output is correct
78 Correct 654 ms 48640 KB Output is correct
79 Correct 712 ms 48684 KB Output is correct
80 Correct 691 ms 48592 KB Output is correct
81 Correct 729 ms 48120 KB Output is correct
82 Correct 586 ms 46164 KB Output is correct
83 Correct 659 ms 48652 KB Output is correct
84 Correct 657 ms 48676 KB Output is correct
85 Correct 665 ms 48640 KB Output is correct
86 Correct 738 ms 48688 KB Output is correct
87 Correct 669 ms 48116 KB Output is correct
88 Correct 650 ms 46020 KB Output is correct
89 Correct 507 ms 41996 KB Output is correct
90 Correct 504 ms 42444 KB Output is correct
91 Correct 577 ms 43636 KB Output is correct
92 Correct 532 ms 43428 KB Output is correct
93 Correct 549 ms 45560 KB Output is correct
94 Correct 607 ms 44836 KB Output is correct
95 Correct 672 ms 45996 KB Output is correct
96 Correct 617 ms 45164 KB Output is correct
97 Correct 606 ms 46092 KB Output is correct
98 Correct 659 ms 47964 KB Output is correct
99 Correct 693 ms 45720 KB Output is correct
100 Correct 641 ms 45796 KB Output is correct