oj.uz

답안 #835261

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
835261 2023-08-23T11:18:40 Z Josia Dynamic Diameter (CEOI19_diameter) C++17
49 / 100
 5000 ms 253212 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;


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) {
        verticies.push_back(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;
            }
        }

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

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

    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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 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 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 596 KB Output is correct
18 Correct 1 ms 596 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 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 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 596 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 20 ms 1876 KB Output is correct
20 Correct 21 ms 2004 KB Output is correct
21 Correct 25 ms 2132 KB Output is correct
22 Correct 32 ms 2360 KB Output is correct
23 Correct 53 ms 8184 KB Output is correct
24 Correct 85 ms 9548 KB Output is correct
25 Correct 86 ms 10456 KB Output is correct
26 Correct 78 ms 11596 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 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 51 ms 804 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 2 ms 724 KB Output is correct
9 Correct 4 ms 724 KB Output is correct
10 Correct 16 ms 976 KB Output is correct
11 Correct 77 ms 1228 KB Output is correct
12 Correct 10 ms 4624 KB Output is correct
13 Correct 10 ms 4624 KB Output is correct
14 Correct 14 ms 4624 KB Output is correct
15 Correct 30 ms 4624 KB Output is correct
16 Correct 109 ms 4740 KB Output is correct
17 Correct 258 ms 77860 KB Output is correct
18 Correct 250 ms 77932 KB Output is correct
19 Correct 254 ms 77892 KB Output is correct
20 Correct 294 ms 77956 KB Output is correct
21 Correct 502 ms 78432 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 2132 KB Output is correct
2 Correct 30 ms 2132 KB Output is correct
3 Correct 133 ms 2360 KB Output is correct
4 Correct 251 ms 2660 KB Output is correct
5 Correct 84 ms 21248 KB Output is correct
6 Correct 125 ms 21284 KB Output is correct
7 Correct 304 ms 21204 KB Output is correct
8 Correct 534 ms 21204 KB Output is correct
9 Correct 530 ms 113644 KB Output is correct
10 Correct 593 ms 113632 KB Output is correct
11 Correct 963 ms 114024 KB Output is correct
12 Correct 1412 ms 114144 KB Output is correct
13 Correct 1176 ms 238188 KB Output is correct
14 Correct 1337 ms 238184 KB Output is correct
15 Correct 1719 ms 238440 KB Output is correct
16 Correct 2363 ms 238700 KB Output is correct
17 Correct 3771 ms 238792 KB Output is correct

Subtask #5
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4490 ms 210680 KB Output is correct
2 Correct 4630 ms 218132 KB Output is correct
3 Correct 4781 ms 214748 KB Output is correct
4 Correct 4999 ms 219424 KB Output is correct
5 Correct 4661 ms 210412 KB Output is correct
6 Correct 3407 ms 179028 KB Output is correct
7 Execution timed out 5023 ms 253212 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 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 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 596 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 20 ms 1876 KB Output is correct
20 Correct 21 ms 2004 KB Output is correct
21 Correct 25 ms 2132 KB Output is correct
22 Correct 32 ms 2360 KB Output is correct
23 Correct 53 ms 8184 KB Output is correct
24 Correct 85 ms 9548 KB Output is correct
25 Correct 86 ms 10456 KB Output is correct
26 Correct 78 ms 11596 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 51 ms 804 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 724 KB Output is correct
34 Correct 2 ms 724 KB Output is correct
35 Correct 4 ms 724 KB Output is correct
36 Correct 16 ms 976 KB Output is correct
37 Correct 77 ms 1228 KB Output is correct
38 Correct 10 ms 4624 KB Output is correct
39 Correct 10 ms 4624 KB Output is correct
40 Correct 14 ms 4624 KB Output is correct
41 Correct 30 ms 4624 KB Output is correct
42 Correct 109 ms 4740 KB Output is correct
43 Correct 258 ms 77860 KB Output is correct
44 Correct 250 ms 77932 KB Output is correct
45 Correct 254 ms 77892 KB Output is correct
46 Correct 294 ms 77956 KB Output is correct
47 Correct 502 ms 78432 KB Output is correct
48 Correct 7 ms 2132 KB Output is correct
49 Correct 30 ms 2132 KB Output is correct
50 Correct 133 ms 2360 KB Output is correct
51 Correct 251 ms 2660 KB Output is correct
52 Correct 84 ms 21248 KB Output is correct
53 Correct 125 ms 21284 KB Output is correct
54 Correct 304 ms 21204 KB Output is correct
55 Correct 534 ms 21204 KB Output is correct
56 Correct 530 ms 113644 KB Output is correct
57 Correct 593 ms 113632 KB Output is correct
58 Correct 963 ms 114024 KB Output is correct
59 Correct 1412 ms 114144 KB Output is correct
60 Correct 1176 ms 238188 KB Output is correct
61 Correct 1337 ms 238184 KB Output is correct
62 Correct 1719 ms 238440 KB Output is correct
63 Correct 2363 ms 238700 KB Output is correct
64 Correct 3771 ms 238792 KB Output is correct
65 Correct 4490 ms 210680 KB Output is correct
66 Correct 4630 ms 218132 KB Output is correct
67 Correct 4781 ms 214748 KB Output is correct
68 Correct 4999 ms 219424 KB Output is correct
69 Correct 4661 ms 210412 KB Output is correct
70 Correct 3407 ms 179028 KB Output is correct
71 Execution timed out 5023 ms 253212 KB Time limit exceeded
72 Halted 0 ms 0 KB -