oj.uz

답안 #823281

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
823281 2023-08-12T10:22:08 Z LucaIlie Construction of Highway (JOI18_construction) C++17
7 / 100
 2000 ms 9600 KB 
#include <bits/stdc++.h>

using namespace std;

struct vr {
    int val, rep;
};

const int UNDEF = 0;
const int INF = 1e9;
const int MAX_N = 1e5;
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];
vector<vr> elem;

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() {
    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] );
    for ( int i = 0; i < n - 1; i++ ) {
        int u = ord[i];
        vector<vr> elem;

        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( u, parent[pas][v] ).minn == c && arb.queryPath( u, parent[pas][v] ).maxx == c ) {
                    v = parent[pas][v];
                    nr += (1 << pas);
                }
            }
            elem.push_back( { c, nr } );
            v = parent[0][v];
        }

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

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

    return 0;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 7380 KB Output is correct
2 Correct 3 ms 7508 KB Output is correct
3 Correct 3 ms 7524 KB Output is correct
4 Correct 5 ms 7508 KB Output is correct
5 Correct 6 ms 7532 KB Output is correct
6 Correct 6 ms 7520 KB Output is correct
7 Correct 5 ms 7584 KB Output is correct
8 Correct 5 ms 7636 KB Output is correct
9 Correct 4 ms 7664 KB Output is correct
10 Correct 4 ms 7636 KB Output is correct
11 Correct 5 ms 7636 KB Output is correct
12 Correct 5 ms 7680 KB Output is correct
13 Correct 5 ms 7636 KB Output is correct
14 Correct 53 ms 7672 KB Output is correct
15 Correct 7 ms 7508 KB Output is correct
16 Correct 7 ms 7596 KB Output is correct
17 Correct 7 ms 7508 KB Output is correct
18 Correct 7 ms 7592 KB Output is correct
19 Correct 29 ms 7656 KB Output is correct
20 Correct 24 ms 7652 KB Output is correct
21 Correct 26 ms 7668 KB Output is correct
22 Correct 5 ms 7508 KB Output is correct
23 Correct 5 ms 7508 KB Output is correct
24 Correct 6 ms 7508 KB Output is correct
25 Correct 6 ms 7508 KB Output is correct
26 Correct 4 ms 7636 KB Output is correct
27 Correct 5 ms 7636 KB Output is correct
28 Correct 4 ms 7636 KB Output is correct
29 Correct 55 ms 7636 KB Output is correct
30 Correct 7 ms 7508 KB Output is correct
31 Correct 7 ms 7508 KB Output is correct
32 Correct 27 ms 7624 KB Output is correct
33 Correct 25 ms 7624 KB Output is correct
34 Correct 18 ms 7612 KB Output is correct
35 Correct 12 ms 7524 KB Output is correct
36 Correct 29 ms 7528 KB Output is correct
37 Correct 16 ms 7584 KB Output is correct
38 Correct 12 ms 7508 KB Output is correct
39 Correct 14 ms 7628 KB Output is correct
40 Correct 11 ms 7508 KB Output is correct
41 Correct 11 ms 7560 KB Output is correct
42 Correct 14 ms 7600 KB Output is correct
43 Correct 10 ms 7588 KB Output is correct
44 Correct 9 ms 7508 KB Output is correct

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 7380 KB Output is correct
2 Correct 3 ms 7508 KB Output is correct
3 Correct 3 ms 7524 KB Output is correct
4 Correct 5 ms 7508 KB Output is correct
5 Correct 6 ms 7532 KB Output is correct
6 Correct 6 ms 7520 KB Output is correct
7 Correct 5 ms 7584 KB Output is correct
8 Correct 5 ms 7636 KB Output is correct
9 Correct 4 ms 7664 KB Output is correct
10 Correct 4 ms 7636 KB Output is correct
11 Correct 5 ms 7636 KB Output is correct
12 Correct 5 ms 7680 KB Output is correct
13 Correct 5 ms 7636 KB Output is correct
14 Correct 53 ms 7672 KB Output is correct
15 Correct 7 ms 7508 KB Output is correct
16 Correct 7 ms 7596 KB Output is correct
17 Correct 7 ms 7508 KB Output is correct
18 Correct 7 ms 7592 KB Output is correct
19 Correct 29 ms 7656 KB Output is correct
20 Correct 24 ms 7652 KB Output is correct
21 Correct 26 ms 7668 KB Output is correct
22 Correct 5 ms 7508 KB Output is correct
23 Correct 5 ms 7508 KB Output is correct
24 Correct 6 ms 7508 KB Output is correct
25 Correct 6 ms 7508 KB Output is correct
26 Correct 4 ms 7636 KB Output is correct
27 Correct 5 ms 7636 KB Output is correct
28 Correct 4 ms 7636 KB Output is correct
29 Correct 55 ms 7636 KB Output is correct
30 Correct 7 ms 7508 KB Output is correct
31 Correct 7 ms 7508 KB Output is correct
32 Correct 27 ms 7624 KB Output is correct
33 Correct 25 ms 7624 KB Output is correct
34 Correct 18 ms 7612 KB Output is correct
35 Correct 12 ms 7524 KB Output is correct
36 Correct 29 ms 7528 KB Output is correct
37 Correct 16 ms 7584 KB Output is correct
38 Correct 12 ms 7508 KB Output is correct
39 Correct 14 ms 7628 KB Output is correct
40 Correct 11 ms 7508 KB Output is correct
41 Correct 11 ms 7560 KB Output is correct
42 Correct 14 ms 7600 KB Output is correct
43 Correct 10 ms 7588 KB Output is correct
44 Correct 9 ms 7508 KB Output is correct
45 Correct 9 ms 7684 KB Output is correct
46 Correct 38 ms 8148 KB Output is correct
47 Correct 42 ms 8216 KB Output is correct
48 Correct 35 ms 8220 KB Output is correct
49 Correct 19 ms 9600 KB Output is correct
50 Correct 17 ms 9500 KB Output is correct
51 Correct 18 ms 9600 KB Output is correct
52 Correct 20 ms 8852 KB Output is correct
53 Correct 21 ms 8884 KB Output is correct
54 Correct 22 ms 8888 KB Output is correct
55 Correct 21 ms 8880 KB Output is correct
56 Execution timed out 2065 ms 9008 KB Time limit exceeded
57 Halted 0 ms 0 KB -

