oj.uz

Submission #823333

# Submission time Handle Problem Language Result Execution time Memory
823333 2023-08-12T10:49:18 Z LucaIlie Construction of Highway (JOI18_construction) C++17
16 / 100
 2000 ms 60380 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops")

using namespace std;

struct vr {
    int val, rep;
};

const int UNDEF = 0;
const int INF = 1e9;
const int MAX_N = 1e5 + 5;
const int MAX_LOG_N = 17;
int c[MAX_N], parent[MAX_LOG_N + 1][MAX_N], ord[MAX_N];
vector<int> edges[MAX_N];
vr elem[MAX_N];

struct info {
    int minn, maxx;

    info operator + ( info &x ) const {
        return { min( minn, x.minn ), max( maxx, x.maxx ) };
    }
};

struct SegTree {
    info segTree[4 * MAX_N];
    int lazy[4 * MAX_N];

    void init() {
        for ( int v = 0; v < 4 * MAX_N; v++ ) {
            segTree[v] = { INF, -INF };
            lazy[v] = UNDEF;
        }
    }

    void propag( int v, int l, int r ) {
        if ( lazy[v] == UNDEF )
            return;

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

    void update( int v, int l, int r, int lu, int ru, int 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] = segTree[v * 2 + 1] + segTree[v * 2 + 2];
    }

