oj.uz

Submission #851023

# Submission time Handle Problem Language Result Execution time Memory
851023 2023-09-18T08:35:37 Z LucaIlie Financial Report (JOI21_financial) C++17
48 / 100
 4000 ms 9544 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 ) );
    }
};


SegTree sir;

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

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

        int pos = i;
        for ( int j = i; j <= n; j++ ) {
            if ( j - pos > d )
                break;
            if ( v[j] <= v[i] )
                pos = j;
        }

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

    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 2396 KB Output is correct
2 Correct 1 ms 2492 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2492 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2492 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2492 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2492 KB Output is correct
23 Correct 1 ms 2392 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2492 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct

Subtask #2
14.0 / 14.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2492 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2492 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2492 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2492 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2492 KB Output is correct
23 Correct 1 ms 2392 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2492 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2488 KB Output is correct
29 Correct 1 ms 2488 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 1 ms 2396 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct
36 Correct 1 ms 2396 KB Output is correct
37 Correct 1 ms 2396 KB Output is correct
38 Correct 1 ms 2396 KB Output is correct
39 Correct 1 ms 2396 KB Output is correct
40 Correct 1 ms 2488 KB Output is correct
41 Correct 6 ms 2656 KB Output is correct
42 Correct 7 ms 2652 KB Output is correct
43 Correct 13 ms 2652 KB Output is correct
44 Correct 16 ms 2652 KB Output is correct
45 Correct 24 ms 2652 KB Output is correct
46 Correct 26 ms 2652 KB Output is correct
47 Correct 8 ms 2652 KB Output is correct
48 Correct 13 ms 2652 KB Output is correct
49 Correct 16 ms 2716 KB Output is correct
50 Correct 16 ms 2652 KB Output is correct
51 Correct 6 ms 2648 KB Output is correct
52 Correct 7 ms 2708 KB Output is correct
53 Correct 6 ms 2652 KB Output is correct
54 Correct 8 ms 2652 KB Output is correct
55 Correct 27 ms 2652 KB Output is correct
56 Correct 28 ms 2652 KB Output is correct
57 Correct 25 ms 2648 KB Output is correct
58 Correct 24 ms 2684 KB Output is correct
59 Correct 25 ms 2956 KB Output is correct
60 Correct 24 ms 2652 KB Output is correct
61 Correct 25 ms 2652 KB Output is correct

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4008 ms 9084 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4021 ms 9544 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2492 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2492 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2492 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2492 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2492 KB Output is correct
23 Correct 1 ms 2392 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2492 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2488 KB Output is correct
29 Correct 1 ms 2488 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 1 ms 2396 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct
36 Correct 1 ms 2396 KB Output is correct
37 Correct 1 ms 2396 KB Output is correct
38 Correct 1 ms 2396 KB Output is correct
39 Correct 1 ms 2396 KB Output is correct
40 Correct 1 ms 2488 KB Output is correct
41 Correct 6 ms 2656 KB Output is correct
42 Correct 7 ms 2652 KB Output is correct
43 Correct 13 ms 2652 KB Output is correct
44 Correct 16 ms 2652 KB Output is correct
45 Correct 24 ms 2652 KB Output is correct
46 Correct 26 ms 2652 KB Output is correct
47 Correct 8 ms 2652 KB Output is correct
48 Correct 13 ms 2652 KB Output is correct
49 Correct 16 ms 2716 KB Output is correct
50 Correct 16 ms 2652 KB Output is correct
51 Correct 6 ms 2648 KB Output is correct
52 Correct 7 ms 2708 KB Output is correct
53 Correct 6 ms 2652 KB Output is correct
54 Correct 8 ms 2652 KB Output is correct
55 Correct 27 ms 2652 KB Output is correct
56 Correct 28 ms 2652 KB Output is correct
57 Correct 25 ms 2648 KB Output is correct
58 Correct 24 ms 2684 KB Output is correct
59 Correct 25 ms 2956 KB Output is correct
60 Correct 24 ms 2652 KB Output is correct
61 Correct 25 ms 2652 KB Output is correct
62 Execution timed out 4008 ms 9084 KB Time limit exceeded
63 Halted 0 ms 0 KB -