oj.uz

Submission #954119

# Submission time Handle Problem Language Result Execution time Memory
954119 2024-03-27T10:17:00 Z LucaIlie Dynamic Diameter (CEOI19_diameter) C++17
24 / 100
 1506 ms 269436 KB 
#include <bits/stdc++.h>

#pragma GCC optimize("Ofast")

using namespace std;

struct edge {
    int u, v;
    long long w;

    int other( int x ) {
        return u ^ v ^ x;
    }
};

const int MAX_N = 1e5;
edge edges[MAX_N];
vector<int> adj[MAX_N + 1];

bool isCentroid[MAX_N + 1];
int sz[MAX_N + 1];

void calcSizes( int u, int p ) {
    sz[u] = 1;
    for ( int e: adj[u] ) {
        int v = edges[e].other( u );
        if ( v == p || isCentroid[v] )
            continue;
        calcSizes( v, u );
        sz[u] += sz[v];
    }


}

int totSz;
int findCentroid( int u, int p ) {
    int c = 0, maxSz = totSz - sz[u];
    for ( int e: adj[u] ) {
        int v = edges[e].other( u );
        if ( v == p || isCentroid[v] )
            continue;
        int d = findCentroid( v, u );
        if ( d != 0 )
            c = d;
        maxSz = max( maxSz, sz[v] );
    }
    if ( maxSz <= totSz / 2 )
        c = u;
    return c;
}

int leafs[MAX_N + 1];
vector<int> centroids[MAX_N], heads[MAX_N + 1];
vector<pair<int, int>> head[MAX_N + 1], leftPos[MAX_N + 1], rightPos[MAX_N + 1];
int crtPos;

void dfs( int u, int p, int c, int h ) {

    int children = 0;
    for ( int e: adj[u] ) {
        int v = edges[e].other( u );
        if ( v == p || isCentroid[v] )
            continue;

        centroids[e].push_back( c );
        head[c].push_back( { e, h } );
        leftPos[c].push_back( { e, crtPos } );
        dfs( v, u, c, h );
        rightPos[c].push_back( { e, crtPos - 1 } );
        children++;
    }

    if ( children == 0 )
        crtPos++;
}

void decomp( int r ) {
    calcSizes( r, 0 );
    totSz = sz[r];
    int c = findCentroid( r, 0 );

    crtPos = 0;
    for ( int e: adj[c] ) {
        int v = edges[e].other( c );
        if ( isCentroid[v] )
            continue;

        centroids[e].push_back( c );
        heads[c].push_back( e );
        head[c].push_back( { e, e } );
        leftPos[c].push_back( { e, crtPos } );
        dfs( v, c, c, e );
        rightPos[c].push_back( { e, crtPos - 1 } );
    }
    sort( head[c].begin(), head[c].end() );
    sort( leftPos[c].begin(), leftPos[c].end() );
    sort( rightPos[c].begin(), rightPos[c].end() );

    leafs[c] = crtPos;

    isCentroid[c] = true;
    for ( int e: adj[c] ) {
        int v = edges[e].other( c );
        if ( isCentroid[v] )
            continue;
        decomp( v );
    }
}

multiset<int> diameterByCentroid[MAX_N + 1], allDiameters;

int findElem( vector<pair<int, int>> &v, int x ) {
    int st = 0, dr = v.size();
    while ( dr - st > 1 ) {
        int mij = (st + dr) / 2;

        if ( v[mij].first > x )
            dr = mij;
        else
            st = mij;
    }
    return v[st].second;
}

struct SegTree {
    int ll, rr;
    vector<long long> segTree, lazy;

    void propag( int v, int l, int r ) {
        segTree[v] += lazy[v];
        if ( l != r ) {
            lazy[v * 2 + 1] += lazy[v];
            lazy[v * 2 + 2] += lazy[v];
        }
        lazy[v] = 0;
    }

    void init( int l, int r ) {
        ll = l;
        rr = r;
        segTree.resize( 4 * (r - l + 1) );
        lazy.resize( 4 * (r - l + 1) );
    }

    void update( int v, int l, int r, int lu, int ru, long long x ) {
        propag( v, l, r );

        if ( l > ru || r < lu )
            return;

        if ( lu <= l && r <= ru ) {
            lazy[v] = x;
            propag( v, l, r );
            return;
        }

        int mid = (l + r) / 2;
        update( v * 2 + 1, l, mid, lu, ru, x );
        update( v * 2 + 2, mid + 1, r, lu, ru, x );
        segTree[v] = max( segTree[v * 2 + 1], segTree[v * 2 + 2] );
    }

    void update( int l, int r, long long x ) {
        update( 0, ll, rr, l, r, x );
    }

