oj.uz

Submission #835294

# Submission time Handle Problem Language Result Execution time Memory
835294 2023-08-23T11:59:38 Z Josia Dynamic Diameter (CEOI19_diameter) C++17
49 / 100
 5000 ms 264244 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;
map<pair<int, int>, int> weight;

array<array<int, 100005>, 20> parent;
array<array<int, 100005>, 20> Size;
array<array<int, 100005>, 20> whichSubtree;
array<array<pair<int, int>, 100005>, 20> prepost;


vector<int> centroidLevel;

struct tree {
    int level;
    int currCol = 0;

    seg segtree;

    vector<int> order;
    vector<int> verticies;
    vector<int> children;
    int dfs(int v, int p, int forbidden, int d) {
        verticies.push_back(v);
        prepost[level][v].first = order.size();
        order.push_back(d);
        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, d+weight[{i,v}]);
            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;
            }
        }

        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, 0);

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

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

        // for (int i: order) cerr << i << " ";
        // cerr << "\n";

        segtree.init(order.size(), order);

        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];

        for (int i: newComps.second) {
            q.push({i, q.front()[1]+1, newComps.first});
        }
        q.pop();

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

        trees.push_back(x);
    }
}

void updateEdge(int u, int v, int x) {

    int p1 = 0;
    int p2 = 0;

    while (p1<(int)inTrees[u].size() && p2<(int)inTrees[v].size()) {
        if (inTrees[u][p1] == inTrees[v][p2]) {
            allDiams.erase({trees[inTrees[u][p1]].getDiam(), inTrees[u][p1]});
            trees[inTrees[u][p1]].updateEdge(u, v, x);
            allDiams.insert({trees[inTrees[u][p1]].getDiam(), inTrees[u][p1]});
            p1++;
            p2++;
            continue;
        }
        if (inTrees[u][p1] < inTrees[v][p2]) {
            p1++;
            continue;
        }
        p2++;
    }

}


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);

    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);

        weight[{a,b}] = c;
        weight[{b,a}] = c;
    }

    makeTrees();

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

    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];

        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 340 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 1 ms 596 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 340 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 19 ms 2004 KB Output is correct
20 Correct 20 ms 2132 KB Output is correct
21 Correct 24 ms 2260 KB Output is correct
22 Correct 25 ms 2516 KB Output is correct
23 Correct 48 ms 8796 KB Output is correct
24 Correct 61 ms 10188 KB Output is correct
25 Correct 69 ms 10948 KB Output is correct
26 Correct 68 ms 12352 KB Output is correct