    info query( int v, int l, int r, int lq, int rq ) {
        propag( v, l, r );

        if ( l > rq || r < lq )
            return { INF, -INF };

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

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

struct HPD {
    int n, curPos;
    int sz[MAX_N], depth[MAX_N], heavy[MAX_N], head[MAX_N], leftPos[MAX_N], rightPos[MAX_N];
    SegTree aint;

    void dfs( int u, int p ) {
        int maxSz = -1;

        parent[0][u] = p;
        depth[u] = depth[p] + 1;
        sz[u] = 1;
        heavy[u] = UNDEF;
        for ( int v: edges[u] ) {
            if ( v == p )
                continue;
            dfs( v, u );
            sz[u] += sz[v];
            if ( sz[v] > maxSz ) {
                maxSz = sz[v];
                heavy[u] = v;
            }
        }
    }

    void decomp( int u, int p, int h ) {
        head[u] = h;
        leftPos[u] = ++curPos;
        if ( heavy[u] != UNDEF )
            decomp( heavy[u], u, h );
        for ( int v: edges[u] ) {
            if ( v == p || v == heavy[u] )
                continue;
            decomp( v, u, v );
        }
        rightPos[u] = curPos;
    }

    void init( int _n ) {
        n = _n;
        aint.init();
        parent[0][1] = UNDEF;
        dfs( 1, UNDEF );
        decomp( 1, UNDEF, 1 );
    }


    void updatePath( int u, int x ) {
        while ( u != 0 ) {
            aint.update( 0, 1, n, leftPos[head[u]], leftPos[u], x );
            u = parent[0][head[u]];
        }
    }

    info queryPath( int u, int v ) {
       info ans = { INF, -INF };

        while ( head[u] != head[v] ) {
            if ( depth[head[u]] < depth[head[v]] )
                swap( u, v );
            info a = aint.query( 0, 1, n, leftPos[head[u]], leftPos[u] );
            ans = ans + a;
            u = parent[0][head[u]];
        }
        if ( depth[u] > depth[v] )
            swap( u, v );
        info a = aint.query( 0, 1, n, leftPos[u], leftPos[v] );
        ans = ans + a;

        return ans;
    }
};

struct AIB {
    int aib[MAX_N + 1];

    void update( int i, int x ) {
        while ( i <= MAX_N ) {
            aib[i] += x;
            i += (i & -i);
        }
    }

    int query( int i ) {
        int sum = 0;
        while ( i > 0 ) {
            sum += aib[i];
            i -= (i & -i);
        }
        return sum;
    }
};

AIB aib;
HPD arb;
map<int, int> normal;

int main() {
    ios_base::sync_with_stdio( false );
    cin.tie( 0 );
    cout.tie( 0 );
    int n;

    cin >> n;
    for ( int u = 1; u <= n; u++ )
        cin >> c[u], normal[c[u]] = 1;
    int val = 0;
    for ( auto x: normal )
        normal[x.first] = ++val;
    for ( int u = 1; u <= n; u++ )
        c[u] = normal[c[u]];

    for ( int i = 0; i < n - 1; i++ ) {
        int u, v;
        cin >> u >> v;
        parent[0][v] = u;
        edges[u].push_back( v );
        ord[i] = v;
    }

    for ( int pas = 1; pas <= MAX_LOG_N; pas++ ) {
        for ( int u = 1; u <= n; u++ )
            parent[pas][u] = parent[pas - 1][parent[pas - 1][u]];
    }

    arb.init( n );
    arb.updatePath( 1, c[1] );
    int sumSize = 0;
    for ( int i = 0; i < n - 1; i++ ) {
        int u = ord[i];
        int elemSize = 0;

        int v = parent[0][u];
        while( v != UNDEF ) {
            int c = arb.queryPath( v, v ).minn;
            int nr = 1;
            for ( int pas = MAX_LOG_N; pas >= 0; pas-- ) {
                if ( parent[pas][v] != UNDEF && arb.queryPath( v, parent[pas][v] ).maxx == c && arb.queryPath( v, parent[pas][v] ).minn == c ) {
                    v = parent[pas][v];
                    nr += (1 << pas);
                }
            }
            if ( elemSize > 0 && elem[elemSize - 1].val == c )
                return 1;
            elem[elemSize++] = { c, nr };
            v = parent[0][v];
        }
        sumSize += elemSize;

        long long ans = 0;
        for ( int i = 0; i < elemSize; i++ ) {
            vr x = elem[i];
            ans += (long long)x.rep * aib.query( x.val -1 );
            aib.update( x.val, x.rep );
        }
        for ( int i = 0; i < elemSize; i++ ) {
            vr x = elem[i];
            aib.update( x.val, -x.rep );
        }
        cout << ans << "\n";

        arb.updatePath( u, c[u] );
    }

    return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7508 KB Output is correct
2 Correct 3 ms 7508 KB Output is correct
3 Correct 3 ms 7536 KB Output is correct
4 Correct 4 ms 7488 KB Output is correct
5 Correct 4 ms 7488 KB Output is correct
6 Correct 4 ms 7508 KB Output is correct
7 Correct 4 ms 7608 KB Output is correct
8 Correct 4 ms 7764 KB Output is correct
9 Correct 4 ms 7764 KB Output is correct
10 Correct 4 ms 7764 KB Output is correct
11 Correct 5 ms 7636 KB Output is correct
12 Correct 4 ms 7696 KB Output is correct
13 Correct 4 ms 7692 KB Output is correct
14 Correct 5 ms 7636 KB Output is correct
15 Correct 5 ms 7508 KB Output is correct
16 Correct 5 ms 7612 KB Output is correct
17 Correct 6 ms 7636 KB Output is correct
18 Correct 5 ms 7576 KB Output is correct
19 Correct 4 ms 7636 KB Output is correct
20 Correct 4 ms 7636 KB Output is correct
21 Correct 4 ms 7636 KB Output is correct
22 Correct 4 ms 7508 KB Output is correct
23 Correct 4 ms 7508 KB Output is correct
24 Correct 4 ms 7508 KB Output is correct
25 Correct 4 ms 7508 KB Output is correct
26 Correct 4 ms 7768 KB Output is correct
27 Correct 4 ms 7636 KB Output is correct
28 Correct 4 ms 7636 KB Output is correct
29 Correct 4 ms 7672 KB Output is correct
30 Correct 5 ms 7608 KB Output is correct
31 Correct 5 ms 7508 KB Output is correct
32 Correct 4 ms 7656 KB Output is correct
33 Correct 4 ms 7636 KB Output is correct
34 Correct 4 ms 7508 KB Output is correct
35 Correct 4 ms 7508 KB Output is correct
36 Correct 4 ms 7508 KB Output is correct
37 Correct 6 ms 7636 KB Output is correct
38 Correct 4 ms 7508 KB Output is correct
39 Correct 4 ms 7636 KB Output is correct
40 Correct 4 ms 7636 KB Output is correct
41 Correct 4 ms 7508 KB Output is correct
42 Correct 4 ms 7508 KB Output is correct
43 Correct 4 ms 7508 KB Output is correct
44 Correct 4 ms 7508 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7508 KB Output is correct
2 Correct 3 ms 7508 KB Output is correct
3 Correct 3 ms 7536 KB Output is correct
4 Correct 4 ms 7488 KB Output is correct
5 Correct 4 ms 7488 KB Output is correct
6 Correct 4 ms 7508 KB Output is correct
7 Correct 4 ms 7608 KB Output is correct
8 Correct 4 ms 7764 KB Output is correct
9 Correct 4 ms 7764 KB Output is correct
10 Correct 4 ms 7764 KB Output is correct
11 Correct 5 ms 7636 KB Output is correct
12 Correct 4 ms 7696 KB Output is correct
13 Correct 4 ms 7692 KB Output is correct
14 Correct 5 ms 7636 KB Output is correct
15 Correct 5 ms 7508 KB Output is correct
16 Correct 5 ms 7612 KB Output is correct
17 Correct 6 ms 7636 KB Output is correct
18 Correct 5 ms 7576 KB Output is correct
19 Correct 4 ms 7636 KB Output is correct
20 Correct 4 ms 7636 KB Output is correct
21 Correct 4 ms 7636 KB Output is correct
22 Correct 4 ms 7508 KB Output is correct
23 Correct 4 ms 7508 KB Output is correct
24 Correct 4 ms 7508 KB Output is correct
25 Correct 4 ms 7508 KB Output is correct
26 Correct 4 ms 7768 KB Output is correct
27 Correct 4 ms 7636 KB Output is correct
28 Correct 4 ms 7636 KB Output is correct
29 Correct 4 ms 7672 KB Output is correct
30 Correct 5 ms 7608 KB Output is correct
31 Correct 5 ms 7508 KB Output is correct
32 Correct 4 ms 7656 KB Output is correct
33 Correct 4 ms 7636 KB Output is correct
34 Correct 4 ms 7508 KB Output is correct
35 Correct 4 ms 7508 KB Output is correct
36 Correct 4 ms 7508 KB Output is correct
37 Correct 6 ms 7636 KB Output is correct
38 Correct 4 ms 7508 KB Output is correct
39 Correct 4 ms 7636 KB Output is correct
40 Correct 4 ms 7636 KB Output is correct
41 Correct 4 ms 7508 KB Output is correct
42 Correct 4 ms 7508 KB Output is correct
43 Correct 4 ms 7508 KB Output is correct
44 Correct 4 ms 7508 KB Output is correct
45 Correct 7 ms 7636 KB Output is correct
46 Correct 21 ms 8148 KB Output is correct
47 Correct 23 ms 8156 KB Output is correct
48 Correct 20 ms 8192 KB Output is correct
49 Correct 13 ms 9556 KB Output is correct
50 Correct 13 ms 9596 KB Output is correct
51 Correct 14 ms 9628 KB Output is correct
52 Correct 15 ms 8876 KB Output is correct
53 Correct 20 ms 8788 KB Output is correct
54 Correct 18 ms 8936 KB Output is correct
55 Correct 15 ms 8864 KB Output is correct
56 Correct 18 ms 8788 KB Output is correct
57 Correct 33 ms 8148 KB Output is correct
58 Correct 42 ms 8180 KB Output is correct
59 Correct 42 ms 8148 KB Output is correct
60 Correct 42 ms 8196 KB Output is correct
61 Correct 19 ms 8788 KB Output is correct
62 Correct 22 ms 8880 KB Output is correct
63 Correct 19 ms 8880 KB Output is correct
64 Correct 17 ms 8008 KB Output is correct
65 Correct 19 ms 7932 KB Output is correct
66 Correct 23 ms 8028 KB Output is correct
67 Correct 24 ms 8084 KB Output is correct
68 Correct 13 ms 9440 KB Output is correct
69 Correct 14 ms 8788 KB Output is correct
70 Correct 15 ms 8684 KB Output is correct
71 Correct 14 ms 8704 KB Output is correct
72 Correct 34 ms 8192 KB Output is correct
73 Correct 41 ms 7996 KB Output is correct
74 Correct 17 ms 8688 KB Output is correct
75 Correct 16 ms 8532 KB Output is correct
76 Correct 16 ms 8416 KB Output is correct
77 Correct 15 ms 8360 KB Output is correct
78 Correct 15 ms 8276 KB Output is correct
79 Correct 20 ms 8148 KB Output is correct
80 Correct 14 ms 8172 KB Output is correct
81 Correct 18 ms 8540 KB Output is correct
82 Correct 18 ms 8424 KB Output is correct
83 Correct 17 ms 8364 KB Output is correct
84 Correct 17 ms 8348 KB Output is correct
85 Correct 17 ms 8240 KB Output is correct
86 Correct 16 ms 8148 KB Output is correct

Subtask #3
0 / 84.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7508 KB Output is correct
2 Correct 3 ms 7508 KB Output is correct
3 Correct 3 ms 7536 KB Output is correct
4 Correct 4 ms 7488 KB Output is correct
5 Correct 4 ms 7488 KB Output is correct
6 Correct 4 ms 7508 KB Output is correct
7 Correct 4 ms 7608 KB Output is correct
8 Correct 4 ms 7764 KB Output is correct
9 Correct 4 ms 7764 KB Output is correct
10 Correct 4 ms 7764 KB Output is correct
11 Correct 5 ms 7636 KB Output is correct
12 Correct 4 ms 7696 KB Output is correct
13 Correct 4 ms 7692 KB Output is correct
14 Correct 5 ms 7636 KB Output is correct
15 Correct 5 ms 7508 KB Output is correct
16 Correct 5 ms 7612 KB Output is correct
17 Correct 6 ms 7636 KB Output is correct
18 Correct 5 ms 7576 KB Output is correct
19 Correct 4 ms 7636 KB Output is correct
20 Correct 4 ms 7636 KB Output is correct
21 Correct 4 ms 7636 KB Output is correct
22 Correct 4 ms 7508 KB Output is correct
23 Correct 4 ms 7508 KB Output is correct
24 Correct 4 ms 7508 KB Output is correct
25 Correct 4 ms 7508 KB Output is correct
26 Correct 4 ms 7768 KB Output is correct
27 Correct 4 ms 7636 KB Output is correct
28 Correct 4 ms 7636 KB Output is correct
29 Correct 4 ms 7672 KB Output is correct
30 Correct 5 ms 7608 KB Output is correct
31 Correct 5 ms 7508 KB Output is correct
32 Correct 4 ms 7656 KB Output is correct
33 Correct 4 ms 7636 KB Output is correct
34 Correct 4 ms 7508 KB Output is correct
35 Correct 4 ms 7508 KB Output is correct
36 Correct 4 ms 7508 KB Output is correct
37 Correct 6 ms 7636 KB Output is correct
38 Correct 4 ms 7508 KB Output is correct
39 Correct 4 ms 7636 KB Output is correct
40 Correct 4 ms 7636 KB Output is correct
41 Correct 4 ms 7508 KB Output is correct
42 Correct 4 ms 7508 KB Output is correct
43 Correct 4 ms 7508 KB Output is correct
44 Correct 4 ms 7508 KB Output is correct
45 Correct 7 ms 7636 KB Output is correct
46 Correct 21 ms 8148 KB Output is correct
47 Correct 23 ms 8156 KB Output is correct
48 Correct 20 ms 8192 KB Output is correct
49 Correct 13 ms 9556 KB Output is correct
50 Correct 13 ms 9596 KB Output is correct
51 Correct 14 ms 9628 KB Output is correct
52 Correct 15 ms 8876 KB Output is correct
53 Correct 20 ms 8788 KB Output is correct
54 Correct 18 ms 8936 KB Output is correct
55 Correct 15 ms 8864 KB Output is correct
56 Correct 18 ms 8788 KB Output is correct
57 Correct 33 ms 8148 KB Output is correct
58 Correct 42 ms 8180 KB Output is correct
59 Correct 42 ms 8148 KB Output is correct
60 Correct 42 ms 8196 KB Output is correct
61 Correct 19 ms 8788 KB Output is correct
62 Correct 22 ms 8880 KB Output is correct
63 Correct 19 ms 8880 KB Output is correct
64 Correct 17 ms 8008 KB Output is correct
65 Correct 19 ms 7932 KB Output is correct
66 Correct 23 ms 8028 KB Output is correct
67 Correct 24 ms 8084 KB Output is correct
68 Correct 13 ms 9440 KB Output is correct
69 Correct 14 ms 8788 KB Output is correct
70 Correct 15 ms 8684 KB Output is correct
71 Correct 14 ms 8704 KB Output is correct
72 Correct 34 ms 8192 KB Output is correct
73 Correct 41 ms 7996 KB Output is correct
74 Correct 17 ms 8688 KB Output is correct
75 Correct 16 ms 8532 KB Output is correct
76 Correct 16 ms 8416 KB Output is correct
77 Correct 15 ms 8360 KB Output is correct
78 Correct 15 ms 8276 KB Output is correct
79 Correct 20 ms 8148 KB Output is correct
80 Correct 14 ms 8172 KB Output is correct
81 Correct 18 ms 8540 KB Output is correct
82 Correct 18 ms 8424 KB Output is correct
83 Correct 17 ms 8364 KB Output is correct
84 Correct 17 ms 8348 KB Output is correct
85 Correct 17 ms 8240 KB Output is correct
86 Correct 16 ms 8148 KB Output is correct
87 Correct 61 ms 9172 KB Output is correct
88 Correct 207 ms 12604 KB Output is correct
89 Correct 992 ms 24484 KB Output is correct
90 Correct 1016 ms 24412 KB Output is correct
91 Correct 1050 ms 24440 KB Output is correct
92 Correct 490 ms 60320 KB Output is correct
93 Correct 451 ms 60304 KB Output is correct
94 Correct 449 ms 60380 KB Output is correct
95 Correct 539 ms 41864 KB Output is correct
96 Correct 600 ms 42164 KB Output is correct
97 Correct 551 ms 41920 KB Output is correct
98 Correct 577 ms 41932 KB Output is correct
99 Correct 646 ms 41680 KB Output is correct
100 Correct 1877 ms 25024 KB Output is correct
101 Execution timed out 2066 ms 24952 KB Time limit exceeded
102 Halted 0 ms 0 KB -