oj.uz

Submission #637930

# Submission time Handle Problem Language Result Execution time Memory
637930 2022-09-03T15:51:54 Z MohamedFaresNebili Dynamic Diameter (CEOI19_diameter) C++14
100 / 100
 3058 ms 165212 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

            using namespace std;
            using ll = long long;

            struct seg
            {
                int N; vector<ll> st, lazy;
                seg() {}
                void init(int _N) {
                    N = _N;
                    st.resize(4 * N);
                    lazy.resize(4 * N);
                }
                void prop(int v, int l, int r) {
                    if(l == r || lazy[v] == 0) return;
                    st[v * 2] += lazy[v];
                    st[v * 2 + 1] += lazy[v];
                    lazy[v * 2] += lazy[v];
                    lazy[v * 2 + 1] += lazy[v];
                    lazy[v] = 0;
                }
                void update(int v, int l, int r, int lo, int hi, ll val) {
                    if(l > hi || r < lo) return;
                    if(l >= lo && r <= hi) {
                        st[v] += val; lazy[v] += val;
                        return;
                    }
                    prop(v, l, r);
                    update(v * 2, l, (l + r) / 2, lo, hi, val);
                    update(v * 2 + 1, (l + r) / 2 + 1, r, lo, hi, val);
                    st[v] = max(st[v * 2], st[v * 2 + 1]);
                }
                ll query(int v, int l, int r, int lo, int hi) {
                    if(l > hi || r < lo) return 0;
                    if(l >= lo && r <= hi) return st[v];
                    prop(v, l, r);
                    return max(query(v * 2, l, (l + r) / 2, lo, hi),
                               query(v * 2 + 1, (l + r) / 2 + 1, r, lo, hi));
                }
            };

            int N, Q; ll W; int S[100005]; seg ST[100005];
            int A[100005], B[100005]; ll C[100005];
            int par[100005], tin[100005], out[100005];
            vector<int> adj[100005]; vector<ll> cur[100005];
            vector<pair<int, int>> G[100005];
            vector<array<int, 3>> E[100005];
            set<pair<ll, int>> ans[100005];
            set<pair<ll, int>> best;
            int timer; vector<int> K;
            bool rem[100005];

            int dfs_size(int v, int p) {
                S[v] = 1;
                for(auto e : adj[v]) {
                    int u = A[e] ^ B[e] ^ v;
                    if(u == p || rem[u]) continue;
                    S[v] += dfs_size(u, v);
                }
                return S[v];
            }
            int dfs_centroid(int v, int p, int _N) {
                for(auto e : adj[v]) {
                    int u = A[e] ^ B[e] ^ v;
                    if(u == p || rem[u]) continue;
                    if(S[u] * 2 > _N)
                        return dfs_centroid(u, v, _N);
                }
                return v;
            }
            void dfs(int v, int p) {
                K.push_back(v); tin[v] = timer++;
                for(auto e : adj[v]) {
                    int u = A[e] ^ B[e] ^ v;
                    if(u == p || rem[u]) continue;
                    par[u] = e; dfs(u, v);
                }
                out[v] = timer - 1;
            }
            void get(int v, int state) {
                auto it = ans[v].rbegin();
                ll res = (*it).first;
                if(ans[v].size() > 1) {
                    it++; res += (*it).first;
                }
                if(state) best.insert({res, v});
                else best.erase({res, v});
            }
            void build(int v) {
                int _N = dfs_size(v, v);
                if(_N == 1) return;
                int centroid = dfs_centroid(v, v, _N);
                K.clear(); ST[centroid].init(_N); timer = 0;
                par[centroid] = -1; dfs(centroid, centroid);
                for(auto u : K) {
                    if(par[u] == -1) continue;
                    E[par[u]].push_back({tin[u], out[u], centroid});
                    ST[centroid].update(1, 0, ST[centroid].N - 1, tin[u], out[u], C[par[u]]);
                }
                int group = 0;
                for(auto e : adj[centroid]) {
                    int u = A[e] ^ B[e] ^ centroid;
                    if(rem[u]) continue;
                    G[centroid].push_back({tin[u], out[u]});
                    ll calc = ST[centroid].query(1, 0, ST[centroid].N - 1, tin[u], out[u]);
                    cur[centroid].push_back(calc);
                    ans[centroid].insert({calc, group++});
                }
                get(centroid, 1); rem[centroid] = 1;
                for(auto e : adj[centroid]) {
                    int u = A[e] ^ B[e] ^ centroid;
                    if(rem[u]) continue;
                    build(u);
                }
            }
            void upd(int I, int O, int D, ll M) {
                int lo = 0, hi = G[D].size() - 1, res = 0;
                while(lo <= hi) {
                    int md = (lo + hi) / 2;
                    if(G[D][md].second < I)
                        lo = md + 1;
                    else hi = md - 1, res = md;
                }
                get(D, 0); ans[D].erase({cur[D][res], res});
                ST[D].update(1, 0, ST[D].N - 1, I, O, M);
                cur[D][res] = ST[D].query(1, 0, ST[D].N - 1, G[D][res].first, G[D][res].second);
                ans[D].insert({cur[D][res], res}); get(D, 1);
            }

            int32_t main() {
                ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
                cin >> N >> Q >> W;
                for(int l = 1; l < N; l++) {
                    cin >> A[l] >> B[l] >> C[l];
                    adj[A[l]].push_back(l);
                    adj[B[l]].push_back(l);
                }
                build(1); ll last = 0;
                for(int l = 0; l < Q; l++) {
                    int d; ll e; cin >> d >> e;
                    d = (d + last) % (N - 1) + 1;
                    e = (e + last) % W;
                    for(auto u : E[d])
                        upd(u[0], u[1], u[2], e - C[d]);
                    C[d] = e; last = (*best.rbegin()).first;
                    cout << last << "\n";
                }
                return 0;
            }

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 19924 KB Output is correct
2 Correct 12 ms 19920 KB Output is correct
3 Correct 11 ms 19924 KB Output is correct
4 Correct 12 ms 19924 KB Output is correct
5 Correct 10 ms 19924 KB Output is correct
6 Correct 11 ms 19924 KB Output is correct
7 Correct 11 ms 19836 KB Output is correct
8 Correct 10 ms 19948 KB Output is correct
9 Correct 11 ms 19896 KB Output is correct
10 Correct 10 ms 19924 KB Output is correct
11 Correct 10 ms 19924 KB Output is correct
12 Correct 10 ms 19924 KB Output is correct
13 Correct 11 ms 19960 KB Output is correct
14 Correct 10 ms 19924 KB Output is correct
15 Correct 10 ms 19980 KB Output is correct
16 Correct 10 ms 19900 KB Output is correct
17 Correct 10 ms 19924 KB Output is correct
18 Correct 10 ms 19936 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 19924 KB Output is correct
2 Correct 12 ms 19920 KB Output is correct
3 Correct 11 ms 19924 KB Output is correct
4 Correct 12 ms 19924 KB Output is correct
5 Correct 10 ms 19924 KB Output is correct
6 Correct 11 ms 19924 KB Output is correct
7 Correct 11 ms 19836 KB Output is correct
8 Correct 10 ms 19948 KB Output is correct
9 Correct 11 ms 19896 KB Output is correct
10 Correct 10 ms 19924 KB Output is correct
11 Correct 10 ms 19924 KB Output is correct
12 Correct 10 ms 19924 KB Output is correct
13 Correct 11 ms 19960 KB Output is correct
14 Correct 10 ms 19924 KB Output is correct
15 Correct 10 ms 19980 KB Output is correct
16 Correct 10 ms 19900 KB Output is correct
17 Correct 10 ms 19924 KB Output is correct
18 Correct 10 ms 19936 KB Output is correct
19 Correct 29 ms 20580 KB Output is correct
20 Correct 34 ms 20564 KB Output is correct
21 Correct 30 ms 20712 KB Output is correct
22 Correct 35 ms 20888 KB Output is correct
23 Correct 44 ms 23380 KB Output is correct
24 Correct 55 ms 24324 KB Output is correct
25 Correct 60 ms 24892 KB Output is correct
26 Correct 59 ms 25676 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 19888 KB Output is correct
2 Correct 11 ms 19924 KB Output is correct
3 Correct 11 ms 19864 KB Output is correct
4 Correct 21 ms 19956 KB Output is correct
5 Correct 83 ms 20280 KB Output is correct
6 Correct 10 ms 19848 KB Output is correct
7 Correct 10 ms 20052 KB Output is correct
8 Correct 11 ms 20056 KB Output is correct
9 Correct 12 ms 20052 KB Output is correct
10 Correct 27 ms 20152 KB Output is correct
11 Correct 91 ms 20428 KB Output is correct
12 Correct 19 ms 21076 KB Output is correct
13 Correct 14 ms 21076 KB Output is correct
14 Correct 17 ms 21116 KB Output is correct
15 Correct 34 ms 21204 KB Output is correct
16 Correct 114 ms 21584 KB Output is correct
17 Correct 110 ms 44100 KB Output is correct
18 Correct 122 ms 44076 KB Output is correct
19 Correct 120 ms 44152 KB Output is correct
20 Correct 155 ms 44276 KB Output is correct
21 Correct 345 ms 44792 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 20692 KB Output is correct
2 Correct 36 ms 20744 KB Output is correct
3 Correct 133 ms 20896 KB Output is correct
4 Correct 257 ms 21200 KB Output is correct
5 Correct 43 ms 30776 KB Output is correct
6 Correct 82 ms 30856 KB Output is correct
7 Correct 261 ms 31100 KB Output is correct
8 Correct 462 ms 31380 KB Output is correct
9 Correct 210 ms 81936 KB Output is correct
10 Correct 268 ms 81916 KB Output is correct
11 Correct 550 ms 82168 KB Output is correct
12 Correct 903 ms 82448 KB Output is correct
13 Correct 448 ms 150356 KB Output is correct
14 Correct 520 ms 150296 KB Output is correct
15 Correct 862 ms 150556 KB Output is correct
16 Correct 1317 ms 151000 KB Output is correct
17 Correct 2325 ms 151028 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 2149 ms 125344 KB Output is correct
2 Correct 2142 ms 128684 KB Output is correct
3 Correct 2133 ms 127528 KB Output is correct
4 Correct 2115 ms 128144 KB Output is correct
5 Correct 2051 ms 121708 KB Output is correct
6 Correct 1768 ms 88472 KB Output is correct
7 Correct 2953 ms 152492 KB Output is correct
8 Correct 2789 ms 152444 KB Output is correct
9 Correct 2833 ms 152444 KB Output is correct
10 Correct 2786 ms 151964 KB Output is correct
11 Correct 2729 ms 144080 KB Output is correct
12 Correct 2382 ms 102052 KB Output is correct
13 Correct 3005 ms 165048 KB Output is correct
14 Correct 2910 ms 164956 KB Output is correct
15 Correct 3058 ms 165048 KB Output is correct
16 Correct 3025 ms 164336 KB Output is correct
17 Correct 2872 ms 155512 KB Output is correct
18 Correct 2295 ms 107456 KB Output is correct
19 Correct 2984 ms 165176 KB Output is correct
20 Correct 2897 ms 165052 KB Output is correct
21 Correct 2984 ms 165036 KB Output is correct
22 Correct 2931 ms 164392 KB Output is correct
23 Correct 2758 ms 155672 KB Output is correct
24 Correct 2271 ms 107296 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 19924 KB Output is correct
2 Correct 12 ms 19920 KB Output is correct
3 Correct 11 ms 19924 KB Output is correct
4 Correct 12 ms 19924 KB Output is correct
5 Correct 10 ms 19924 KB Output is correct
6 Correct 11 ms 19924 KB Output is correct
7 Correct 11 ms 19836 KB Output is correct
8 Correct 10 ms 19948 KB Output is correct
9 Correct 11 ms 19896 KB Output is correct
10 Correct 10 ms 19924 KB Output is correct
11 Correct 10 ms 19924 KB Output is correct
12 Correct 10 ms 19924 KB Output is correct
13 Correct 11 ms 19960 KB Output is correct
14 Correct 10 ms 19924 KB Output is correct
15 Correct 10 ms 19980 KB Output is correct
16 Correct 10 ms 19900 KB Output is correct
17 Correct 10 ms 19924 KB Output is correct
18 Correct 10 ms 19936 KB Output is correct
19 Correct 29 ms 20580 KB Output is correct
20 Correct 34 ms 20564 KB Output is correct
21 Correct 30 ms 20712 KB Output is correct
22 Correct 35 ms 20888 KB Output is correct
23 Correct 44 ms 23380 KB Output is correct
24 Correct 55 ms 24324 KB Output is correct
25 Correct 60 ms 24892 KB Output is correct
26 Correct 59 ms 25676 KB Output is correct
27 Correct 11 ms 19888 KB Output is correct
28 Correct 11 ms 19924 KB Output is correct
29 Correct 11 ms 19864 KB Output is correct
30 Correct 21 ms 19956 KB Output is correct
31 Correct 83 ms 20280 KB Output is correct
32 Correct 10 ms 19848 KB Output is correct
33 Correct 10 ms 20052 KB Output is correct
34 Correct 11 ms 20056 KB Output is correct
35 Correct 12 ms 20052 KB Output is correct
36 Correct 27 ms 20152 KB Output is correct
37 Correct 91 ms 20428 KB Output is correct
38 Correct 19 ms 21076 KB Output is correct
39 Correct 14 ms 21076 KB Output is correct
40 Correct 17 ms 21116 KB Output is correct
41 Correct 34 ms 21204 KB Output is correct
42 Correct 114 ms 21584 KB Output is correct
43 Correct 110 ms 44100 KB Output is correct
44 Correct 122 ms 44076 KB Output is correct
45 Correct 120 ms 44152 KB Output is correct
46 Correct 155 ms 44276 KB Output is correct
47 Correct 345 ms 44792 KB Output is correct
48 Correct 14 ms 20692 KB Output is correct
49 Correct 36 ms 20744 KB Output is correct
50 Correct 133 ms 20896 KB Output is correct
51 Correct 257 ms 21200 KB Output is correct
52 Correct 43 ms 30776 KB Output is correct
53 Correct 82 ms 30856 KB Output is correct
54 Correct 261 ms 31100 KB Output is correct
55 Correct 462 ms 31380 KB Output is correct
56 Correct 210 ms 81936 KB Output is correct
57 Correct 268 ms 81916 KB Output is correct
58 Correct 550 ms 82168 KB Output is correct
59 Correct 903 ms 82448 KB Output is correct
60 Correct 448 ms 150356 KB Output is correct
61 Correct 520 ms 150296 KB Output is correct
62 Correct 862 ms 150556 KB Output is correct
63 Correct 1317 ms 151000 KB Output is correct
64 Correct 2325 ms 151028 KB Output is correct
65 Correct 2149 ms 125344 KB Output is correct
66 Correct 2142 ms 128684 KB Output is correct
67 Correct 2133 ms 127528 KB Output is correct
68 Correct 2115 ms 128144 KB Output is correct
69 Correct 2051 ms 121708 KB Output is correct
70 Correct 1768 ms 88472 KB Output is correct
71 Correct 2953 ms 152492 KB Output is correct
72 Correct 2789 ms 152444 KB Output is correct
73 Correct 2833 ms 152444 KB Output is correct
74 Correct 2786 ms 151964 KB Output is correct
75 Correct 2729 ms 144080 KB Output is correct
76 Correct 2382 ms 102052 KB Output is correct
77 Correct 3005 ms 165048 KB Output is correct
78 Correct 2910 ms 164956 KB Output is correct
79 Correct 3058 ms 165048 KB Output is correct
80 Correct 3025 ms 164336 KB Output is correct
81 Correct 2872 ms 155512 KB Output is correct
82 Correct 2295 ms 107456 KB Output is correct
83 Correct 2984 ms 165176 KB Output is correct
84 Correct 2897 ms 165052 KB Output is correct
85 Correct 2984 ms 165036 KB Output is correct
86 Correct 2931 ms 164392 KB Output is correct
87 Correct 2758 ms 155672 KB Output is correct
88 Correct 2271 ms 107296 KB Output is correct
89 Correct 2100 ms 126388 KB Output is correct
90 Correct 2282 ms 136732 KB Output is correct
91 Correct 2653 ms 148968 KB Output is correct
92 Correct 2839 ms 152312 KB Output is correct
93 Correct 2884 ms 156908 KB Output is correct
94 Correct 2836 ms 160412 KB Output is correct
95 Correct 2895 ms 165036 KB Output is correct
96 Correct 2907 ms 165008 KB Output is correct
97 Correct 2873 ms 164956 KB Output is correct
98 Correct 2886 ms 165032 KB Output is correct
99 Correct 2903 ms 165020 KB Output is correct
100 Correct 2887 ms 165212 KB Output is correct