Subtask #3
0 / 84.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 7380 KB Output is correct
2 Correct 3 ms 7508 KB Output is correct
3 Correct 3 ms 7524 KB Output is correct
4 Correct 5 ms 7508 KB Output is correct
5 Correct 6 ms 7532 KB Output is correct
6 Correct 6 ms 7520 KB Output is correct
7 Correct 5 ms 7584 KB Output is correct
8 Correct 5 ms 7636 KB Output is correct
9 Correct 4 ms 7664 KB Output is correct
10 Correct 4 ms 7636 KB Output is correct
11 Correct 5 ms 7636 KB Output is correct
12 Correct 5 ms 7680 KB Output is correct
13 Correct 5 ms 7636 KB Output is correct
14 Correct 53 ms 7672 KB Output is correct
15 Correct 7 ms 7508 KB Output is correct
16 Correct 7 ms 7596 KB Output is correct
17 Correct 7 ms 7508 KB Output is correct
18 Correct 7 ms 7592 KB Output is correct
19 Correct 29 ms 7656 KB Output is correct
20 Correct 24 ms 7652 KB Output is correct
21 Correct 26 ms 7668 KB Output is correct
22 Correct 5 ms 7508 KB Output is correct
23 Correct 5 ms 7508 KB Output is correct
24 Correct 6 ms 7508 KB Output is correct
25 Correct 6 ms 7508 KB Output is correct
26 Correct 4 ms 7636 KB Output is correct
27 Correct 5 ms 7636 KB Output is correct
28 Correct 4 ms 7636 KB Output is correct
29 Correct 55 ms 7636 KB Output is correct
30 Correct 7 ms 7508 KB Output is correct
31 Correct 7 ms 7508 KB Output is correct
32 Correct 27 ms 7624 KB Output is correct
33 Correct 25 ms 7624 KB Output is correct
34 Correct 18 ms 7612 KB Output is correct
35 Correct 12 ms 7524 KB Output is correct
36 Correct 29 ms 7528 KB Output is correct
37 Correct 16 ms 7584 KB Output is correct
38 Correct 12 ms 7508 KB Output is correct
39 Correct 14 ms 7628 KB Output is correct
40 Correct 11 ms 7508 KB Output is correct
41 Correct 11 ms 7560 KB Output is correct
42 Correct 14 ms 7600 KB Output is correct
43 Correct 10 ms 7588 KB Output is correct
44 Correct 9 ms 7508 KB Output is correct
45 Correct 9 ms 7684 KB Output is correct
46 Correct 38 ms 8148 KB Output is correct
47 Correct 42 ms 8216 KB Output is correct
48 Correct 35 ms 8220 KB Output is correct
49 Correct 19 ms 9600 KB Output is correct
50 Correct 17 ms 9500 KB Output is correct
51 Correct 18 ms 9600 KB Output is correct
52 Correct 20 ms 8852 KB Output is correct
53 Correct 21 ms 8884 KB Output is correct
54 Correct 22 ms 8888 KB Output is correct
55 Correct 21 ms 8880 KB Output is correct
56 Execution timed out 2065 ms 9008 KB Time limit exceeded
57 Halted 0 ms 0 KB -