oj.uz

Submission #946692

# Submission time Handle Problem Language Result Execution time Memory
946692 2024-03-14T22:32:18 Z Vladth11 Dynamic Diameter (CEOI19_diameter) C++14
100 / 100
 2852 ms 206232 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 = 100002;
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 3 ms 16728 KB Output is correct
2 Correct 3 ms 16988 KB Output is correct
3 Correct 3 ms 16988 KB Output is correct
4 Correct 3 ms 16988 KB Output is correct
5 Correct 3 ms 16988 KB Output is correct
6 Correct 3 ms 16984 KB Output is correct
7 Correct 3 ms 16984 KB Output is correct
8 Correct 3 ms 16988 KB Output is correct
9 Correct 3 ms 16988 KB Output is correct
10 Correct 3 ms 16984 KB Output is correct
11 Correct 3 ms 16988 KB Output is correct
12 Correct 3 ms 16988 KB Output is correct
13 Correct 3 ms 16988 KB Output is correct
14 Correct 3 ms 16988 KB Output is correct
15 Correct 3 ms 16988 KB Output is correct
16 Correct 3 ms 16988 KB Output is correct
17 Correct 3 ms 16988 KB Output is correct
18 Correct 3 ms 16984 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 16728 KB Output is correct
2 Correct 3 ms 16988 KB Output is correct
3 Correct 3 ms 16988 KB Output is correct
4 Correct 3 ms 16988 KB Output is correct
5 Correct 3 ms 16988 KB Output is correct
6 Correct 3 ms 16984 KB Output is correct
7 Correct 3 ms 16984 KB Output is correct
8 Correct 3 ms 16988 KB Output is correct
9 Correct 3 ms 16988 KB Output is correct
10 Correct 3 ms 16984 KB Output is correct
11 Correct 3 ms 16988 KB Output is correct
12 Correct 3 ms 16988 KB Output is correct
13 Correct 3 ms 16988 KB Output is correct
14 Correct 3 ms 16988 KB Output is correct
15 Correct 3 ms 16988 KB Output is correct
16 Correct 3 ms 16988 KB Output is correct
17 Correct 3 ms 16988 KB Output is correct
18 Correct 3 ms 16984 KB Output is correct
19 Correct 19 ms 17752 KB Output is correct
20 Correct 23 ms 17904 KB Output is correct
21 Correct 22 ms 18008 KB Output is correct
22 Correct 22 ms 18268 KB Output is correct
23 Correct 32 ms 21596 KB Output is correct
24 Correct 41 ms 22744 KB Output is correct
25 Correct 46 ms 23720 KB Output is correct
26 Correct 46 ms 24696 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 16988 KB Output is correct
2 Correct 3 ms 16988 KB Output is correct
3 Correct 4 ms 16944 KB Output is correct
4 Correct 12 ms 16988 KB Output is correct
5 Correct 50 ms 17324 KB Output is correct
6 Correct 4 ms 16732 KB Output is correct
7 Correct 3 ms 16988 KB Output is correct
8 Correct 4 ms 16984 KB Output is correct
9 Correct 5 ms 16988 KB Output is correct
10 Correct 17 ms 17216 KB Output is correct
11 Correct 70 ms 17492 KB Output is correct
12 Correct 7 ms 19032 KB Output is correct
13 Correct 7 ms 19036 KB Output is correct
14 Correct 9 ms 19036 KB Output is correct
15 Correct 26 ms 19188 KB Output is correct
16 Correct 98 ms 19540 KB Output is correct
17 Correct 110 ms 61116 KB Output is correct
18 Correct 111 ms 61120 KB Output is correct
19 Correct 111 ms 61252 KB Output is correct
20 Correct 147 ms 61340 KB Output is correct
21 Correct 290 ms 61680 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 18012 KB Output is correct
2 Correct 26 ms 18012 KB Output is correct
3 Correct 112 ms 18256 KB Output is correct
4 Correct 219 ms 18516 KB Output is correct
5 Correct 31 ms 31576 KB Output is correct
6 Correct 64 ms 31788 KB Output is correct
7 Correct 206 ms 32008 KB Output is correct
8 Correct 403 ms 32200 KB Output is correct
9 Correct 191 ms 101004 KB Output is correct
10 Correct 263 ms 101112 KB Output is correct
11 Correct 473 ms 101464 KB Output is correct
12 Correct 767 ms 101540 KB Output is correct
13 Correct 409 ms 190036 KB Output is correct
14 Correct 471 ms 189864 KB Output is correct
15 Correct 773 ms 190288 KB Output is correct
16 Correct 1126 ms 190800 KB Output is correct
17 Correct 1887 ms 190584 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1922 ms 163176 KB Output is correct
2 Correct 2092 ms 168168 KB Output is correct
3 Correct 2000 ms 167588 KB Output is correct
4 Correct 2098 ms 167472 KB Output is correct
5 Correct 1915 ms 159696 KB Output is correct
6 Correct 1622 ms 118052 KB Output is correct
7 Correct 2705 ms 194984 KB Output is correct
8 Correct 2742 ms 194832 KB Output is correct
9 Correct 2656 ms 195152 KB Output is correct
10 Correct 2682 ms 194556 KB Output is correct
11 Correct 2577 ms 184944 KB Output is correct
12 Correct 2132 ms 133468 KB Output is correct
13 Correct 2710 ms 206212 KB Output is correct
14 Correct 2581 ms 206152 KB Output is correct
15 Correct 2579 ms 205788 KB Output is correct
16 Correct 2650 ms 205296 KB Output is correct
17 Correct 2441 ms 195232 KB Output is correct
18 Correct 1932 ms 139040 KB Output is correct
19 Correct 2629 ms 205756 KB Output is correct
20 Correct 2653 ms 206232 KB Output is correct
21 Correct 2717 ms 205980 KB Output is correct
22 Correct 2626 ms 205396 KB Output is correct
23 Correct 2513 ms 195088 KB Output is correct
24 Correct 2066 ms 138720 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 16728 KB Output is correct
2 Correct 3 ms 16988 KB Output is correct
3 Correct 3 ms 16988 KB Output is correct
4 Correct 3 ms 16988 KB Output is correct
5 Correct 3 ms 16988 KB Output is correct
6 Correct 3 ms 16984 KB Output is correct
7 Correct 3 ms 16984 KB Output is correct
8 Correct 3 ms 16988 KB Output is correct
9 Correct 3 ms 16988 KB Output is correct
10 Correct 3 ms 16984 KB Output is correct
11 Correct 3 ms 16988 KB Output is correct
12 Correct 3 ms 16988 KB Output is correct
13 Correct 3 ms 16988 KB Output is correct
14 Correct 3 ms 16988 KB Output is correct
15 Correct 3 ms 16988 KB Output is correct
16 Correct 3 ms 16988 KB Output is correct
17 Correct 3 ms 16988 KB Output is correct
18 Correct 3 ms 16984 KB Output is correct
19 Correct 19 ms 17752 KB Output is correct
20 Correct 23 ms 17904 KB Output is correct
21 Correct 22 ms 18008 KB Output is correct
22 Correct 22 ms 18268 KB Output is correct
23 Correct 32 ms 21596 KB Output is correct
24 Correct 41 ms 22744 KB Output is correct
25 Correct 46 ms 23720 KB Output is correct
26 Correct 46 ms 24696 KB Output is correct
27 Correct 3 ms 16988 KB Output is correct
28 Correct 3 ms 16988 KB Output is correct
29 Correct 4 ms 16944 KB Output is correct
30 Correct 12 ms 16988 KB Output is correct
31 Correct 50 ms 17324 KB Output is correct
32 Correct 4 ms 16732 KB Output is correct
33 Correct 3 ms 16988 KB Output is correct
34 Correct 4 ms 16984 KB Output is correct
35 Correct 5 ms 16988 KB Output is correct
36 Correct 17 ms 17216 KB Output is correct
37 Correct 70 ms 17492 KB Output is correct
38 Correct 7 ms 19032 KB Output is correct
39 Correct 7 ms 19036 KB Output is correct
40 Correct 9 ms 19036 KB Output is correct
41 Correct 26 ms 19188 KB Output is correct
42 Correct 98 ms 19540 KB Output is correct
43 Correct 110 ms 61116 KB Output is correct
44 Correct 111 ms 61120 KB Output is correct
45 Correct 111 ms 61252 KB Output is correct
46 Correct 147 ms 61340 KB Output is correct
47 Correct 290 ms 61680 KB Output is correct
48 Correct 7 ms 18012 KB Output is correct
49 Correct 26 ms 18012 KB Output is correct
50 Correct 112 ms 18256 KB Output is correct
51 Correct 219 ms 18516 KB Output is correct
52 Correct 31 ms 31576 KB Output is correct
53 Correct 64 ms 31788 KB Output is correct
54 Correct 206 ms 32008 KB Output is correct
55 Correct 403 ms 32200 KB Output is correct
56 Correct 191 ms 101004 KB Output is correct
57 Correct 263 ms 101112 KB Output is correct
58 Correct 473 ms 101464 KB Output is correct
59 Correct 767 ms 101540 KB Output is correct
60 Correct 409 ms 190036 KB Output is correct
61 Correct 471 ms 189864 KB Output is correct
62 Correct 773 ms 190288 KB Output is correct
63 Correct 1126 ms 190800 KB Output is correct
64 Correct 1887 ms 190584 KB Output is correct
65 Correct 1922 ms 163176 KB Output is correct
66 Correct 2092 ms 168168 KB Output is correct
67 Correct 2000 ms 167588 KB Output is correct
68 Correct 2098 ms 167472 KB Output is correct
69 Correct 1915 ms 159696 KB Output is correct
70 Correct 1622 ms 118052 KB Output is correct
71 Correct 2705 ms 194984 KB Output is correct
72 Correct 2742 ms 194832 KB Output is correct
73 Correct 2656 ms 195152 KB Output is correct
74 Correct 2682 ms 194556 KB Output is correct
75 Correct 2577 ms 184944 KB Output is correct
76 Correct 2132 ms 133468 KB Output is correct
77 Correct 2710 ms 206212 KB Output is correct
78 Correct 2581 ms 206152 KB Output is correct
79 Correct 2579 ms 205788 KB Output is correct
80 Correct 2650 ms 205296 KB Output is correct
81 Correct 2441 ms 195232 KB Output is correct
82 Correct 1932 ms 139040 KB Output is correct
83 Correct 2629 ms 205756 KB Output is correct
84 Correct 2653 ms 206232 KB Output is correct
85 Correct 2717 ms 205980 KB Output is correct
86 Correct 2626 ms 205396 KB Output is correct
87 Correct 2513 ms 195088 KB Output is correct
88 Correct 2066 ms 138720 KB Output is correct
89 Correct 2013 ms 165328 KB Output is correct
90 Correct 2335 ms 178152 KB Output is correct
91 Correct 2781 ms 191464 KB Output is correct
92 Correct 2711 ms 194880 KB Output is correct
93 Correct 2852 ms 197144 KB Output is correct
94 Correct 2628 ms 200500 KB Output is correct
95 Correct 2611 ms 203500 KB Output is correct
96 Correct 2583 ms 203420 KB Output is correct
97 Correct 2633 ms 203832 KB Output is correct
98 Correct 2548 ms 203552 KB Output is correct
99 Correct 2581 ms 203948 KB Output is correct
100 Correct 2589 ms 203764 KB Output is correct