Subtask #3
7.0 / 7.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 2 ms 340 KB Output is correct
4 Correct 11 ms 468 KB Output is correct
5 Correct 53 ms 968 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 852 KB Output is correct
8 Correct 1 ms 852 KB Output is correct
9 Correct 4 ms 852 KB Output is correct
10 Correct 17 ms 980 KB Output is correct
11 Correct 81 ms 1284 KB Output is correct
12 Correct 11 ms 5196 KB Output is correct
13 Correct 10 ms 5236 KB Output is correct
14 Correct 12 ms 5196 KB Output is correct
15 Correct 30 ms 5196 KB Output is correct
16 Correct 113 ms 5304 KB Output is correct
17 Correct 256 ms 90388 KB Output is correct
18 Correct 252 ms 90428 KB Output is correct
19 Correct 260 ms 90472 KB Output is correct
20 Correct 298 ms 90484 KB Output is correct
21 Correct 494 ms 90944 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 2260 KB Output is correct
2 Correct 30 ms 2336 KB Output is correct
3 Correct 130 ms 2512 KB Output is correct
4 Correct 251 ms 2764 KB Output is correct
5 Correct 52 ms 22420 KB Output is correct
6 Correct 94 ms 22444 KB Output is correct
7 Correct 279 ms 22524 KB Output is correct
8 Correct 516 ms 22524 KB Output is correct
9 Correct 363 ms 119840 KB Output is correct
10 Correct 431 ms 119908 KB Output is correct
11 Correct 795 ms 120132 KB Output is correct
12 Correct 1176 ms 120536 KB Output is correct
13 Correct 796 ms 250740 KB Output is correct
14 Correct 861 ms 250784 KB Output is correct
15 Correct 1298 ms 251024 KB Output is correct
16 Correct 1877 ms 251388 KB Output is correct
17 Correct 3429 ms 251308 KB Output is correct

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 3610 ms 221988 KB Output is correct
2 Correct 3755 ms 226672 KB Output is correct
3 Correct 3570 ms 223192 KB Output is correct
4 Correct 3682 ms 227860 KB Output is correct
5 Correct 3507 ms 218780 KB Output is correct
6 Correct 2862 ms 187324 KB Output is correct
7 Correct 4774 ms 264108 KB Output is correct
8 Correct 4928 ms 264120 KB Output is correct
9 Execution timed out 5032 ms 264244 KB Time limit exceeded
10 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 340 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 19 ms 2004 KB Output is correct
20 Correct 20 ms 2132 KB Output is correct
21 Correct 24 ms 2260 KB Output is correct
22 Correct 25 ms 2516 KB Output is correct
23 Correct 48 ms 8796 KB Output is correct
24 Correct 61 ms 10188 KB Output is correct
25 Correct 69 ms 10948 KB Output is correct
26 Correct 68 ms 12352 KB Output is correct
27 Correct 1 ms 340 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 468 KB Output is correct
31 Correct 53 ms 968 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 852 KB Output is correct
34 Correct 1 ms 852 KB Output is correct
35 Correct 4 ms 852 KB Output is correct
36 Correct 17 ms 980 KB Output is correct
37 Correct 81 ms 1284 KB Output is correct
38 Correct 11 ms 5196 KB Output is correct
39 Correct 10 ms 5236 KB Output is correct
40 Correct 12 ms 5196 KB Output is correct
41 Correct 30 ms 5196 KB Output is correct
42 Correct 113 ms 5304 KB Output is correct
43 Correct 256 ms 90388 KB Output is correct
44 Correct 252 ms 90428 KB Output is correct
45 Correct 260 ms 90472 KB Output is correct
46 Correct 298 ms 90484 KB Output is correct
47 Correct 494 ms 90944 KB Output is correct
48 Correct 7 ms 2260 KB Output is correct
49 Correct 30 ms 2336 KB Output is correct
50 Correct 130 ms 2512 KB Output is correct
51 Correct 251 ms 2764 KB Output is correct
52 Correct 52 ms 22420 KB Output is correct
53 Correct 94 ms 22444 KB Output is correct
54 Correct 279 ms 22524 KB Output is correct
55 Correct 516 ms 22524 KB Output is correct
56 Correct 363 ms 119840 KB Output is correct
57 Correct 431 ms 119908 KB Output is correct
58 Correct 795 ms 120132 KB Output is correct
59 Correct 1176 ms 120536 KB Output is correct
60 Correct 796 ms 250740 KB Output is correct
61 Correct 861 ms 250784 KB Output is correct
62 Correct 1298 ms 251024 KB Output is correct
63 Correct 1877 ms 251388 KB Output is correct
64 Correct 3429 ms 251308 KB Output is correct
65 Correct 3610 ms 221988 KB Output is correct
66 Correct 3755 ms 226672 KB Output is correct
67 Correct 3570 ms 223192 KB Output is correct
68 Correct 3682 ms 227860 KB Output is correct
69 Correct 3507 ms 218780 KB Output is correct
70 Correct 2862 ms 187324 KB Output is correct
71 Correct 4774 ms 264108 KB Output is correct
72 Correct 4928 ms 264120 KB Output is correct
73 Execution timed out 5032 ms 264244 KB Time limit exceeded
74 Halted 0 ms 0 KB -