oj.uz

Submission #851031

# Submission time Handle Problem Language Result Execution time Memory
851031 2023-09-18T08:46:09 Z LucaIlie Financial Report (JOI21_financial) C++17
100 / 100
 711 ms 31608 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 3e5;
int v[MAX_N], p[MAX_N];

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

    void propag( int v, bool leaf ) {
        if ( segTree[v] == 0 )
            return;
        segTree[v] = max( segTree[v], lazy[v] );
        if ( !leaf ) {
            lazy[v * 2 + 1] = max( lazy[v * 2 + 1], lazy[v] );
            lazy[v * 2 + 2] = max( lazy[v * 2 + 2], lazy[v] );
        }
        lazy[v] = 0;
    }

    void updatePos( int v, int l, int r, int pos, int x ) {
        propag( v, (l == r) );

        if ( l > pos || r < pos )
            return;

        if ( l == r ) {
            segTree[v] = max( segTree[v], x );
            return;
        }

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

    void update( int v, int l, int r, int lu, int ru, int x ) {
        if ( lu > ru )
            return;

        propag( v, (l == r) );

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

        if ( lu <= l && r <= ru ) {
            lazy[v] = max( lazy[v], x );
            segTree[v] = max( segTree[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] );
    }

    int query( int v, int l, int r, int lq, int rq ) {
        if ( lq > rq )
            return 0;
        propag( v, (l == r));

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

struct DSU {
    int parent[MAX_N + 1], maxx[MAX_N + 1];

    void init() {
        for ( int i = 0; i <= MAX_N; i++ )
            parent[i] = maxx[i] = i;
    }

    int findParent( int u ) {
        if ( parent[u] == u )
            return u;

        parent[u] = findParent( parent[u] );
        return parent[u];
    }

    void join( int u, int v ) {
        u = findParent( u );
        v = findParent( v );

        maxx[u] = max( maxx[u], maxx[v] );
        parent[v] = u;
    }

    int getMax( int u ) {
        return maxx[findParent( u )];
    }
} dsu;

SegTree sir;
set<int> pos;

int main() {
    int n, d;

    cin >> n >> d;
    for ( int i = 1; i <= n; i++ )
        cin >> v[i], p[i] = i;

    sort( p + 1, p + 1 + n, []( int i, int j ) {
        if ( v[i] == v[j] )
            return i > j;
        return v[i] < v[j];
    } );

    dsu.init();
    pos.insert( 0 );
    pos.insert( n + 1 );
    for ( int ii = 1; ii <= n; ii++ ) {
        int i = p[ii];
        int len = sir.query( 0, 1, n, max( 1, i - d ), i - 1 ) + 1;
        sir.updatePos( 0, 1, n, i, len );

        auto ub = pos.upper_bound( i );
        auto lb = pos.lower_bound( i );
        lb--;

        if ( *ub <= n && *ub - i <= d )
            dsu.join( i, *ub );
        if ( *lb >= 1 && i - *lb <= d )
            dsu.join( i, *lb );

        sir.update( 0, 1, n, i + 1, dsu.getMax( i ), len );
        pos.insert( i );
    }

    cout << sir.query( 0, 1, n, n, n );

    return 0;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4440 KB Output is correct
5 Correct 1 ms 4540 KB Output is correct
6 Correct 1 ms 4696 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4696 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4440 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 1 ms 4440 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 1 ms 4444 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4440 KB Output is correct
5 Correct 1 ms 4540 KB Output is correct
6 Correct 1 ms 4696 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4696 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4440 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 1 ms 4440 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 1 ms 4444 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 2 ms 4444 KB Output is correct
29 Correct 1 ms 4444 KB Output is correct
30 Correct 1 ms 4444 KB Output is correct
31 Correct 1 ms 4444 KB Output is correct
32 Correct 1 ms 4444 KB Output is correct
33 Correct 1 ms 4576 KB Output is correct
34 Correct 1 ms 4444 KB Output is correct
35 Correct 1 ms 4444 KB Output is correct
36 Correct 1 ms 4444 KB Output is correct
37 Correct 1 ms 4444 KB Output is correct
38 Correct 2 ms 4444 KB Output is correct
39 Correct 1 ms 4444 KB Output is correct
40 Correct 1 ms 4444 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4440 KB Output is correct
5 Correct 1 ms 4540 KB Output is correct
6 Correct 1 ms 4696 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4696 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4440 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 1 ms 4440 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 1 ms 4444 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 2 ms 4444 KB Output is correct
29 Correct 1 ms 4444 KB Output is correct
30 Correct 1 ms 4444 KB Output is correct
31 Correct 1 ms 4444 KB Output is correct
32 Correct 1 ms 4444 KB Output is correct
33 Correct 1 ms 4576 KB Output is correct
34 Correct 1 ms 4444 KB Output is correct
35 Correct 1 ms 4444 KB Output is correct
36 Correct 1 ms 4444 KB Output is correct
37 Correct 1 ms 4444 KB Output is correct
38 Correct 2 ms 4444 KB Output is correct
39 Correct 1 ms 4444 KB Output is correct
40 Correct 1 ms 4444 KB Output is correct
41 Correct 8 ms 4956 KB Output is correct
42 Correct 9 ms 5004 KB Output is correct
43 Correct 9 ms 4956 KB Output is correct
44 Correct 9 ms 4956 KB Output is correct
45 Correct 9 ms 4956 KB Output is correct
46 Correct 10 ms 4812 KB Output is correct
47 Correct 8 ms 4976 KB Output is correct
48 Correct 9 ms 4956 KB Output is correct
49 Correct 13 ms 4956 KB Output is correct
50 Correct 10 ms 4812 KB Output is correct
51 Correct 8 ms 4956 KB Output is correct
52 Correct 9 ms 5004 KB Output is correct
53 Correct 7 ms 4956 KB Output is correct
54 Correct 9 ms 4836 KB Output is correct
55 Correct 11 ms 5000 KB Output is correct
56 Correct 10 ms 4956 KB Output is correct
57 Correct 10 ms 4956 KB Output is correct
58 Correct 7 ms 4956 KB Output is correct
59 Correct 7 ms 4956 KB Output is correct
60 Correct 8 ms 4824 KB Output is correct
61 Correct 8 ms 4956 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 377 ms 27960 KB Output is correct
2 Correct 377 ms 27948 KB Output is correct
3 Correct 434 ms 27844 KB Output is correct
4 Correct 542 ms 30916 KB Output is correct
5 Correct 460 ms 30804 KB Output is correct
6 Correct 502 ms 30804 KB Output is correct
7 Correct 290 ms 31036 KB Output is correct
8 Correct 366 ms 30704 KB Output is correct
9 Correct 276 ms 30716 KB Output is correct
10 Correct 318 ms 30796 KB Output is correct
11 Correct 404 ms 30860 KB Output is correct
12 Correct 429 ms 30796 KB Output is correct
13 Correct 398 ms 31412 KB Output is correct
14 Correct 623 ms 30704 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 385 ms 27988 KB Output is correct
2 Correct 509 ms 27892 KB Output is correct
3 Correct 624 ms 27880 KB Output is correct
4 Correct 693 ms 27780 KB Output is correct
5 Correct 552 ms 27984 KB Output is correct
6 Correct 571 ms 27988 KB Output is correct
7 Correct 295 ms 28092 KB Output is correct
8 Correct 357 ms 27988 KB Output is correct
9 Correct 366 ms 27728 KB Output is correct
10 Correct 503 ms 27728 KB Output is correct
11 Correct 637 ms 27984 KB Output is correct
12 Correct 498 ms 28040 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4440 KB Output is correct
5 Correct 1 ms 4540 KB Output is correct
6 Correct 1 ms 4696 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4696 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4440 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 1 ms 4440 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 1 ms 4444 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 2 ms 4444 KB Output is correct
29 Correct 1 ms 4444 KB Output is correct
30 Correct 1 ms 4444 KB Output is correct
31 Correct 1 ms 4444 KB Output is correct
32 Correct 1 ms 4444 KB Output is correct
33 Correct 1 ms 4576 KB Output is correct
34 Correct 1 ms 4444 KB Output is correct
35 Correct 1 ms 4444 KB Output is correct
36 Correct 1 ms 4444 KB Output is correct
37 Correct 1 ms 4444 KB Output is correct
38 Correct 2 ms 4444 KB Output is correct
39 Correct 1 ms 4444 KB Output is correct
40 Correct 1 ms 4444 KB Output is correct
41 Correct 8 ms 4956 KB Output is correct
42 Correct 9 ms 5004 KB Output is correct
43 Correct 9 ms 4956 KB Output is correct
44 Correct 9 ms 4956 KB Output is correct
45 Correct 9 ms 4956 KB Output is correct
46 Correct 10 ms 4812 KB Output is correct
47 Correct 8 ms 4976 KB Output is correct
48 Correct 9 ms 4956 KB Output is correct
49 Correct 13 ms 4956 KB Output is correct
50 Correct 10 ms 4812 KB Output is correct
51 Correct 8 ms 4956 KB Output is correct
52 Correct 9 ms 5004 KB Output is correct
53 Correct 7 ms 4956 KB Output is correct
54 Correct 9 ms 4836 KB Output is correct
55 Correct 11 ms 5000 KB Output is correct
56 Correct 10 ms 4956 KB Output is correct
57 Correct 10 ms 4956 KB Output is correct
58 Correct 7 ms 4956 KB Output is correct
59 Correct 7 ms 4956 KB Output is correct
60 Correct 8 ms 4824 KB Output is correct
61 Correct 8 ms 4956 KB Output is correct
62 Correct 377 ms 27960 KB Output is correct
63 Correct 377 ms 27948 KB Output is correct
64 Correct 434 ms 27844 KB Output is correct
65 Correct 542 ms 30916 KB Output is correct
66 Correct 460 ms 30804 KB Output is correct
67 Correct 502 ms 30804 KB Output is correct
68 Correct 290 ms 31036 KB Output is correct
69 Correct 366 ms 30704 KB Output is correct
70 Correct 276 ms 30716 KB Output is correct
71 Correct 318 ms 30796 KB Output is correct
72 Correct 404 ms 30860 KB Output is correct
73 Correct 429 ms 30796 KB Output is correct
74 Correct 398 ms 31412 KB Output is correct
75 Correct 623 ms 30704 KB Output is correct
76 Correct 385 ms 27988 KB Output is correct
77 Correct 509 ms 27892 KB Output is correct
78 Correct 624 ms 27880 KB Output is correct
79 Correct 693 ms 27780 KB Output is correct
80 Correct 552 ms 27984 KB Output is correct
81 Correct 571 ms 27988 KB Output is correct
82 Correct 295 ms 28092 KB Output is correct
83 Correct 357 ms 27988 KB Output is correct
84 Correct 366 ms 27728 KB Output is correct
85 Correct 503 ms 27728 KB Output is correct
86 Correct 637 ms 27984 KB Output is correct
87 Correct 498 ms 28040 KB Output is correct
88 Correct 528 ms 30904 KB Output is correct
89 Correct 569 ms 31160 KB Output is correct
90 Correct 611 ms 31060 KB Output is correct
91 Correct 630 ms 31056 KB Output is correct
92 Correct 515 ms 30896 KB Output is correct
93 Correct 702 ms 30744 KB Output is correct
94 Correct 674 ms 31608 KB Output is correct
95 Correct 493 ms 30884 KB Output is correct
96 Correct 572 ms 30804 KB Output is correct
97 Correct 685 ms 30828 KB Output is correct
98 Correct 687 ms 31236 KB Output is correct
99 Correct 678 ms 30804 KB Output is correct
100 Correct 711 ms 30776 KB Output is correct
101 Correct 311 ms 30804 KB Output is correct
102 Correct 390 ms 30800 KB Output is correct
103 Correct 459 ms 30808 KB Output is correct
104 Correct 535 ms 31044 KB Output is correct
105 Correct 649 ms 30864 KB Output is correct
106 Correct 449 ms 30796 KB Output is correct
107 Correct 517 ms 31060 KB Output is correct
108 Correct 629 ms 30816 KB Output is correct
109 Correct 343 ms 30824 KB Output is correct
110 Correct 636 ms 30824 KB Output is correct
111 Correct 618 ms 30816 KB Output is correct
112 Correct 507 ms 30800 KB Output is correct
113 Correct 686 ms 30692 KB Output is correct
114 Correct 684 ms 30988 KB Output is correct
115 Correct 374 ms 30924 KB Output is correct
116 Correct 379 ms 30780 KB Output is correct
117 Correct 427 ms 30740 KB Output is correct
118 Correct 437 ms 30888 KB Output is correct
119 Correct 458 ms 30804 KB Output is correct
120 Correct 467 ms 30800 KB Output is correct