oj.uz

Submission #946675

# Submission time Handle Problem Language Result Execution time Memory
946675 2024-03-14T21:58:50 Z Vladth11 Dynamic Diameter (CEOI19_diameter) C++14
100 / 100
 2921 ms 236564 KB 
#include <bits/stdc++.h>
#define debug(x) cerr << #x << " " << x << "\n"
#define debugs(x) cerr << #x << " " << x << " "
#pragma GCC optimize("Ofast")
 
#define int ll
 
using namespace std;
typedef long long ll;
typedef pair <ll, ll> pii;
 
const ll NMAX = 300002;
const ll INF = (1LL << 58);
const ll nrbits = 18;
const ll MOD = 998244353;
 
vector <pii> v[NMAX];
vector <int> children[NMAX];
int n;
pii timp[NMAX * nrbits];
 
struct edge {
    int a, b;
    ll c;
} edges[NMAX];
 
class AINT {
public:
    struct Node {
        ll mx, lazy;
    };
    Node* aint;
    int n;
    void init(int _n) {
        n = _n;
        aint = new Node[4 * (n + 1)];
        for(int i = 0; i < 4 * (n + 1); i++) {
            aint[i].mx = 0;
            aint[i].lazy = 0;
        }
    }
    Node combine(Node a, Node b) {
        Node sol = {0, 0};
        sol.mx = max(a.mx, b.mx);
        return sol;
    }
    void propaga(int node, int st, int dr) {
        if(st != dr) {
            aint[node * 2].lazy += aint[node].lazy;
            aint[node * 2 + 1].lazy += aint[node].lazy;
        }
        aint[node].mx += aint[node].lazy;
        aint[node].lazy = 0;
    }
    void baga(int node, int st, int dr, int a, int b, int val) {
        propaga(node, st, dr);
        if(a <= st && dr <= b) {
            aint[node].lazy += val;
            return;
        }
        int mid = (st + dr) / 2;
        if(a <= mid) {
            baga(node * 2, st, mid, a, b, val);
        }
        if(b > mid) {
            baga(node * 2 + 1, mid + 1, dr, a, b, val);
        }
        propaga(node * 2, st, mid);
        propaga(node * 2 + 1, mid + 1, dr);
        aint[node] = combine(aint[node * 2], aint[node * 2 + 1]);
    }
    ll sol(int node, int st, int dr, int a, int b){
        propaga(node, st, dr);
        if(a <= st && dr <= b){
            return aint[node].mx;
        }
        int mid = (st + dr) / 2;
        ll maxim = 0;
        if(a <= mid)
            maxim = max(maxim, sol(node * 2, st, mid, a, b));
        if(b > mid)
            maxim = max(maxim, sol(node * 2 + 1, mid + 1, dr, a, b));
        return maxim;
    }
    void update(int st, int dr, int val) {
        baga(1, 1, n, st, dr, val);
    }
    ll query(int st, int dr) {
        return sol(1, 1, n, st, dr);
    }
} st[NMAX];
 
int viz[NMAX];
int stamp;
 
struct event {
    int st, dr, unde, subarb;
};
 
vector <event> events[NMAX];
 
multiset <ll> candidates;
multiset <ll> indv[NMAX];
 
int sz[NMAX];
int total;
 
void getsz(int node, int p) {
    sz[node] = 1;
    for(auto x : v[node]) {
        if(x.first == p || viz[x.first]) continue;
        getsz(x.first, node);
        sz[node] += sz[x.first];
    }
    total = sz[node];
}
 
int findCentroid(int node, int p) {
    for(auto x : v[node]) {
        if(x.first == p || viz[x.first]) continue;
        if(sz[x.first] > total / 2)
            return findCentroid(x.first, node);
    }
    return node;
}
 
int unde;
int subarb;
 
void DFS(int node, int p) {
    stamp++;
    if(timp[subarb].first == 0) timp[subarb].first = stamp;
    timp[subarb].second = stamp;
    for(auto x : v[node]) {
        if(x.first == p || viz[x.first]) continue;
        event nou = {stamp + 1, 0, unde, subarb};
        DFS(x.first, node);
        nou.dr = stamp;
        events[x.second].push_back(nou);
    }
}
 
int cnt = 0;
 
