oj.uz

Submission #954112

# Submission time Handle Problem Language Result Execution time Memory
954112 2024-03-27T09:51:11 Z LucaIlie Dynamic Diameter (CEOI19_diameter) C++17
31 / 100
 5000 ms 283548 KB 
#include <bits/stdc++.h>

#define pragma "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;
}

vector<int> centroids[MAX_N], heads[MAX_N + 1];
unordered_map<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][e] = h;
        leftPos[c][e] = crtPos;
        dfs( v, u, c, h );
        rightPos[c][e] = crtPos - 1;
        children++;
    }

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

void decomp( int r ) {
    calcSizes( r, 0 );
    totSz = sz[r];
    int c = findCentroid( r, 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][e] = e;
        leftPos[c][e] = crtPos;
        dfs( v, c, c, e );
        rightPos[c][e] = crtPos - 1;
    }

    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;

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

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

    crtPos = 0;
    decomp( 1 );

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

        for ( int h: heads[c] ) {
            int maxDepth = depths.query( leftPos[c][h], 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 = head[c][e];
            maxDepth = depths.query( leftPos[c][h], rightPos[c][h] );
            diameterByCentroid[c].erase( diameterByCentroid[c].lower_bound( maxDepth ) );
            depths.update( leftPos[c][e], rightPos[c][e], w - edges[e].w );
            maxDepth = depths.query( leftPos[c][h], 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 29272 KB Output is correct
2 Correct 8 ms 29276 KB Output is correct
3 Correct 7 ms 29276 KB Output is correct
4 Correct 8 ms 29276 KB Output is correct
5 Correct 7 ms 29276 KB Output is correct
6 Correct 8 ms 29276 KB Output is correct
7 Correct 7 ms 29276 KB Output is correct
8 Correct 8 ms 29276 KB Output is correct
9 Correct 8 ms 29528 KB Output is correct
10 Correct 7 ms 29272 KB Output is correct
11 Correct 7 ms 29276 KB Output is correct
12 Correct 8 ms 29276 KB Output is correct
13 Correct 7 ms 29332 KB Output is correct
14 Correct 8 ms 29276 KB Output is correct
15 Correct 7 ms 29404 KB Output is correct
16 Correct 7 ms 29272 KB Output is correct
17 Correct 8 ms 29272 KB Output is correct
18 Correct 8 ms 29276 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 29272 KB Output is correct
2 Correct 8 ms 29276 KB Output is correct
3 Correct 7 ms 29276 KB Output is correct
4 Correct 8 ms 29276 KB Output is correct
5 Correct 7 ms 29276 KB Output is correct
6 Correct 8 ms 29276 KB Output is correct
7 Correct 7 ms 29276 KB Output is correct
8 Correct 8 ms 29276 KB Output is correct
9 Correct 8 ms 29528 KB Output is correct
10 Correct 7 ms 29272 KB Output is correct
11 Correct 7 ms 29276 KB Output is correct
12 Correct 8 ms 29276 KB Output is correct
13 Correct 7 ms 29332 KB Output is correct
14 Correct 8 ms 29276 KB Output is correct
15 Correct 7 ms 29404 KB Output is correct
16 Correct 7 ms 29272 KB Output is correct
17 Correct 8 ms 29272 KB Output is correct
18 Correct 8 ms 29276 KB Output is correct
19 Correct 36 ms 30296 KB Output is correct
20 Correct 38 ms 30472 KB Output is correct
21 Correct 43 ms 30612 KB Output is correct
22 Correct 44 ms 30552 KB Output is correct
23 Correct 67 ms 35152 KB Output is correct
24 Correct 87 ms 36956 KB Output is correct
25 Correct 114 ms 38084 KB Output is correct
26 Correct 105 ms 38484 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 29276 KB Output is correct
2 Correct 7 ms 29276 KB Output is correct
3 Correct 11 ms 29276 KB Output is correct
4 Correct 47 ms 29276 KB Output is correct
5 Correct 209 ms 30016 KB Output is correct
6 Correct 7 ms 29276 KB Output is correct
7 Correct 7 ms 29276 KB Output is correct
8 Correct 8 ms 29276 KB Output is correct
9 Correct 12 ms 29276 KB Output is correct
10 Correct 52 ms 29532 KB Output is correct
11 Correct 226 ms 29836 KB Output is correct
12 Correct 14 ms 31068 KB Output is correct
13 Correct 14 ms 30940 KB Output is correct
14 Correct 19 ms 31064 KB Output is correct
15 Correct 66 ms 31096 KB Output is correct
16 Correct 263 ms 31388 KB Output is correct
17 Correct 172 ms 66952 KB Output is correct
18 Correct 165 ms 66608 KB Output is correct
19 Correct 175 ms 66696 KB Output is correct
20 Correct 246 ms 67440 KB Output is correct
21 Correct 563 ms 67264 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 30552 KB Output is correct
2 Correct 59 ms 30800 KB Output is correct
3 Correct 258 ms 30880 KB Output is correct
4 Correct 499 ms 31496 KB Output is correct
5 Correct 100 ms 48980 KB Output is correct
6 Correct 180 ms 49176 KB Output is correct
7 Correct 529 ms 49264 KB Output is correct
8 Correct 970 ms 50096 KB Output is correct
9 Correct 603 ms 148452 KB Output is correct
10 Correct 761 ms 148352 KB Output is correct
11 Correct 1368 ms 148756 KB Output is correct
12 Correct 2135 ms 149236 KB Output is correct
13 Correct 1297 ms 283052 KB Output is correct
14 Correct 1448 ms 283152 KB Output is correct
15 Correct 2222 ms 283388 KB Output is correct
16 Correct 3190 ms 283548 KB Output is correct
17 Execution timed out 5032 ms 283428 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 4142 ms 218580 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 29272 KB Output is correct
2 Correct 8 ms 29276 KB Output is correct
3 Correct 7 ms 29276 KB Output is correct
4 Correct 8 ms 29276 KB Output is correct
5 Correct 7 ms 29276 KB Output is correct
6 Correct 8 ms 29276 KB Output is correct
7 Correct 7 ms 29276 KB Output is correct
8 Correct 8 ms 29276 KB Output is correct
9 Correct 8 ms 29528 KB Output is correct
10 Correct 7 ms 29272 KB Output is correct
11 Correct 7 ms 29276 KB Output is correct
12 Correct 8 ms 29276 KB Output is correct
13 Correct 7 ms 29332 KB Output is correct
14 Correct 8 ms 29276 KB Output is correct
15 Correct 7 ms 29404 KB Output is correct
16 Correct 7 ms 29272 KB Output is correct
17 Correct 8 ms 29272 KB Output is correct
18 Correct 8 ms 29276 KB Output is correct
19 Correct 36 ms 30296 KB Output is correct
20 Correct 38 ms 30472 KB Output is correct
21 Correct 43 ms 30612 KB Output is correct
22 Correct 44 ms 30552 KB Output is correct
23 Correct 67 ms 35152 KB Output is correct
24 Correct 87 ms 36956 KB Output is correct
25 Correct 114 ms 38084 KB Output is correct
26 Correct 105 ms 38484 KB Output is correct
27 Correct 7 ms 29276 KB Output is correct
28 Correct 7 ms 29276 KB Output is correct
29 Correct 11 ms 29276 KB Output is correct
30 Correct 47 ms 29276 KB Output is correct
31 Correct 209 ms 30016 KB Output is correct
32 Correct 7 ms 29276 KB Output is correct
33 Correct 7 ms 29276 KB Output is correct
34 Correct 8 ms 29276 KB Output is correct
35 Correct 12 ms 29276 KB Output is correct
36 Correct 52 ms 29532 KB Output is correct
37 Correct 226 ms 29836 KB Output is correct
38 Correct 14 ms 31068 KB Output is correct
39 Correct 14 ms 30940 KB Output is correct
40 Correct 19 ms 31064 KB Output is correct
41 Correct 66 ms 31096 KB Output is correct
42 Correct 263 ms 31388 KB Output is correct
43 Correct 172 ms 66952 KB Output is correct
44 Correct 165 ms 66608 KB Output is correct
45 Correct 175 ms 66696 KB Output is correct
46 Correct 246 ms 67440 KB Output is correct
47 Correct 563 ms 67264 KB Output is correct
48 Correct 16 ms 30552 KB Output is correct
49 Correct 59 ms 30800 KB Output is correct
50 Correct 258 ms 30880 KB Output is correct
51 Correct 499 ms 31496 KB Output is correct
52 Correct 100 ms 48980 KB Output is correct
53 Correct 180 ms 49176 KB Output is correct
54 Correct 529 ms 49264 KB Output is correct
55 Correct 970 ms 50096 KB Output is correct
56 Correct 603 ms 148452 KB Output is correct
57 Correct 761 ms 148352 KB Output is correct
58 Correct 1368 ms 148756 KB Output is correct
59 Correct 2135 ms 149236 KB Output is correct
60 Correct 1297 ms 283052 KB Output is correct
61 Correct 1448 ms 283152 KB Output is correct
62 Correct 2222 ms 283388 KB Output is correct
63 Correct 3190 ms 283548 KB Output is correct
64 Execution timed out 5032 ms 283428 KB Time limit exceeded
65 Halted 0 ms 0 KB -