    long long query( int v, int l, int r, int lq, int rq ) {
        if ( l > rq || r < lq )
            return 0;

        if ( lq <= l && r <= rq )
            return segTree[v];

        int mid = (l + r) / 2;
        return max( query( v * 2 + 1, l, mid, lq, rq ), query( v * 2 + 2, mid + 1, r, lq, rq ) );
    }

    long long query( int l, int r ) {
        return query( 0, ll, rr, l, r );
    }
};

SegTree depths[MAX_N];



int main() {
    int n, q;
    long long m;

    cin >> n >> q >> m;
    for ( int e = 0; e < n - 1; e++ ) {
        cin >> edges[e].u >> edges[e].v >> edges[e].w;
        adj[edges[e].u].push_back( e );
        adj[edges[e].v].push_back( e );
    }

    decomp( 1 );

    for ( int c = 1; c <= n; c++ ) {
        depths[c].init( 0, leafs[c] - 1 );
        for ( auto p: head[c] ) {
            int e = p.first;
            depths[c].update( findElem( leftPos[c], e ), findElem( rightPos[c], e ), edges[e].w );
        }

        for ( int h: heads[c] ) {
            int maxDepth = depths[c].query( findElem( leftPos[c], h ), findElem( rightPos[c], h ) );
            diameterByCentroid[c].insert( maxDepth );
        }

        int d1 = (diameterByCentroid[c].size() <= 0 ? 0 : *diameterByCentroid[c].rbegin());
        int d2 = (diameterByCentroid[c].size() <= 1 ? 0 : *next( diameterByCentroid[c].rbegin() ) );
        allDiameters.insert( d1 + d2 );
    }

    int last = 0;
    while ( q-- ) {
        int e;
        long long w;

        cin >> e >> w;
        e = (e + last) % (n - 1);
        w = (w + last) % m;

        for ( int c: centroids[e] ) {
            int d1, d2, maxDepth;

            d1 = (diameterByCentroid[c].size() <= 0 ? 0 : *diameterByCentroid[c].rbegin());
            d2 = (diameterByCentroid[c].size() <= 1 ? 0 : *next( diameterByCentroid[c].rbegin() ) );
            allDiameters.erase( allDiameters.lower_bound( d1 + d2 ) );

            int h = findElem( head[c], e );
            maxDepth = depths[c].query( findElem( leftPos[c], h ), findElem( rightPos[c], h ) );
            diameterByCentroid[c].erase( diameterByCentroid[c].lower_bound( maxDepth ) );

            depths[c].update( findElem( leftPos[c], e ), findElem( rightPos[c], e ), w - edges[e].w );

            maxDepth = depths[c].query( findElem( leftPos[c], h ), findElem( rightPos[c], h ) );
            diameterByCentroid[c].insert( maxDepth );

            d1 = (diameterByCentroid[c].size() <= 0 ? 0 : *diameterByCentroid[c].rbegin());
            d2 = (diameterByCentroid[c].size() <= 1 ? 0 : *next( diameterByCentroid[c].rbegin() ) );
            allDiameters.insert( d1 + d2 );
        }

        edges[e].w = w;

        last = *allDiameters.rbegin();
        cout << last << "\n";
    }

    return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 25436 KB Output is correct
2 Correct 7 ms 25436 KB Output is correct
3 Correct 6 ms 25436 KB Output is correct
4 Correct 7 ms 25436 KB Output is correct
5 Correct 6 ms 25400 KB Output is correct
6 Correct 6 ms 25436 KB Output is correct
7 Correct 6 ms 25436 KB Output is correct
8 Correct 7 ms 25436 KB Output is correct
9 Correct 6 ms 25436 KB Output is correct
10 Correct 6 ms 25436 KB Output is correct
11 Correct 6 ms 25436 KB Output is correct
12 Correct 6 ms 25436 KB Output is correct
13 Correct 8 ms 25436 KB Output is correct
14 Correct 6 ms 25432 KB Output is correct
15 Correct 6 ms 25436 KB Output is correct
16 Correct 6 ms 25436 KB Output is correct
17 Correct 6 ms 25436 KB Output is correct
18 Correct 6 ms 25436 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 25436 KB Output is correct
2 Correct 7 ms 25436 KB Output is correct
3 Correct 6 ms 25436 KB Output is correct
4 Correct 7 ms 25436 KB Output is correct
5 Correct 6 ms 25400 KB Output is correct
6 Correct 6 ms 25436 KB Output is correct
7 Correct 6 ms 25436 KB Output is correct
8 Correct 7 ms 25436 KB Output is correct
9 Correct 6 ms 25436 KB Output is correct
10 Correct 6 ms 25436 KB Output is correct
11 Correct 6 ms 25436 KB Output is correct
12 Correct 6 ms 25436 KB Output is correct
13 Correct 8 ms 25436 KB Output is correct
14 Correct 6 ms 25432 KB Output is correct
15 Correct 6 ms 25436 KB Output is correct
16 Correct 6 ms 25436 KB Output is correct
17 Correct 6 ms 25436 KB Output is correct
18 Correct 6 ms 25436 KB Output is correct
19 Correct 33 ms 26148 KB Output is correct
20 Correct 36 ms 25948 KB Output is correct
21 Correct 39 ms 26204 KB Output is correct
22 Correct 35 ms 26168 KB Output is correct
23 Correct 59 ms 28508 KB Output is correct
24 Correct 75 ms 29012 KB Output is correct
25 Correct 82 ms 29520 KB Output is correct
26 Correct 70 ms 29524 KB Output is correct

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 25436 KB Output is correct
2 Correct 6 ms 25404 KB Output is correct
3 Correct 10 ms 25596 KB Output is correct
4 Correct 45 ms 25436 KB Output is correct
5 Correct 210 ms 26180 KB Output is correct
6 Correct 6 ms 25688 KB Output is correct
7 Correct 7 ms 25688 KB Output is correct
8 Correct 7 ms 25692 KB Output is correct
9 Correct 11 ms 25692 KB Output is correct
10 Correct 54 ms 25688 KB Output is correct
11 Correct 251 ms 26204 KB Output is correct
12 Correct 13 ms 26972 KB Output is correct
13 Correct 13 ms 26972 KB Output is correct
14 Correct 19 ms 26972 KB Output is correct
15 Correct 71 ms 27056 KB Output is correct
16 Correct 300 ms 27476 KB Output is correct
17 Runtime error 205 ms 105412 KB Execution killed with signal 6
18 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 26200 KB Output is correct
2 Correct 51 ms 26204 KB Output is correct
3 Correct 227 ms 26532 KB Output is correct
4 Correct 426 ms 26708 KB Output is correct
5 Correct 52 ms 34396 KB Output is correct
6 Correct 143 ms 34384 KB Output is correct
7 Correct 427 ms 34640 KB Output is correct
8 Correct 733 ms 35216 KB Output is correct
9 Correct 288 ms 76700 KB Output is correct
10 Correct 386 ms 76476 KB Output is correct
11 Correct 885 ms 77100 KB Output is correct
12 Correct 1506 ms 76972 KB Output is correct
13 Runtime error 685 ms 269436 KB Execution killed with signal 6
14 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Runtime error 778 ms 223152 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 25436 KB Output is correct
2 Correct 7 ms 25436 KB Output is correct
3 Correct 6 ms 25436 KB Output is correct
4 Correct 7 ms 25436 KB Output is correct
5 Correct 6 ms 25400 KB Output is correct
6 Correct 6 ms 25436 KB Output is correct
7 Correct 6 ms 25436 KB Output is correct
8 Correct 7 ms 25436 KB Output is correct
9 Correct 6 ms 25436 KB Output is correct
10 Correct 6 ms 25436 KB Output is correct
11 Correct 6 ms 25436 KB Output is correct
12 Correct 6 ms 25436 KB Output is correct
13 Correct 8 ms 25436 KB Output is correct
14 Correct 6 ms 25432 KB Output is correct
15 Correct 6 ms 25436 KB Output is correct
16 Correct 6 ms 25436 KB Output is correct
17 Correct 6 ms 25436 KB Output is correct
18 Correct 6 ms 25436 KB Output is correct
19 Correct 33 ms 26148 KB Output is correct
20 Correct 36 ms 25948 KB Output is correct
21 Correct 39 ms 26204 KB Output is correct
22 Correct 35 ms 26168 KB Output is correct
23 Correct 59 ms 28508 KB Output is correct
24 Correct 75 ms 29012 KB Output is correct
25 Correct 82 ms 29520 KB Output is correct
26 Correct 70 ms 29524 KB Output is correct
27 Correct 7 ms 25436 KB Output is correct
28 Correct 6 ms 25404 KB Output is correct
29 Correct 10 ms 25596 KB Output is correct
30 Correct 45 ms 25436 KB Output is correct
31 Correct 210 ms 26180 KB Output is correct
32 Correct 6 ms 25688 KB Output is correct
33 Correct 7 ms 25688 KB Output is correct
34 Correct 7 ms 25692 KB Output is correct
35 Correct 11 ms 25692 KB Output is correct
36 Correct 54 ms 25688 KB Output is correct
37 Correct 251 ms 26204 KB Output is correct
38 Correct 13 ms 26972 KB Output is correct
39 Correct 13 ms 26972 KB Output is correct
40 Correct 19 ms 26972 KB Output is correct
41 Correct 71 ms 27056 KB Output is correct
42 Correct 300 ms 27476 KB Output is correct
43 Runtime error 205 ms 105412 KB Execution killed with signal 6
44 Halted 0 ms 0 KB -