oj.uz

답안 #954184

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
954184 2024-03-27T11:14:30 Z LucaIlie Dynamic Diameter (CEOI19_diameter) C++17
100 / 100
 2423 ms 116888 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];

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 ) {
        propag( v, l, r );

        if ( l > rq || r < lq )
            return 0;

        if ( segTree[v] == 0 )
            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 queryAll() {
        return segTree[0];
    }
};

SegTree depths[2 * 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;
}

struct info {
    int c, h, l, r;
};

vector<info> centroids[MAX_N];
vector<int> heads[MAX_N + 1];
int crtPos, headId;

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;

        info x;
        x.c = c;
        x.h = headId;
        x.l = crtPos;
        dfs( v, u, c, h );
        x.r = crtPos - 1;
        children++;

        centroids[e].push_back( x );
    }

    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;

        heads[c].push_back( headId );

        crtPos = 0;
        dfs( v, c, c, e );
        centroids[e].push_back( { c, headId, 0, crtPos - 1 } );
        depths[headId].init( 0, crtPos - 1 );
        headId++;
    }

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

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

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 e = 0; e < n - 1; e++ ) {
        long long w = edges[e].w;

        for ( auto x: centroids[e] ) {
            int c = x.c, h = x.h, l = x.l, r = x.r;
            depths[h].update( l, r, w );
        }
    }
    for ( int c = 1; c <= n; c++ ) {
        for ( int h: heads[c] )
            diameterByCentroid[c].insert( depths[h].queryAll() );
        long long d1 = (diameterByCentroid[c].size() <= 0 ? 0 : *diameterByCentroid[c].rbegin());
        long long d2 = (diameterByCentroid[c].size() <= 1 ? 0 : *next( diameterByCentroid[c].rbegin() ) );
        allDiameters.insert( d1 + d2 );
    }

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

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

        for ( auto x: centroids[e] ) {
            long long d1, d2, maxDepth;
            int c = x.c, h = x.h, l = x.l, r = x.r;

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

            maxDepth = depths[h].queryAll();
            diameterByCentroid[c].erase( diameterByCentroid[c].lower_bound( maxDepth ) );

            depths[h].update( l, r, w - edges[e].w );

            maxDepth = depths[h].queryAll();
            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;
}

Compilation message

diameter.cpp: In function 'int main()':
diameter.cpp:193:17: warning: unused variable 'c' [-Wunused-variable]
  193 |             int c = x.c, h = x.h, l = x.l, r = x.r;
      |                 ^

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 23392 KB Output is correct
2 Correct 8 ms 23388 KB Output is correct
3 Correct 6 ms 23436 KB Output is correct
4 Correct 6 ms 23388 KB Output is correct
5 Correct 5 ms 23448 KB Output is correct
6 Correct 5 ms 23388 KB Output is correct
7 Correct 5 ms 23644 KB Output is correct
8 Correct 7 ms 23644 KB Output is correct
9 Correct 6 ms 23644 KB Output is correct
10 Correct 5 ms 23644 KB Output is correct
11 Correct 5 ms 23436 KB Output is correct
12 Correct 5 ms 23644 KB Output is correct
13 Correct 6 ms 23644 KB Output is correct
14 Correct 7 ms 23644 KB Output is correct
15 Correct 6 ms 23644 KB Output is correct
16 Correct 6 ms 23644 KB Output is correct
17 Correct 7 ms 23644 KB Output is correct
18 Correct 6 ms 23644 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 23392 KB Output is correct
2 Correct 8 ms 23388 KB Output is correct
3 Correct 6 ms 23436 KB Output is correct
4 Correct 6 ms 23388 KB Output is correct
5 Correct 5 ms 23448 KB Output is correct
6 Correct 5 ms 23388 KB Output is correct
7 Correct 5 ms 23644 KB Output is correct
8 Correct 7 ms 23644 KB Output is correct
9 Correct 6 ms 23644 KB Output is correct
10 Correct 5 ms 23644 KB Output is correct
11 Correct 5 ms 23436 KB Output is correct
12 Correct 5 ms 23644 KB Output is correct
13 Correct 6 ms 23644 KB Output is correct
14 Correct 7 ms 23644 KB Output is correct
15 Correct 6 ms 23644 KB Output is correct
16 Correct 6 ms 23644 KB Output is correct
17 Correct 7 ms 23644 KB Output is correct
18 Correct 6 ms 23644 KB Output is correct
19 Correct 23 ms 24136 KB Output is correct
20 Correct 29 ms 23900 KB Output is correct
21 Correct 28 ms 24120 KB Output is correct
22 Correct 24 ms 24152 KB Output is correct
23 Correct 49 ms 26204 KB Output is correct
24 Correct 46 ms 26392 KB Output is correct
25 Correct 50 ms 27200 KB Output is correct
26 Correct 53 ms 26600 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 23388 KB Output is correct
2 Correct 6 ms 23388 KB Output is correct
3 Correct 13 ms 23644 KB Output is correct
4 Correct 39 ms 23688 KB Output is correct
5 Correct 179 ms 23888 KB Output is correct
6 Correct 5 ms 23384 KB Output is correct
7 Correct 7 ms 23644 KB Output is correct
8 Correct 6 ms 23644 KB Output is correct
9 Correct 10 ms 23644 KB Output is correct
10 Correct 52 ms 23812 KB Output is correct
11 Correct 192 ms 24144 KB Output is correct
12 Correct 10 ms 24924 KB Output is correct
13 Correct 11 ms 24924 KB Output is correct
14 Correct 15 ms 24924 KB Output is correct
15 Correct 51 ms 24924 KB Output is correct
16 Correct 208 ms 25432 KB Output is correct
17 Correct 121 ms 50840 KB Output is correct
18 Correct 124 ms 50788 KB Output is correct
19 Correct 124 ms 50816 KB Output is correct
20 Correct 181 ms 51000 KB Output is correct
21 Correct 452 ms 51640 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 24156 KB Output is correct
2 Correct 34 ms 24260 KB Output is correct
3 Correct 146 ms 24448 KB Output is correct
4 Correct 286 ms 24572 KB Output is correct
5 Correct 35 ms 31576 KB Output is correct
6 Correct 66 ms 31580 KB Output is correct
7 Correct 221 ms 32336 KB Output is correct
8 Correct 404 ms 32080 KB Output is correct
9 Correct 191 ms 67924 KB Output is correct
10 Correct 214 ms 68180 KB Output is correct
11 Correct 428 ms 68432 KB Output is correct
12 Correct 723 ms 68612 KB Output is correct
13 Correct 383 ms 116048 KB Output is correct
14 Correct 422 ms 115796 KB Output is correct
15 Correct 712 ms 116068 KB Output is correct
16 Correct 1010 ms 116540 KB Output is correct
17 Correct 1932 ms 116888 KB Output is correct

