oj.uz

Submission #835243

# Submission time Handle Problem Language Result Execution time Memory
835243 2023-08-23T11:00:12 Z Josia Dynamic Diameter (CEOI19_diameter) C++17
31 / 100
 5000 ms 320984 KB 
#include <bits/stdc++.h>

using namespace std;

#define int int64_t


struct seg {
    int n;
    vector<int> tree;
    vector<int> lazy;

    void push(int v) {
        tree[v*2] += lazy[v];
        tree[v*2+1] += lazy[v];

        lazy[v*2] += lazy[v];
        lazy[v*2+1] += lazy[v];

        lazy[v] = 0;
    }

    int query(int v, int rl, int rr, int ql, int qr) {
        if (ql > qr) {
            return 0;
        }
        if (ql == rl && qr == rr) return tree[v];

        push(v);

        int rm = (rl + rr) / 2;

        return max(query(v*2, rl, rm, ql, min(rm, qr)), query(v*2+1, rm+1, rr, max(rm+1, ql), qr));
    }

    void update(int v, int rl, int rr, int ql, int qr, int x) {
        if (ql > qr) {
            return;
        }
        if (ql == rl && qr == rr) {
            tree[v] += x;
            lazy[v] += x;
            return;
        }

        push(v);

        int rm = (rl + rr) / 2;

        update(v*2, rl, rm, ql, min(rm, qr), x);
        update(v*2+1, rm+1, rr, max(rm+1, ql), qr, x);

        tree[v] = max(tree[v*2], tree[v*2+1]);
    }

    void init(int _n, vector<int> a) {
        n = _n;
        tree.assign(n*4, 0);
        lazy.assign(n*4, 0);

        // for (int i = 0; i<n; i++) {
        //     update(1, 0, n-1, i, i, a[i]);
        // }
    }
};


vector<vector<int>> graph;


vector<vector<int>> parent;
vector<vector<int>> Size;
vector<vector<int>> whichSubtree;
vector<vector<pair<int, int>>> prepost;


vector<int> centroidLevel;

struct tree {
    int level;
    int currCol = 0;

    seg segtree;

    vector<int> order;
    set<int> verticies;
    vector<int> children;
    int dfs(int v, int p, int forbidden) {
        verticies.insert(v);
        prepost[level][v].first = order.size();
        order.push_back(v);
        parent[level][v] = p;

        if (p!=-1) whichSubtree[level][v] = currCol;

        int s = 1;

        for (int i: graph[v]) {
            if (i == p || centroidLevel[i]!=-1) continue;
            s += dfs(i, v, forbidden);
            if (p==-1) {
                children.push_back(i);
                currCol++;
            }
        }
        Size[level][v] = s;
        prepost[level][v].second = order.size()-1;
        return s;
    }


    bool isCentroid(int v, int p, int forbidden) {
        int s = 1;
        for (int i: graph[v]) {
            if (i == p || centroidLevel[i]!=-1) continue;
            if (Size[level][i] > (int)verticies.size()/2) return 0;
            s += Size[level][i];
        }
        return (int)verticies.size()-s <= (int)verticies.size()/2;
    }

    int findCentroid(int v, int p, int forbidden) {
        if (isCentroid(v, p, forbidden)) return v;

        int biggest=0;
        int indBiggest=-1;
        for (int i: graph[v]) {
            if (i == p || centroidLevel[i]!=-1) continue;
            if (Size[level][i] > biggest) {
                biggest = Size[level][i];
                indBiggest = i;
            }
        }
        // cerr << v << ": ";
        // for (int i: verticies) cerr << i << " ";
        // cerr << "\n";
        assert(indBiggest!=-1);
        return findCentroid(indBiggest, v, forbidden);
    }



    bool isParent(int p, int v) {
        return (parent[level][v] == p);
    }


    set<pair<int, int>> bestInChild;


    void updateEdge(int u, int v, int x) {
        if (verticies.count(u)==0 || verticies.count(v)==0) return;
        if (!isParent(u, v)) swap(u, v);

        int child = whichSubtree[level][v];

        pair<int, int> rangeChild = prepost[level][children[child]];
        bestInChild.erase({segtree.query(1, 0, segtree.n-1, rangeChild.first, rangeChild.second), child});

        pair<int, int> rangeUpdate = prepost[level][v];
        segtree.update(1, 0, segtree.n-1, rangeUpdate.first, rangeUpdate.second, x);

        bestInChild.insert({segtree.query(1, 0, segtree.n-1, rangeChild.first, rangeChild.second), child});
    }

