oj.uz

Submission #946694

# Submission time Handle Problem Language Result Execution time Memory
946694 2024-03-14T22:39:28 Z Vladth11 Dynamic Diameter (CEOI19_diameter) C++14
100 / 100
 2928 ms 177044 KB 
#include <bits/stdc++.h>
#define debug(x) cerr << #x << " " << x << "\n"
#define debugs(x) cerr << #x << " " << x << " "
#pragma GCC optimize("Ofast")

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, ll 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, ll 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)));
}

int 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, i;
    ll w;
    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 17240 KB Output is correct
2 Correct 3 ms 17244 KB Output is correct
3 Correct 3 ms 17240 KB Output is correct
4 Correct 3 ms 17244 KB Output is correct
5 Correct 3 ms 17244 KB Output is correct
6 Correct 4 ms 17244 KB Output is correct
7 Correct 3 ms 17244 KB Output is correct
8 Correct 3 ms 17500 KB Output is correct
9 Correct 4 ms 17500 KB Output is correct
10 Correct 4 ms 17500 KB Output is correct
11 Correct 4 ms 17496 KB Output is correct
12 Correct 4 ms 17500 KB Output is correct
13 Correct 4 ms 17752 KB Output is correct
14 Correct 4 ms 17420 KB Output is correct
15 Correct 4 ms 17500 KB Output is correct
16 Correct 4 ms 17500 KB Output is correct
17 Correct 4 ms 17500 KB Output is correct
18 Correct 4 ms 17752 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 17240 KB Output is correct
2 Correct 3 ms 17244 KB Output is correct
3 Correct 3 ms 17240 KB Output is correct
4 Correct 3 ms 17244 KB Output is correct
5 Correct 3 ms 17244 KB Output is correct
6 Correct 4 ms 17244 KB Output is correct
7 Correct 3 ms 17244 KB Output is correct
8 Correct 3 ms 17500 KB Output is correct
9 Correct 4 ms 17500 KB Output is correct
10 Correct 4 ms 17500 KB Output is correct
11 Correct 4 ms 17496 KB Output is correct
12 Correct 4 ms 17500 KB Output is correct
13 Correct 4 ms 17752 KB Output is correct
14 Correct 4 ms 17420 KB Output is correct
15 Correct 4 ms 17500 KB Output is correct
16 Correct 4 ms 17500 KB Output is correct
17 Correct 4 ms 17500 KB Output is correct
18 Correct 4 ms 17752 KB Output is correct
19 Correct 18 ms 18236 KB Output is correct
20 Correct 20 ms 18276 KB Output is correct
21 Correct 24 ms 18264 KB Output is correct
22 Correct 22 ms 18524 KB Output is correct
23 Correct 33 ms 21340 KB Output is correct
24 Correct 42 ms 22484 KB Output is correct
25 Correct 53 ms 23400 KB Output is correct
26 Correct 62 ms 23900 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 17244 KB Output is correct
2 Correct 3 ms 17244 KB Output is correct
3 Correct 5 ms 17244 KB Output is correct
4 Correct 13 ms 17520 KB Output is correct
5 Correct 55 ms 17868 KB Output is correct
6 Correct 3 ms 17244 KB Output is correct
7 Correct 4 ms 17500 KB Output is correct
8 Correct 4 ms 17496 KB Output is correct
9 Correct 5 ms 17500 KB Output is correct
10 Correct 18 ms 17752 KB Output is correct
11 Correct 77 ms 17976 KB Output is correct
12 Correct 8 ms 19288 KB Output is correct
13 Correct 9 ms 19292 KB Output is correct
14 Correct 9 ms 19292 KB Output is correct
15 Correct 27 ms 19508 KB Output is correct
16 Correct 101 ms 19920 KB Output is correct
17 Correct 118 ms 57536 KB Output is correct
18 Correct 116 ms 57604 KB Output is correct
19 Correct 143 ms 57536 KB Output is correct
20 Correct 160 ms 58044 KB Output is correct
21 Correct 321 ms 58300 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 18268 KB Output is correct
2 Correct 27 ms 18432 KB Output is correct
3 Correct 113 ms 18392 KB Output is correct
4 Correct 240 ms 18964 KB Output is correct
5 Correct 32 ms 29672 KB Output is correct
6 Correct 67 ms 29852 KB Output is correct
7 Correct 216 ms 30336 KB Output is correct
8 Correct 399 ms 30320 KB Output is correct
9 Correct 200 ms 87124 KB Output is correct
10 Correct 252 ms 87356 KB Output is correct
11 Correct 461 ms 87372 KB Output is correct
12 Correct 807 ms 88080 KB Output is correct
13 Correct 418 ms 163836 KB Output is correct
14 Correct 456 ms 163924 KB Output is correct
15 Correct 776 ms 164476 KB Output is correct
16 Correct 1189 ms 164812 KB Output is correct
17 Correct 2005 ms 164700 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1943 ms 137316 KB Output is correct
2 Correct 2136 ms 140772 KB Output is correct
3 Correct 2001 ms 139696 KB Output is correct
4 Correct 2024 ms 140508 KB Output is correct
5 Correct 2004 ms 134616 KB Output is correct
6 Correct 1627 ms 101312 KB Output is correct
7 Correct 2836 ms 165696 KB Output is correct
8 Correct 2872 ms 165956 KB Output is correct
9 Correct 2725 ms 166400 KB Output is correct
10 Correct 2801 ms 165228 KB Output is correct
11 Correct 2734 ms 157784 KB Output is correct
12 Correct 2162 ms 115588 KB Output is correct
13 Correct 2580 ms 176596 KB Output is correct
14 Correct 2690 ms 177044 KB Output is correct
15 Correct 2652 ms 176684 KB Output is correct
16 Correct 2783 ms 176320 KB Output is correct
17 Correct 2564 ms 167328 KB Output is correct
18 Correct 2013 ms 120508 KB Output is correct
19 Correct 2665 ms 176904 KB Output is correct
20 Correct 2754 ms 176648 KB Output is correct
21 Correct 2707 ms 176468 KB Output is correct
22 Correct 2711 ms 176164 KB Output is correct
23 Correct 2575 ms 167396 KB Output is correct
24 Correct 2059 ms 120304 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 17240 KB Output is correct
2 Correct 3 ms 17244 KB Output is correct
3 Correct 3 ms 17240 KB Output is correct
4 Correct 3 ms 17244 KB Output is correct
5 Correct 3 ms 17244 KB Output is correct
6 Correct 4 ms 17244 KB Output is correct
7 Correct 3 ms 17244 KB Output is correct
8 Correct 3 ms 17500 KB Output is correct
9 Correct 4 ms 17500 KB Output is correct
10 Correct 4 ms 17500 KB Output is correct
11 Correct 4 ms 17496 KB Output is correct
12 Correct 4 ms 17500 KB Output is correct
13 Correct 4 ms 17752 KB Output is correct
14 Correct 4 ms 17420 KB Output is correct
15 Correct 4 ms 17500 KB Output is correct
16 Correct 4 ms 17500 KB Output is correct
17 Correct 4 ms 17500 KB Output is correct
18 Correct 4 ms 17752 KB Output is correct
19 Correct 18 ms 18236 KB Output is correct
20 Correct 20 ms 18276 KB Output is correct
21 Correct 24 ms 18264 KB Output is correct
22 Correct 22 ms 18524 KB Output is correct
23 Correct 33 ms 21340 KB Output is correct
24 Correct 42 ms 22484 KB Output is correct
25 Correct 53 ms 23400 KB Output is correct
26 Correct 62 ms 23900 KB Output is correct
27 Correct 3 ms 17244 KB Output is correct
28 Correct 3 ms 17244 KB Output is correct
29 Correct 5 ms 17244 KB Output is correct
30 Correct 13 ms 17520 KB Output is correct
31 Correct 55 ms 17868 KB Output is correct
32 Correct 3 ms 17244 KB Output is correct
33 Correct 4 ms 17500 KB Output is correct
34 Correct 4 ms 17496 KB Output is correct
35 Correct 5 ms 17500 KB Output is correct
36 Correct 18 ms 17752 KB Output is correct
37 Correct 77 ms 17976 KB Output is correct
38 Correct 8 ms 19288 KB Output is correct
39 Correct 9 ms 19292 KB Output is correct
40 Correct 9 ms 19292 KB Output is correct
41 Correct 27 ms 19508 KB Output is correct
42 Correct 101 ms 19920 KB Output is correct
43 Correct 118 ms 57536 KB Output is correct
44 Correct 116 ms 57604 KB Output is correct
45 Correct 143 ms 57536 KB Output is correct
46 Correct 160 ms 58044 KB Output is correct
47 Correct 321 ms 58300 KB Output is correct
48 Correct 7 ms 18268 KB Output is correct
49 Correct 27 ms 18432 KB Output is correct
50 Correct 113 ms 18392 KB Output is correct
51 Correct 240 ms 18964 KB Output is correct
52 Correct 32 ms 29672 KB Output is correct
53 Correct 67 ms 29852 KB Output is correct
54 Correct 216 ms 30336 KB Output is correct
55 Correct 399 ms 30320 KB Output is correct
56 Correct 200 ms 87124 KB Output is correct
57 Correct 252 ms 87356 KB Output is correct
58 Correct 461 ms 87372 KB Output is correct
59 Correct 807 ms 88080 KB Output is correct
60 Correct 418 ms 163836 KB Output is correct
61 Correct 456 ms 163924 KB Output is correct
62 Correct 776 ms 164476 KB Output is correct
63 Correct 1189 ms 164812 KB Output is correct
64 Correct 2005 ms 164700 KB Output is correct
65 Correct 1943 ms 137316 KB Output is correct
66 Correct 2136 ms 140772 KB Output is correct
67 Correct 2001 ms 139696 KB Output is correct
68 Correct 2024 ms 140508 KB Output is correct
69 Correct 2004 ms 134616 KB Output is correct
70 Correct 1627 ms 101312 KB Output is correct
71 Correct 2836 ms 165696 KB Output is correct
72 Correct 2872 ms 165956 KB Output is correct
73 Correct 2725 ms 166400 KB Output is correct
74 Correct 2801 ms 165228 KB Output is correct
75 Correct 2734 ms 157784 KB Output is correct
76 Correct 2162 ms 115588 KB Output is correct
77 Correct 2580 ms 176596 KB Output is correct
78 Correct 2690 ms 177044 KB Output is correct
79 Correct 2652 ms 176684 KB Output is correct
80 Correct 2783 ms 176320 KB Output is correct
81 Correct 2564 ms 167328 KB Output is correct
82 Correct 2013 ms 120508 KB Output is correct
83 Correct 2665 ms 176904 KB Output is correct
84 Correct 2754 ms 176648 KB Output is correct
85 Correct 2707 ms 176468 KB Output is correct
86 Correct 2711 ms 176164 KB Output is correct
87 Correct 2575 ms 167396 KB Output is correct
88 Correct 2059 ms 120304 KB Output is correct
89 Correct 1991 ms 138552 KB Output is correct
90 Correct 2332 ms 149952 KB Output is correct
91 Correct 2681 ms 162336 KB Output is correct
92 Correct 2803 ms 165828 KB Output is correct
93 Correct 2928 ms 170084 KB Output is correct
94 Correct 2792 ms 173076 KB Output is correct
95 Correct 2660 ms 176800 KB Output is correct
96 Correct 2616 ms 176412 KB Output is correct
97 Correct 2495 ms 176224 KB Output is correct
98 Correct 2623 ms 176604 KB Output is correct
99 Correct 2738 ms 176300 KB Output is correct
100 Correct 2573 ms 176916 KB Output is correct