Subtask #5
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1934 ms 96340 KB Output is correct
2 Correct 1905 ms 98560 KB Output is correct
3 Correct 1773 ms 98064 KB Output is correct
4 Correct 2077 ms 98268 KB Output is correct
5 Correct 1894 ms 95440 KB Output is correct
6 Correct 1431 ms 76724 KB Output is correct
7 Correct 2222 ms 105244 KB Output is correct
8 Correct 2259 ms 105200 KB Output is correct
9 Correct 2270 ms 105384 KB Output is correct
10 Correct 2423 ms 105396 KB Output is correct
11 Correct 2191 ms 101852 KB Output is correct
12 Correct 1683 ms 79036 KB Output is correct
13 Correct 1536 ms 85680 KB Output is correct
14 Correct 1550 ms 85700 KB Output is correct
15 Correct 1531 ms 85860 KB Output is correct
16 Correct 1510 ms 86100 KB Output is correct
17 Correct 1451 ms 84860 KB Output is correct
18 Correct 1278 ms 71648 KB Output is correct
19 Correct 1499 ms 85720 KB Output is correct
20 Correct 1496 ms 85960 KB Output is correct
21 Correct 1509 ms 86420 KB Output is correct
22 Correct 1542 ms 85948 KB Output is correct
23 Correct 1439 ms 84724 KB Output is correct
24 Correct 1241 ms 71800 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 23392 KB Output is correct
2 Correct 8 ms 23388 KB Output is correct
3 Correct 6 ms 23436 KB Output is correct
4 Correct 6 ms 23388 KB Output is correct
5 Correct 5 ms 23448 KB Output is correct
6 Correct 5 ms 23388 KB Output is correct
7 Correct 5 ms 23644 KB Output is correct
8 Correct 7 ms 23644 KB Output is correct
9 Correct 6 ms 23644 KB Output is correct
10 Correct 5 ms 23644 KB Output is correct
11 Correct 5 ms 23436 KB Output is correct
12 Correct 5 ms 23644 KB Output is correct
13 Correct 6 ms 23644 KB Output is correct
14 Correct 7 ms 23644 KB Output is correct
15 Correct 6 ms 23644 KB Output is correct
16 Correct 6 ms 23644 KB Output is correct
17 Correct 7 ms 23644 KB Output is correct
18 Correct 6 ms 23644 KB Output is correct
19 Correct 23 ms 24136 KB Output is correct
20 Correct 29 ms 23900 KB Output is correct
21 Correct 28 ms 24120 KB Output is correct
22 Correct 24 ms 24152 KB Output is correct
23 Correct 49 ms 26204 KB Output is correct
24 Correct 46 ms 26392 KB Output is correct
25 Correct 50 ms 27200 KB Output is correct
26 Correct 53 ms 26600 KB Output is correct
27 Correct 5 ms 23388 KB Output is correct
28 Correct 6 ms 23388 KB Output is correct
29 Correct 13 ms 23644 KB Output is correct
30 Correct 39 ms 23688 KB Output is correct
31 Correct 179 ms 23888 KB Output is correct
32 Correct 5 ms 23384 KB Output is correct
33 Correct 7 ms 23644 KB Output is correct
34 Correct 6 ms 23644 KB Output is correct
35 Correct 10 ms 23644 KB Output is correct
36 Correct 52 ms 23812 KB Output is correct
37 Correct 192 ms 24144 KB Output is correct
38 Correct 10 ms 24924 KB Output is correct
39 Correct 11 ms 24924 KB Output is correct
40 Correct 15 ms 24924 KB Output is correct
41 Correct 51 ms 24924 KB Output is correct
42 Correct 208 ms 25432 KB Output is correct
43 Correct 121 ms 50840 KB Output is correct
44 Correct 124 ms 50788 KB Output is correct
45 Correct 124 ms 50816 KB Output is correct
46 Correct 181 ms 51000 KB Output is correct
47 Correct 452 ms 51640 KB Output is correct
48 Correct 10 ms 24156 KB Output is correct
49 Correct 34 ms 24260 KB Output is correct
50 Correct 146 ms 24448 KB Output is correct
51 Correct 286 ms 24572 KB Output is correct
52 Correct 35 ms 31576 KB Output is correct
53 Correct 66 ms 31580 KB Output is correct
54 Correct 221 ms 32336 KB Output is correct
55 Correct 404 ms 32080 KB Output is correct
56 Correct 191 ms 67924 KB Output is correct
57 Correct 214 ms 68180 KB Output is correct
58 Correct 428 ms 68432 KB Output is correct
59 Correct 723 ms 68612 KB Output is correct
60 Correct 383 ms 116048 KB Output is correct
61 Correct 422 ms 115796 KB Output is correct
62 Correct 712 ms 116068 KB Output is correct
63 Correct 1010 ms 116540 KB Output is correct
64 Correct 1932 ms 116888 KB Output is correct
65 Correct 1934 ms 96340 KB Output is correct
66 Correct 1905 ms 98560 KB Output is correct
67 Correct 1773 ms 98064 KB Output is correct
68 Correct 2077 ms 98268 KB Output is correct
69 Correct 1894 ms 95440 KB Output is correct
70 Correct 1431 ms 76724 KB Output is correct
71 Correct 2222 ms 105244 KB Output is correct
72 Correct 2259 ms 105200 KB Output is correct
73 Correct 2270 ms 105384 KB Output is correct
74 Correct 2423 ms 105396 KB Output is correct
75 Correct 2191 ms 101852 KB Output is correct
76 Correct 1683 ms 79036 KB Output is correct
77 Correct 1536 ms 85680 KB Output is correct
78 Correct 1550 ms 85700 KB Output is correct
79 Correct 1531 ms 85860 KB Output is correct
80 Correct 1510 ms 86100 KB Output is correct
81 Correct 1451 ms 84860 KB Output is correct
82 Correct 1278 ms 71648 KB Output is correct
83 Correct 1499 ms 85720 KB Output is correct
84 Correct 1496 ms 85960 KB Output is correct
85 Correct 1509 ms 86420 KB Output is correct
86 Correct 1542 ms 85948 KB Output is correct
87 Correct 1439 ms 84724 KB Output is correct
88 Correct 1241 ms 71800 KB Output is correct
89 Correct 1713 ms 97032 KB Output is correct
90 Correct 2025 ms 102296 KB Output is correct
91 Correct 2156 ms 106004 KB Output is correct
92 Correct 2188 ms 105092 KB Output is correct
93 Correct 2159 ms 101652 KB Output is correct
94 Correct 1908 ms 96800 KB Output is correct
95 Correct 1502 ms 84032 KB Output is correct
96 Correct 1577 ms 84032 KB Output is correct
97 Correct 1551 ms 84276 KB Output is correct
98 Correct 1552 ms 85796 KB Output is correct
99 Correct 1577 ms 84044 KB Output is correct
100 Correct 1551 ms 84104 KB Output is correct