    int getDiam() {
        if (bestInChild.empty()) return 0;
        if (bestInChild.size()==1) return (*bestInChild.rbegin()).first;
        return (*bestInChild.rbegin()).first + (*next(bestInChild.rbegin())).first;
    }

    pair<int, vector<int>> init(int v, int _level, int forbidden) {
        level = _level;
        currCol = 0;
        order.clear();

        dfs(v, -1, forbidden);

        int centroid = findCentroid(v, -1, forbidden);

        currCol = 0;
        order.clear();
        verticies.clear();
        children.clear();
        dfs(centroid, -1, forbidden);

        segtree.init(order.size(), vector<int>());

        for (int i = 0; i<(int)children.size(); i++) {
            auto range = prepost[level][children[i]];
            bestInChild.insert({segtree.query(1, 0, segtree.n-1, range.first, range.second), i});
        }

        return {centroid, children};
    }
};




int N, Q, W;




vector<tree> trees;
vector<vector<int>> inTrees;

set<pair<int, int>> allDiams;   // len, treeInd

void makeTrees() {
    queue<array<int, 3>> q;     // centroid, level, parent;

    q.push({0, 0, -1});

    while (q.size()) {
        tree x;
        auto newComps = x.init(q.front()[0], q.front()[1], q.front()[2]);

        centroidLevel[newComps.first] = q.front()[1];

        // cerr << newComps.first << ": ";

        for (int i: newComps.second) {
            // cerr << i << " ";
            q.push({i, q.front()[1]+1, newComps.first});
        }
        // cerr << "\n";
        q.pop();

        for (int i: x.verticies) inTrees[i].push_back(trees.size());
        allDiams.insert({0, trees.size()});

        trees.push_back(x);
        // cerr << trees.back().level << "\n";
    }
}

void updateEdge(int u, int v, int x) {
    // cerr << u+1 << " " << v+1 << " " << x << "\n";
    for (int i: inTrees[u]) {
        allDiams.erase({trees[i].getDiam(), i});
        trees[i].updateEdge(u, v, x);
        allDiams.insert({trees[i].getDiam(), i});
    }
}


int queryBest() {
    return (*allDiams.rbegin()).first;
}


