oj.uz

답안 #637927

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
637927 2022-09-03T15:41:01 Z MohamedFaresNebili Dynamic Diameter (CEOI19_diameter) C++14
100 / 100
 2966 ms 165300 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) {
                    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, _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

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 19924 KB Output is correct
2 Correct 10 ms 19924 KB Output is correct
3 Correct 12 ms 19820 KB Output is correct
4 Correct 9 ms 19924 KB Output is correct
5 Correct 10 ms 19928 KB Output is correct
6 Correct 10 ms 19880 KB Output is correct
7 Correct 10 ms 19924 KB Output is correct
8 Correct 10 ms 19948 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 10 ms 19956 KB Output is correct
13 Correct 11 ms 19976 KB Output is correct
14 Correct 10 ms 19924 KB Output is correct
15 Correct 10 ms 19924 KB Output is correct
16 Correct 10 ms 19988 KB Output is correct
17 Correct 10 ms 19984 KB Output is correct
18 Correct 10 ms 19924 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 19924 KB Output is correct
2 Correct 10 ms 19924 KB Output is correct
3 Correct 12 ms 19820 KB Output is correct
4 Correct 9 ms 19924 KB Output is correct
5 Correct 10 ms 19928 KB Output is correct
6 Correct 10 ms 19880 KB Output is correct
7 Correct 10 ms 19924 KB Output is correct
8 Correct 10 ms 19948 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 10 ms 19956 KB Output is correct
13 Correct 11 ms 19976 KB Output is correct
14 Correct 10 ms 19924 KB Output is correct
15 Correct 10 ms 19924 KB Output is correct
16 Correct 10 ms 19988 KB Output is correct
17 Correct 10 ms 19984 KB Output is correct
18 Correct 10 ms 19924 KB Output is correct
19 Correct 27 ms 20560 KB Output is correct
20 Correct 29 ms 20628 KB Output is correct
21 Correct 31 ms 20712 KB Output is correct
22 Correct 31 ms 20884 KB Output is correct
23 Correct 43 ms 23436 KB Output is correct
24 Correct 53 ms 24316 KB Output is correct
25 Correct 59 ms 24788 KB Output is correct
26 Correct 60 ms 25648 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 19924 KB Output is correct
2 Correct 11 ms 19852 KB Output is correct
3 Correct 11 ms 19924 KB Output is correct
4 Correct 22 ms 19924 KB Output is correct
5 Correct 66 ms 20324 KB Output is correct
6 Correct 11 ms 19904 KB Output is correct
7 Correct 11 ms 20052 KB Output is correct
8 Correct 11 ms 20072 KB Output is correct
9 Correct 11 ms 20020 KB Output is correct
10 Correct 26 ms 20116 KB Output is correct
11 Correct 87 ms 20428 KB Output is correct
12 Correct 14 ms 21072 KB Output is correct
13 Correct 14 ms 21076 KB Output is correct
14 Correct 16 ms 21104 KB Output is correct
15 Correct 35 ms 21236 KB Output is correct
16 Correct 113 ms 21580 KB Output is correct
17 Correct 112 ms 44096 KB Output is correct
18 Correct 115 ms 44168 KB Output is correct
19 Correct 119 ms 44108 KB Output is correct
20 Correct 143 ms 44284 KB Output is correct
21 Correct 349 ms 44732 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 20692 KB Output is correct
2 Correct 39 ms 20692 KB Output is correct
3 Correct 133 ms 20916 KB Output is correct
4 Correct 264 ms 21376 KB Output is correct
5 Correct 43 ms 30924 KB Output is correct
6 Correct 82 ms 30800 KB Output is correct
7 Correct 245 ms 31056 KB Output is correct
8 Correct 466 ms 31436 KB Output is correct
9 Correct 203 ms 81932 KB Output is correct
10 Correct 274 ms 81980 KB Output is correct
11 Correct 549 ms 82216 KB Output is correct
12 Correct 893 ms 82508 KB Output is correct
13 Correct 435 ms 150248 KB Output is correct
14 Correct 508 ms 150328 KB Output is correct
15 Correct 876 ms 150552 KB Output is correct
16 Correct 1305 ms 151012 KB Output is correct
17 Correct 2247 ms 150932 KB Output is correct

Subtask #5
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2123 ms 125216 KB Output is correct
2 Correct 2125 ms 128252 KB Output is correct
3 Correct 2125 ms 127552 KB Output is correct
4 Correct 2108 ms 128076 KB Output is correct
5 Correct 2112 ms 121696 KB Output is correct
6 Correct 1759 ms 88392 KB Output is correct
7 Correct 2815 ms 152376 KB Output is correct
8 Correct 2792 ms 152328 KB Output is correct
9 Correct 2772 ms 152468 KB Output is correct
10 Correct 2741 ms 151928 KB Output is correct
11 Correct 2689 ms 143944 KB Output is correct
12 Correct 2314 ms 101984 KB Output is correct
13 Correct 2889 ms 165044 KB Output is correct
14 Correct 2861 ms 164984 KB Output is correct
15 Correct 2864 ms 165032 KB Output is correct
16 Correct 2947 ms 164292 KB Output is correct
17 Correct 2825 ms 155456 KB Output is correct
18 Correct 2288 ms 107452 KB Output is correct
19 Correct 2897 ms 165124 KB Output is correct
20 Correct 2887 ms 165208 KB Output is correct
21 Correct 2966 ms 165048 KB Output is correct
22 Correct 2910 ms 164540 KB Output is correct
23 Correct 2765 ms 155548 KB Output is correct
24 Correct 2279 ms 107496 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 19924 KB Output is correct
2 Correct 10 ms 19924 KB Output is correct
3 Correct 12 ms 19820 KB Output is correct
4 Correct 9 ms 19924 KB Output is correct
5 Correct 10 ms 19928 KB Output is correct
6 Correct 10 ms 19880 KB Output is correct
7 Correct 10 ms 19924 KB Output is correct
8 Correct 10 ms 19948 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 10 ms 19956 KB Output is correct
13 Correct 11 ms 19976 KB Output is correct
14 Correct 10 ms 19924 KB Output is correct
15 Correct 10 ms 19924 KB Output is correct
16 Correct 10 ms 19988 KB Output is correct
17 Correct 10 ms 19984 KB Output is correct
18 Correct 10 ms 19924 KB Output is correct
19 Correct 27 ms 20560 KB Output is correct
20 Correct 29 ms 20628 KB Output is correct
21 Correct 31 ms 20712 KB Output is correct
22 Correct 31 ms 20884 KB Output is correct
23 Correct 43 ms 23436 KB Output is correct
24 Correct 53 ms 24316 KB Output is correct
25 Correct 59 ms 24788 KB Output is correct
26 Correct 60 ms 25648 KB Output is correct
27 Correct 10 ms 19924 KB Output is correct
28 Correct 11 ms 19852 KB Output is correct
29 Correct 11 ms 19924 KB Output is correct
30 Correct 22 ms 19924 KB Output is correct
31 Correct 66 ms 20324 KB Output is correct
32 Correct 11 ms 19904 KB Output is correct
33 Correct 11 ms 20052 KB Output is correct
34 Correct 11 ms 20072 KB Output is correct
35 Correct 11 ms 20020 KB Output is correct
36 Correct 26 ms 20116 KB Output is correct
37 Correct 87 ms 20428 KB Output is correct
38 Correct 14 ms 21072 KB Output is correct
39 Correct 14 ms 21076 KB Output is correct
40 Correct 16 ms 21104 KB Output is correct
41 Correct 35 ms 21236 KB Output is correct
42 Correct 113 ms 21580 KB Output is correct
43 Correct 112 ms 44096 KB Output is correct
44 Correct 115 ms 44168 KB Output is correct
45 Correct 119 ms 44108 KB Output is correct
46 Correct 143 ms 44284 KB Output is correct
47 Correct 349 ms 44732 KB Output is correct
48 Correct 14 ms 20692 KB Output is correct
49 Correct 39 ms 20692 KB Output is correct
50 Correct 133 ms 20916 KB Output is correct
51 Correct 264 ms 21376 KB Output is correct
52 Correct 43 ms 30924 KB Output is correct
53 Correct 82 ms 30800 KB Output is correct
54 Correct 245 ms 31056 KB Output is correct
55 Correct 466 ms 31436 KB Output is correct
56 Correct 203 ms 81932 KB Output is correct
57 Correct 274 ms 81980 KB Output is correct
58 Correct 549 ms 82216 KB Output is correct
59 Correct 893 ms 82508 KB Output is correct
60 Correct 435 ms 150248 KB Output is correct
61 Correct 508 ms 150328 KB Output is correct
62 Correct 876 ms 150552 KB Output is correct
63 Correct 1305 ms 151012 KB Output is correct
64 Correct 2247 ms 150932 KB Output is correct
65 Correct 2123 ms 125216 KB Output is correct
66 Correct 2125 ms 128252 KB Output is correct
67 Correct 2125 ms 127552 KB Output is correct
68 Correct 2108 ms 128076 KB Output is correct
69 Correct 2112 ms 121696 KB Output is correct
70 Correct 1759 ms 88392 KB Output is correct
71 Correct 2815 ms 152376 KB Output is correct
72 Correct 2792 ms 152328 KB Output is correct
73 Correct 2772 ms 152468 KB Output is correct
74 Correct 2741 ms 151928 KB Output is correct
75 Correct 2689 ms 143944 KB Output is correct
76 Correct 2314 ms 101984 KB Output is correct
77 Correct 2889 ms 165044 KB Output is correct
78 Correct 2861 ms 164984 KB Output is correct
79 Correct 2864 ms 165032 KB Output is correct
80 Correct 2947 ms 164292 KB Output is correct
81 Correct 2825 ms 155456 KB Output is correct
82 Correct 2288 ms 107452 KB Output is correct
83 Correct 2897 ms 165124 KB Output is correct
84 Correct 2887 ms 165208 KB Output is correct
85 Correct 2966 ms 165048 KB Output is correct
86 Correct 2910 ms 164540 KB Output is correct
87 Correct 2765 ms 155548 KB Output is correct
88 Correct 2279 ms 107496 KB Output is correct
89 Correct 2063 ms 126536 KB Output is correct
90 Correct 2354 ms 136892 KB Output is correct
91 Correct 2720 ms 148712 KB Output is correct
92 Correct 2806 ms 152532 KB Output is correct
93 Correct 2925 ms 157032 KB Output is correct
94 Correct 2908 ms 160556 KB Output is correct
95 Correct 2912 ms 165204 KB Output is correct
96 Correct 2898 ms 165012 KB Output is correct
97 Correct 2879 ms 165216 KB Output is correct
98 Correct 2823 ms 164892 KB Output is correct
99 Correct 2877 ms 164932 KB Output is correct
100 Correct 2861 ms 165300 KB Output is correct