void centroid(int node) {
    getsz(node, 0);
    int C = findCentroid(node, 0);
    st[C].init(total);
    viz[C] = 1;
    stamp = 1; /// n-are logica tbh
    unde = C;
    for(auto x : v[C]){
        if(viz[x.first]) continue;
        children[C].push_back(++cnt);
        subarb = cnt;
        event nou = {stamp + 1, 0, unde, subarb};
        DFS(x.first, C);
        nou.dr = stamp;
        events[x.second].push_back(nou);
    }
    for(auto x : v[C]) {
        if(viz[x.first]) continue;
        centroid(x.first);
    }
}
 
ll compute(int i){
    if(indv[i].size() == 0)
        return 0;
    if(indv[i].size() == 1)
        return *indv[i].begin();
    auto it =indv[i].end();
    return (*prev(it) + *prev(prev(it)));
}
 
signed main() {
#ifdef HOME
    ifstream cin(".in");
    ofstream cout(".out");
#endif // HOME
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int q, w, i;
    cin >> n >> q >> w;
    for(i = 1; i < n; i++) {
        int a, b;
        ll c;
        cin >> a >> b >> c;
        v[a].push_back({b, i});
        v[b].push_back({a, i});
        edges[i] = {a, b, c};
    }
    centroid(1);
    for(int a = 1; a < n; a++) {
        for(auto x : events[a]) {
            st[x.unde].update(x.st, x.dr, edges[a].c);
        }
    }
    for(i = 1; i <= n; i++){
        //debug(i);
        for(auto x : children[i]){
            //debug(st[i].query(timp[x].first, timp[x].second));
            indv[i].insert(st[i].query(timp[x].first, timp[x].second));
        }
        candidates.insert(compute(i));
    }
    ll last = 0;
    for(i = 1; i <= q; i++) {
        ll a, b;
        cin >> a >> b;
        a += last;
        a %= (n - 1);
        b += last;
        b %= w;
        a++;
        int toAdd = b - edges[a].c;
        edges[a].c = b;
        for(auto x : events[a]) {
            candidates.erase(candidates.find(compute(x.unde)));
            indv[x.unde].erase(indv[x.unde].find(st[x.unde].query(timp[x.subarb].first, timp[x.subarb].second)));
            st[x.unde].update(x.st, x.dr, toAdd);
            indv[x.unde].insert(st[x.unde].query(timp[x.subarb].first, timp[x.subarb].second));
            candidates.insert(compute(x.unde));
        }
        cout << *prev(candidates.end()) << '\n';
        last = *prev(candidates.end());
    }
    return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 42072 KB Output is correct
2 Correct 9 ms 42076 KB Output is correct
3 Correct 9 ms 42072 KB Output is correct
4 Correct 8 ms 42076 KB Output is correct
5 Correct 9 ms 42076 KB Output is correct
6 Correct 9 ms 42076 KB Output is correct
7 Correct 9 ms 42076 KB Output is correct
8 Correct 10 ms 42048 KB Output is correct
9 Correct 9 ms 42072 KB Output is correct
10 Correct 9 ms 42152 KB Output is correct
11 Correct 9 ms 42072 KB Output is correct
12 Correct 10 ms 42332 KB Output is correct
13 Correct 9 ms 42076 KB Output is correct
14 Correct 10 ms 42076 KB Output is correct
15 Correct 10 ms 42108 KB Output is correct
16 Correct 10 ms 42344 KB Output is correct
17 Correct 9 ms 42076 KB Output is correct
18 Correct 9 ms 42076 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 42072 KB Output is correct
2 Correct 9 ms 42076 KB Output is correct
3 Correct 9 ms 42072 KB Output is correct
4 Correct 8 ms 42076 KB Output is correct
5 Correct 9 ms 42076 KB Output is correct
6 Correct 9 ms 42076 KB Output is correct
7 Correct 9 ms 42076 KB Output is correct
8 Correct 10 ms 42048 KB Output is correct
9 Correct 9 ms 42072 KB Output is correct
10 Correct 9 ms 42152 KB Output is correct
11 Correct 9 ms 42072 KB Output is correct
12 Correct 10 ms 42332 KB Output is correct
13 Correct 9 ms 42076 KB Output is correct
14 Correct 10 ms 42076 KB Output is correct
15 Correct 10 ms 42108 KB Output is correct
16 Correct 10 ms 42344 KB Output is correct
17 Correct 9 ms 42076 KB Output is correct
18 Correct 9 ms 42076 KB Output is correct
19 Correct 27 ms 42840 KB Output is correct
20 Correct 25 ms 43100 KB Output is correct
21 Correct 28 ms 43096 KB Output is correct
22 Correct 30 ms 43356 KB Output is correct
23 Correct 53 ms 46944 KB Output is correct
24 Correct 47 ms 47952 KB Output is correct
25 Correct 53 ms 48980 KB Output is correct
26 Correct 54 ms 49932 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 42076 KB Output is correct
2 Correct 9 ms 42076 KB Output is correct
3 Correct 10 ms 42072 KB Output is correct
4 Correct 18 ms 42216 KB Output is correct
5 Correct 62 ms 42332 KB Output is correct
6 Correct 8 ms 42116 KB Output is correct
7 Correct 10 ms 42332 KB Output is correct
8 Correct 9 ms 42144 KB Output is correct
9 Correct 11 ms 42336 KB Output is correct
10 Correct 30 ms 42332 KB Output is correct
11 Correct 75 ms 42576 KB Output is correct
12 Correct 13 ms 44132 KB Output is correct
13 Correct 15 ms 44120 KB Output is correct
14 Correct 15 ms 44124 KB Output is correct
15 Correct 31 ms 44124 KB Output is correct
16 Correct 104 ms 44664 KB Output is correct
17 Correct 131 ms 89880 KB Output is correct
18 Correct 121 ms 89744 KB Output is correct
19 Correct 127 ms 89792 KB Output is correct
20 Correct 158 ms 89912 KB Output is correct
21 Correct 324 ms 90468 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 43100 KB Output is correct
2 Correct 33 ms 43096 KB Output is correct
3 Correct 120 ms 43788 KB Output is correct
4 Correct 232 ms 44388 KB Output is correct
5 Correct 41 ms 57012 KB Output is correct
6 Correct 74 ms 57132 KB Output is correct
7 Correct 224 ms 57708 KB Output is correct
8 Correct 396 ms 58452 KB Output is correct
9 Correct 195 ms 128852 KB Output is correct
10 Correct 255 ms 129068 KB Output is correct
11 Correct 539 ms 129700 KB Output is correct
12 Correct 778 ms 130644 KB Output is correct
13 Correct 410 ms 220284 KB Output is correct
14 Correct 475 ms 220304 KB Output is correct
15 Correct 823 ms 221352 KB Output is correct
16 Correct 1166 ms 222288 KB Output is correct
17 Correct 1954 ms 221808 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 2072 ms 192500 KB Output is correct
2 Correct 2025 ms 198412 KB Output is correct
3 Correct 2063 ms 197996 KB Output is correct
4 Correct 2195 ms 197720 KB Output is correct
5 Correct 1991 ms 190464 KB Output is correct
6 Correct 1617 ms 148724 KB Output is correct
7 Correct 2784 ms 225780 KB Output is correct
8 Correct 2714 ms 225636 KB Output is correct
9 Correct 2717 ms 225636 KB Output is correct
10 Correct 2722 ms 224804 KB Output is correct
11 Correct 2855 ms 215136 KB Output is correct
12 Correct 2142 ms 163976 KB Output is correct
13 Correct 2737 ms 236192 KB Output is correct
14 Correct 2657 ms 236444 KB Output is correct
15 Correct 2633 ms 236268 KB Output is correct
16 Correct 2636 ms 235664 KB Output is correct
17 Correct 2524 ms 225860 KB Output is correct
18 Correct 2087 ms 169332 KB Output is correct
19 Correct 2689 ms 236344 KB Output is correct
20 Correct 2665 ms 236240 KB Output is correct
21 Correct 2753 ms 236564 KB Output is correct
22 Correct 2557 ms 235668 KB Output is correct
23 Correct 2509 ms 225768 KB Output is correct
24 Correct 2099 ms 169228 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 42072 KB Output is correct
2 Correct 9 ms 42076 KB Output is correct
3 Correct 9 ms 42072 KB Output is correct
4 Correct 8 ms 42076 KB Output is correct
5 Correct 9 ms 42076 KB Output is correct
6 Correct 9 ms 42076 KB Output is correct
7 Correct 9 ms 42076 KB Output is correct
8 Correct 10 ms 42048 KB Output is correct
9 Correct 9 ms 42072 KB Output is correct
10 Correct 9 ms 42152 KB Output is correct
11 Correct 9 ms 42072 KB Output is correct
12 Correct 10 ms 42332 KB Output is correct
13 Correct 9 ms 42076 KB Output is correct
14 Correct 10 ms 42076 KB Output is correct
15 Correct 10 ms 42108 KB Output is correct
16 Correct 10 ms 42344 KB Output is correct
17 Correct 9 ms 42076 KB Output is correct
18 Correct 9 ms 42076 KB Output is correct
19 Correct 27 ms 42840 KB Output is correct
20 Correct 25 ms 43100 KB Output is correct
21 Correct 28 ms 43096 KB Output is correct
22 Correct 30 ms 43356 KB Output is correct
23 Correct 53 ms 46944 KB Output is correct
24 Correct 47 ms 47952 KB Output is correct
25 Correct 53 ms 48980 KB Output is correct
26 Correct 54 ms 49932 KB Output is correct
27 Correct 9 ms 42076 KB Output is correct
28 Correct 9 ms 42076 KB Output is correct
29 Correct 10 ms 42072 KB Output is correct
30 Correct 18 ms 42216 KB Output is correct
31 Correct 62 ms 42332 KB Output is correct
32 Correct 8 ms 42116 KB Output is correct
33 Correct 10 ms 42332 KB Output is correct
34 Correct 9 ms 42144 KB Output is correct
35 Correct 11 ms 42336 KB Output is correct
36 Correct 30 ms 42332 KB Output is correct
37 Correct 75 ms 42576 KB Output is correct
38 Correct 13 ms 44132 KB Output is correct
39 Correct 15 ms 44120 KB Output is correct
40 Correct 15 ms 44124 KB Output is correct
41 Correct 31 ms 44124 KB Output is correct
42 Correct 104 ms 44664 KB Output is correct
43 Correct 131 ms 89880 KB Output is correct
44 Correct 121 ms 89744 KB Output is correct
45 Correct 127 ms 89792 KB Output is correct
46 Correct 158 ms 89912 KB Output is correct
47 Correct 324 ms 90468 KB Output is correct
48 Correct 16 ms 43100 KB Output is correct
49 Correct 33 ms 43096 KB Output is correct
50 Correct 120 ms 43788 KB Output is correct
51 Correct 232 ms 44388 KB Output is correct
52 Correct 41 ms 57012 KB Output is correct
53 Correct 74 ms 57132 KB Output is correct
54 Correct 224 ms 57708 KB Output is correct
55 Correct 396 ms 58452 KB Output is correct
56 Correct 195 ms 128852 KB Output is correct
57 Correct 255 ms 129068 KB Output is correct
58 Correct 539 ms 129700 KB Output is correct
59 Correct 778 ms 130644 KB Output is correct
60 Correct 410 ms 220284 KB Output is correct
61 Correct 475 ms 220304 KB Output is correct
62 Correct 823 ms 221352 KB Output is correct
63 Correct 1166 ms 222288 KB Output is correct
64 Correct 1954 ms 221808 KB Output is correct
65 Correct 2072 ms 192500 KB Output is correct
66 Correct 2025 ms 198412 KB Output is correct
67 Correct 2063 ms 197996 KB Output is correct
68 Correct 2195 ms 197720 KB Output is correct
69 Correct 1991 ms 190464 KB Output is correct
70 Correct 1617 ms 148724 KB Output is correct
71 Correct 2784 ms 225780 KB Output is correct
72 Correct 2714 ms 225636 KB Output is correct
73 Correct 2717 ms 225636 KB Output is correct
74 Correct 2722 ms 224804 KB Output is correct
75 Correct 2855 ms 215136 KB Output is correct
76 Correct 2142 ms 163976 KB Output is correct
77 Correct 2737 ms 236192 KB Output is correct
78 Correct 2657 ms 236444 KB Output is correct
79 Correct 2633 ms 236268 KB Output is correct
80 Correct 2636 ms 235664 KB Output is correct
81 Correct 2524 ms 225860 KB Output is correct
82 Correct 2087 ms 169332 KB Output is correct
83 Correct 2689 ms 236344 KB Output is correct
84 Correct 2665 ms 236240 KB Output is correct
85 Correct 2753 ms 236564 KB Output is correct
86 Correct 2557 ms 235668 KB Output is correct
87 Correct 2509 ms 225768 KB Output is correct
88 Correct 2099 ms 169228 KB Output is correct
89 Correct 1981 ms 195556 KB Output is correct
90 Correct 2316 ms 207724 KB Output is correct
91 Correct 2708 ms 220872 KB Output is correct
92 Correct 2818 ms 224656 KB Output is correct
93 Correct 2873 ms 229232 KB Output is correct
94 Correct 2921 ms 232520 KB Output is correct
95 Correct 2884 ms 235780 KB Output is correct
96 Correct 2732 ms 236036 KB Output is correct
97 Correct 2670 ms 235876 KB Output is correct
98 Correct 2765 ms 235576 KB Output is correct
99 Correct 2681 ms 235780 KB Output is correct
100 Correct 2748 ms 236184 KB Output is correct