signed main() {
    cin.tie(0);
    ios_base::sync_with_stdio(0);


    cin >> N >> Q >> W;

    graph.resize(N);
    inTrees.resize(N);
    centroidLevel.assign(N, -1);

    parent.assign(20, vector<int>(N));
    Size.assign(20, vector<int>(N));
    whichSubtree.assign(20, vector<int>(N));
    prepost.assign(20, vector<pair<int, int>>(N));


    vector<array<int,3>> edges(N-1);

    for (int i = 0; i<N-1; i++) {
        int a, b, c; cin >> a >> b >> c; a--; b--;
        edges[i] = {a, b, c};
        graph[a].push_back(b);
        graph[b].push_back(a);
    }

    makeTrees();

    for (auto i: edges) {
        updateEdge(i[0], i[1], i[2]);
    }

    // cerr << "--------------\n";

    int last = 0;
    for (int i = 0; i<Q; i++) {
        int _d, _e; cin >> _d >> _e;

        int d = (_d+last)%(N-1);
        int e = (_e+last)%(W);


        int diff = e-edges[d][2];

        // cerr << e << ": ";
        updateEdge(edges[d][0], edges[d][1], diff);

        edges[d][2] = e;

        last = queryBest();
        cout << last << "\n";
    }


    return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 316 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 448 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 316 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 448 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 26 ms 2480 KB Output is correct
20 Correct 33 ms 2588 KB Output is correct
21 Correct 41 ms 2756 KB Output is correct
22 Correct 36 ms 2900 KB Output is correct
23 Correct 91 ms 11724 KB Output is correct
24 Correct 100 ms 13228 KB Output is correct
25 Correct 118 ms 13964 KB Output is correct
26 Correct 139 ms 15360 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 11 ms 596 KB Output is correct
5 Correct 52 ms 1416 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 2 ms 1096 KB Output is correct
8 Correct 2 ms 1108 KB Output is correct
9 Correct 3 ms 1100 KB Output is correct
10 Correct 17 ms 1364 KB Output is correct
11 Correct 85 ms 2388 KB Output is correct
12 Correct 13 ms 8672 KB Output is correct
13 Correct 14 ms 8672 KB Output is correct
14 Correct 19 ms 8672 KB Output is correct
15 Correct 37 ms 8800 KB Output is correct
16 Correct 122 ms 9620 KB Output is correct
17 Correct 337 ms 158192 KB Output is correct
18 Correct 332 ms 158192 KB Output is correct
19 Correct 342 ms 158264 KB Output is correct
20 Correct 391 ms 158572 KB Output is correct
21 Correct 634 ms 159856 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 2644 KB Output is correct
2 Correct 36 ms 2828 KB Output is correct
3 Correct 156 ms 3364 KB Output is correct
4 Correct 295 ms 4044 KB Output is correct
5 Correct 115 ms 29212 KB Output is correct
6 Correct 169 ms 29348 KB Output is correct
7 Correct 427 ms 29492 KB Output is correct
8 Correct 732 ms 29880 KB Output is correct
9 Correct 751 ms 154136 KB Output is correct
10 Correct 870 ms 154288 KB Output is correct
11 Correct 1357 ms 154944 KB Output is correct
12 Correct 1966 ms 155660 KB Output is correct
13 Correct 1732 ms 319412 KB Output is correct
14 Correct 1836 ms 319496 KB Output is correct
15 Correct 2464 ms 320116 KB Output is correct
16 Correct 3337 ms 320984 KB Output is correct
17 Execution timed out 5023 ms 320724 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5067 ms 275460 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 316 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 448 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 26 ms 2480 KB Output is correct
20 Correct 33 ms 2588 KB Output is correct
21 Correct 41 ms 2756 KB Output is correct
22 Correct 36 ms 2900 KB Output is correct
23 Correct 91 ms 11724 KB Output is correct
24 Correct 100 ms 13228 KB Output is correct
25 Correct 118 ms 13964 KB Output is correct
26 Correct 139 ms 15360 KB Output is correct
27 Correct 1 ms 320 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 11 ms 596 KB Output is correct
31 Correct 52 ms 1416 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 2 ms 1096 KB Output is correct
34 Correct 2 ms 1108 KB Output is correct
35 Correct 3 ms 1100 KB Output is correct
36 Correct 17 ms 1364 KB Output is correct
37 Correct 85 ms 2388 KB Output is correct
38 Correct 13 ms 8672 KB Output is correct
39 Correct 14 ms 8672 KB Output is correct
40 Correct 19 ms 8672 KB Output is correct
41 Correct 37 ms 8800 KB Output is correct
42 Correct 122 ms 9620 KB Output is correct
43 Correct 337 ms 158192 KB Output is correct
44 Correct 332 ms 158192 KB Output is correct
45 Correct 342 ms 158264 KB Output is correct
46 Correct 391 ms 158572 KB Output is correct
47 Correct 634 ms 159856 KB Output is correct
48 Correct 10 ms 2644 KB Output is correct
49 Correct 36 ms 2828 KB Output is correct
50 Correct 156 ms 3364 KB Output is correct
51 Correct 295 ms 4044 KB Output is correct
52 Correct 115 ms 29212 KB Output is correct
53 Correct 169 ms 29348 KB Output is correct
54 Correct 427 ms 29492 KB Output is correct
55 Correct 732 ms 29880 KB Output is correct
56 Correct 751 ms 154136 KB Output is correct
57 Correct 870 ms 154288 KB Output is correct
58 Correct 1357 ms 154944 KB Output is correct
59 Correct 1966 ms 155660 KB Output is correct
60 Correct 1732 ms 319412 KB Output is correct
61 Correct 1836 ms 319496 KB Output is correct
62 Correct 2464 ms 320116 KB Output is correct
63 Correct 3337 ms 320984 KB Output is correct
64 Execution timed out 5023 ms 320724 KB Time limit exceeded
65 Halted 0 ms 0 KB -