oj.uz

Submission #637918

# Submission time Handle Problem Language Result Execution time Memory
637918 2022-09-03T15:13:26 Z MohamedFaresNebili Dynamic Diameter (CEOI19_diameter) C++14
100 / 100
 3420 ms 165572 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, 0);
                    lazy.resize(4 * N, 0);
                }
                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) {
                    prop(v, l, r);
                    if(l > hi || r < lo) return 0;
                    if(l >= lo && r <= hi) return st[v];
                    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, S[100005]; ll W; 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, _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, _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 10 ms 19924 KB Output is correct
2 Correct 10 ms 19856 KB Output is correct
3 Correct 10 ms 19900 KB Output is correct
4 Correct 10 ms 19928 KB Output is correct
5 Correct 10 ms 19924 KB Output is correct
6 Correct 10 ms 19932 KB Output is correct
7 Correct 10 ms 19904 KB Output is correct
8 Correct 11 ms 19924 KB Output is correct
9 Correct 10 ms 19924 KB Output is correct
10 Correct 10 ms 19924 KB Output is correct
11 Correct 10 ms 19924 KB Output is correct
12 Correct 13 ms 19876 KB Output is correct
13 Correct 10 ms 19924 KB Output is correct
14 Correct 12 ms 19984 KB Output is correct
15 Correct 11 ms 19924 KB Output is correct
16 Correct 12 ms 19924 KB Output is correct
17 Correct 11 ms 19988 KB Output is correct
18 Correct 11 ms 19968 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 19924 KB Output is correct
2 Correct 10 ms 19856 KB Output is correct
3 Correct 10 ms 19900 KB Output is correct
4 Correct 10 ms 19928 KB Output is correct
5 Correct 10 ms 19924 KB Output is correct
6 Correct 10 ms 19932 KB Output is correct
7 Correct 10 ms 19904 KB Output is correct
8 Correct 11 ms 19924 KB Output is correct
9 Correct 10 ms 19924 KB Output is correct
10 Correct 10 ms 19924 KB Output is correct
11 Correct 10 ms 19924 KB Output is correct
12 Correct 13 ms 19876 KB Output is correct
13 Correct 10 ms 19924 KB Output is correct
14 Correct 12 ms 19984 KB Output is correct
15 Correct 11 ms 19924 KB Output is correct
16 Correct 12 ms 19924 KB Output is correct
17 Correct 11 ms 19988 KB Output is correct
18 Correct 11 ms 19968 KB Output is correct
19 Correct 28 ms 20564 KB Output is correct
20 Correct 30 ms 20676 KB Output is correct
21 Correct 33 ms 20772 KB Output is correct
22 Correct 34 ms 20924 KB Output is correct
23 Correct 47 ms 23468 KB Output is correct
24 Correct 62 ms 24404 KB Output is correct
25 Correct 67 ms 24984 KB Output is correct
26 Correct 64 ms 25772 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 19936 KB Output is correct
2 Correct 10 ms 19832 KB Output is correct
3 Correct 11 ms 19920 KB Output is correct
4 Correct 24 ms 20116 KB Output is correct
5 Correct 72 ms 20512 KB Output is correct
6 Correct 13 ms 19876 KB Output is correct
7 Correct 12 ms 20052 KB Output is correct
8 Correct 11 ms 20032 KB Output is correct
9 Correct 12 ms 20040 KB Output is correct
10 Correct 27 ms 20308 KB Output is correct
11 Correct 97 ms 20696 KB Output is correct
12 Correct 14 ms 21204 KB Output is correct
13 Correct 17 ms 21216 KB Output is correct
14 Correct 18 ms 21252 KB Output is correct
15 Correct 36 ms 21520 KB Output is correct
16 Correct 148 ms 21936 KB Output is correct
17 Correct 145 ms 44484 KB Output is correct
18 Correct 123 ms 44384 KB Output is correct
19 Correct 120 ms 44440 KB Output is correct
20 Correct 148 ms 44508 KB Output is correct
21 Correct 361 ms 45008 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 20692 KB Output is correct
2 Correct 41 ms 20816 KB Output is correct
3 Correct 166 ms 21116 KB Output is correct
4 Correct 315 ms 21424 KB Output is correct
5 Correct 46 ms 30936 KB Output is correct
6 Correct 94 ms 31156 KB Output is correct
7 Correct 271 ms 31444 KB Output is correct
8 Correct 526 ms 31664 KB Output is correct
9 Correct 205 ms 82092 KB Output is correct
10 Correct 271 ms 82228 KB Output is correct
11 Correct 614 ms 82620 KB Output is correct
12 Correct 1026 ms 82908 KB Output is correct
13 Correct 459 ms 150472 KB Output is correct
14 Correct 531 ms 150584 KB Output is correct
15 Correct 910 ms 150884 KB Output is correct
16 Correct 1382 ms 151064 KB Output is correct
17 Correct 2468 ms 151236 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 2287 ms 125392 KB Output is correct
2 Correct 2381 ms 128524 KB Output is correct
3 Correct 2358 ms 127756 KB Output is correct
4 Correct 2297 ms 128600 KB Output is correct
5 Correct 2239 ms 121940 KB Output is correct
6 Correct 1913 ms 88648 KB Output is correct
7 Correct 3080 ms 152800 KB Output is correct
8 Correct 3009 ms 152712 KB Output is correct
9 Correct 3108 ms 152976 KB Output is correct
10 Correct 3420 ms 152276 KB Output is correct
11 Correct 3328 ms 144404 KB Output is correct
12 Correct 2690 ms 102472 KB Output is correct
13 Correct 3388 ms 165356 KB Output is correct
14 Correct 3061 ms 165552 KB Output is correct
15 Correct 3083 ms 165372 KB Output is correct
16 Correct 3154 ms 164624 KB Output is correct
17 Correct 2995 ms 155776 KB Output is correct
18 Correct 2476 ms 107664 KB Output is correct
19 Correct 3111 ms 165512 KB Output is correct
20 Correct 3156 ms 165492 KB Output is correct
21 Correct 3141 ms 165420 KB Output is correct
22 Correct 3096 ms 164748 KB Output is correct
23 Correct 2997 ms 156076 KB Output is correct
24 Correct 2522 ms 107692 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 19924 KB Output is correct
2 Correct 10 ms 19856 KB Output is correct
3 Correct 10 ms 19900 KB Output is correct
4 Correct 10 ms 19928 KB Output is correct
5 Correct 10 ms 19924 KB Output is correct
6 Correct 10 ms 19932 KB Output is correct
7 Correct 10 ms 19904 KB Output is correct
8 Correct 11 ms 19924 KB Output is correct
9 Correct 10 ms 19924 KB Output is correct
10 Correct 10 ms 19924 KB Output is correct
11 Correct 10 ms 19924 KB Output is correct
12 Correct 13 ms 19876 KB Output is correct
13 Correct 10 ms 19924 KB Output is correct
14 Correct 12 ms 19984 KB Output is correct
15 Correct 11 ms 19924 KB Output is correct
16 Correct 12 ms 19924 KB Output is correct
17 Correct 11 ms 19988 KB Output is correct
18 Correct 11 ms 19968 KB Output is correct
19 Correct 28 ms 20564 KB Output is correct
20 Correct 30 ms 20676 KB Output is correct
21 Correct 33 ms 20772 KB Output is correct
22 Correct 34 ms 20924 KB Output is correct
23 Correct 47 ms 23468 KB Output is correct
24 Correct 62 ms 24404 KB Output is correct
25 Correct 67 ms 24984 KB Output is correct
26 Correct 64 ms 25772 KB Output is correct
27 Correct 11 ms 19936 KB Output is correct
28 Correct 10 ms 19832 KB Output is correct
29 Correct 11 ms 19920 KB Output is correct
30 Correct 24 ms 20116 KB Output is correct
31 Correct 72 ms 20512 KB Output is correct
32 Correct 13 ms 19876 KB Output is correct
33 Correct 12 ms 20052 KB Output is correct
34 Correct 11 ms 20032 KB Output is correct
35 Correct 12 ms 20040 KB Output is correct
36 Correct 27 ms 20308 KB Output is correct
37 Correct 97 ms 20696 KB Output is correct
38 Correct 14 ms 21204 KB Output is correct
39 Correct 17 ms 21216 KB Output is correct
40 Correct 18 ms 21252 KB Output is correct
41 Correct 36 ms 21520 KB Output is correct
42 Correct 148 ms 21936 KB Output is correct
43 Correct 145 ms 44484 KB Output is correct
44 Correct 123 ms 44384 KB Output is correct
45 Correct 120 ms 44440 KB Output is correct
46 Correct 148 ms 44508 KB Output is correct
47 Correct 361 ms 45008 KB Output is correct
48 Correct 16 ms 20692 KB Output is correct
49 Correct 41 ms 20816 KB Output is correct
50 Correct 166 ms 21116 KB Output is correct
51 Correct 315 ms 21424 KB Output is correct
52 Correct 46 ms 30936 KB Output is correct
53 Correct 94 ms 31156 KB Output is correct
54 Correct 271 ms 31444 KB Output is correct
55 Correct 526 ms 31664 KB Output is correct
56 Correct 205 ms 82092 KB Output is correct
57 Correct 271 ms 82228 KB Output is correct
58 Correct 614 ms 82620 KB Output is correct
59 Correct 1026 ms 82908 KB Output is correct
60 Correct 459 ms 150472 KB Output is correct
61 Correct 531 ms 150584 KB Output is correct
62 Correct 910 ms 150884 KB Output is correct
63 Correct 1382 ms 151064 KB Output is correct
64 Correct 2468 ms 151236 KB Output is correct
65 Correct 2287 ms 125392 KB Output is correct
66 Correct 2381 ms 128524 KB Output is correct
67 Correct 2358 ms 127756 KB Output is correct
68 Correct 2297 ms 128600 KB Output is correct
69 Correct 2239 ms 121940 KB Output is correct
70 Correct 1913 ms 88648 KB Output is correct
71 Correct 3080 ms 152800 KB Output is correct
72 Correct 3009 ms 152712 KB Output is correct
73 Correct 3108 ms 152976 KB Output is correct
74 Correct 3420 ms 152276 KB Output is correct
75 Correct 3328 ms 144404 KB Output is correct
76 Correct 2690 ms 102472 KB Output is correct
77 Correct 3388 ms 165356 KB Output is correct
78 Correct 3061 ms 165552 KB Output is correct
79 Correct 3083 ms 165372 KB Output is correct
80 Correct 3154 ms 164624 KB Output is correct
81 Correct 2995 ms 155776 KB Output is correct
82 Correct 2476 ms 107664 KB Output is correct
83 Correct 3111 ms 165512 KB Output is correct
84 Correct 3156 ms 165492 KB Output is correct
85 Correct 3141 ms 165420 KB Output is correct
86 Correct 3096 ms 164748 KB Output is correct
87 Correct 2997 ms 156076 KB Output is correct
88 Correct 2522 ms 107692 KB Output is correct
89 Correct 2314 ms 126896 KB Output is correct
90 Correct 2583 ms 137136 KB Output is correct
91 Correct 2917 ms 149148 KB Output is correct
92 Correct 3076 ms 152620 KB Output is correct
93 Correct 3217 ms 157432 KB Output is correct
94 Correct 3269 ms 160708 KB Output is correct
95 Correct 3198 ms 165320 KB Output is correct
96 Correct 3080 ms 165316 KB Output is correct
97 Correct 3134 ms 165316 KB Output is correct
98 Correct 3045 ms 165572 KB Output is correct
99 Correct 3136 ms 165256 KB Output is correct
100 Correct 3051 ms 165176 KB Output is correct