oj.uz

Submission #924598

# Submission time Handle Problem Language Result Execution time Memory
924598 2024-02-09T08:53:45 Z boris_mihov Financial Report (JOI21_financial) C++17
100 / 100
 2415 ms 30548 KB 
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>
#include <queue>
#include <cmath>
#include <set>

typedef long long llong;
const int MAXN = 300000 + 10;
const int INF  = 1e9;

int n, d;
struct SegmentTree
{
    struct Node
    {
        int length;
        int prefixOnes;
        int suffixOnes;
        int maxOnes;
        int maxDP;

        Node()
        {
            prefixOnes = suffixOnes = maxOnes = maxDP = length = 0;
        }

        friend Node operator + (const Node &left, const Node &right)
        {
            Node res;
            res.length = left.length + right.length;
            
            res.prefixOnes = left.prefixOnes;
            if (left.prefixOnes == left.length) res.prefixOnes = left.length + right.prefixOnes;

            res.suffixOnes = right.suffixOnes;
            if (right.suffixOnes == right.length) res.suffixOnes = right.length + left.suffixOnes;
            
            res.maxOnes = left.suffixOnes + right.prefixOnes;
            res.maxOnes = std::max(res.maxOnes, left.maxOnes);
            res.maxOnes = std::max(res.maxOnes, right.maxOnes);
            res.maxDP = std::max(left.maxDP, right.maxDP);
            return res;
        }
    };

    Node tree[4*MAXN];
    void build(int l, int r, int node)
    {
        if (l == r)
        {
            tree[node].length = 1;
            return;
        }

        int mid = (l + r) / 2;
        build(l, mid, 2*node);
        build(mid + 1, r, 2*node + 1);
        tree[node] = tree[2*node] + tree[2*node + 1];
    }

    void update(int l, int r, int node, int queryPos, int dpVAL)
    {
        if (l == r)
        {
            tree[node].maxDP = dpVAL;
            tree[node].prefixOnes = 1;
            tree[node].suffixOnes = 1;
            tree[node].maxOnes = 1;
            tree[node].length = 1;
            return;
        }

        int mid = (l + r) / 2;
        if (queryPos <= mid) update(l, mid, 2*node, queryPos, dpVAL);
        else update(mid + 1, r, 2*node + 1, queryPos, dpVAL);
        tree[node] = tree[2*node] + tree[2*node + 1];
    }

    Node query(int l, int r, int node, int queryL, int queryR)
    {
        if (queryL <= l && r <= queryR)
        {
            return tree[node];
        }

        Node res;
        int mid = (l + r) / 2;
        if (queryL <= mid) res = res + query(l, mid, 2*node, queryL, queryR);
        if (mid + 1 <= queryR) res = res + query(mid + 1, r, 2*node + 1, queryL, queryR);
        return res;
    }

    void build()
    {
        build(1, n, 1);
    }

    void update(int pos, int val)
    {
        update(1, n, 1, pos, val);
    }

    int queryOnes(int l, int r)
    {
        return query(1, n, 1, l, r).maxOnes;
    }

    int queryDP(int l, int r)
    {
        return query(1, n, 1, l, r).maxDP;
    }
};

int a[MAXN];
int dp[MAXN];
int perm[MAXN];
SegmentTree tree;

void solve()
{
    std::iota(perm + 1, perm + 1 + n, 1);
    std::sort(perm + 1, perm + 1 + n, [&](int x, int y)
    {
        return a[x] > a[y] || (a[x] == a[y] && x < y);
    });

    int res = 0;
    tree.build();
    for (int i = 1 ; i <= n ; ++i)
    {
        int l = perm[i], r = n, mid;
        while (l < r - 1)
        {
            mid = (l + r) / 2;
            if (tree.queryOnes(perm[i] + 1, mid) < d) l = mid;
            else r = mid;
        }

        dp[perm[i]] = tree.queryDP(perm[i], r) + 1;
        tree.update(perm[i], dp[perm[i]]);
        res = std::max(res, dp[perm[i]]);
    }

    std::cout << res << '\n';
}

void input()
{
    std::cin >> n >> d;
    for (int i = 1 ; i <= n ; ++i)
    {
        std::cin >> a[i];
    }
}

void fastIOI()
{
    std::ios_base :: sync_with_stdio(0);
    std::cout.tie(nullptr);
    std::cin.tie(nullptr);
}

int main()
{
    fastIOI();
    input();
    solve();

    return 0;
}

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 27228 KB Output is correct
2 Correct 6 ms 27228 KB Output is correct
3 Correct 5 ms 27224 KB Output is correct
4 Correct 5 ms 27228 KB Output is correct
5 Correct 5 ms 27228 KB Output is correct
6 Correct 6 ms 27228 KB Output is correct
7 Correct 5 ms 27228 KB Output is correct
8 Correct 5 ms 27228 KB Output is correct
9 Correct 5 ms 27228 KB Output is correct
10 Correct 5 ms 27228 KB Output is correct
11 Correct 5 ms 27228 KB Output is correct
12 Correct 5 ms 27228 KB Output is correct
13 Correct 5 ms 27228 KB Output is correct
14 Correct 5 ms 27228 KB Output is correct
15 Correct 5 ms 27228 KB Output is correct
16 Correct 5 ms 27228 KB Output is correct
17 Correct 5 ms 27228 KB Output is correct
18 Correct 5 ms 27228 KB Output is correct
19 Correct 5 ms 27228 KB Output is correct
20 Correct 6 ms 27224 KB Output is correct
21 Correct 5 ms 27228 KB Output is correct
22 Correct 5 ms 27224 KB Output is correct
23 Correct 5 ms 27228 KB Output is correct
24 Correct 5 ms 27228 KB Output is correct
25 Correct 5 ms 27480 KB Output is correct
26 Correct 5 ms 27228 KB Output is correct
27 Correct 6 ms 27228 KB Output is correct
28 Correct 6 ms 27228 KB Output is correct
29 Correct 6 ms 27228 KB Output is correct
30 Correct 6 ms 27256 KB Output is correct
31 Correct 6 ms 27228 KB Output is correct
32 Correct 6 ms 27228 KB Output is correct
33 Correct 6 ms 27228 KB Output is correct
34 Correct 6 ms 27228 KB Output is correct
35 Correct 6 ms 27228 KB Output is correct
36 Correct 6 ms 27228 KB Output is correct
37 Correct 6 ms 27480 KB Output is correct
38 Correct 6 ms 27228 KB Output is correct
39 Correct 6 ms 27228 KB Output is correct
40 Correct 6 ms 27228 KB Output is correct
41 Correct 24 ms 27228 KB Output is correct
42 Correct 25 ms 27228 KB Output is correct
43 Correct 26 ms 27224 KB Output is correct
44 Correct 25 ms 27320 KB Output is correct
45 Correct 28 ms 27368 KB Output is correct
46 Correct 31 ms 27224 KB Output is correct
47 Correct 23 ms 27228 KB Output is correct
48 Correct 26 ms 27228 KB Output is correct
49 Correct 28 ms 27224 KB Output is correct
50 Correct 29 ms 27228 KB Output is correct
51 Correct 26 ms 27228 KB Output is correct
52 Correct 25 ms 27228 KB Output is correct
53 Correct 22 ms 27228 KB Output is correct
54 Correct 26 ms 27224 KB Output is correct
55 Correct 30 ms 27316 KB Output is correct
56 Correct 29 ms 27228 KB Output is correct
57 Correct 37 ms 27228 KB Output is correct
58 Correct 29 ms 27224 KB Output is correct
59 Correct 27 ms 27224 KB Output is correct
60 Correct 28 ms 27228 KB Output is correct
61 Correct 28 ms 27224 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1990 ms 29236 KB Output is correct
2 Correct 1591 ms 28976 KB Output is correct
3 Correct 1722 ms 29236 KB Output is correct
4 Correct 1831 ms 29264 KB Output is correct
5 Correct 1597 ms 29236 KB Output is correct
6 Correct 1729 ms 29240 KB Output is correct
7 Correct 1338 ms 29232 KB Output is correct
8 Correct 2004 ms 29232 KB Output is correct
9 Correct 1395 ms 29236 KB Output is correct
10 Correct 1730 ms 29236 KB Output is correct
11 Correct 1584 ms 29268 KB Output is correct
12 Correct 1598 ms 29232 KB Output is correct
13 Correct 1650 ms 29236 KB Output is correct
14 Correct 1855 ms 29232 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1940 ms 29236 KB Output is correct
2 Correct 2209 ms 29236 KB Output is correct
3 Correct 2415 ms 29232 KB Output is correct
4 Correct 2403 ms 29232 KB Output is correct
5 Correct 2232 ms 29232 KB Output is correct
6 Correct 2248 ms 29236 KB Output is correct
7 Correct 1995 ms 29232 KB Output is correct
8 Correct 1940 ms 29236 KB Output is correct
9 Correct 2029 ms 29240 KB Output is correct
10 Correct 2146 ms 29184 KB Output is correct
11 Correct 2296 ms 29236 KB Output is correct
12 Correct 2211 ms 29268 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 27228 KB Output is correct
2 Correct 6 ms 27228 KB Output is correct
3 Correct 5 ms 27224 KB Output is correct
4 Correct 5 ms 27228 KB Output is correct
5 Correct 5 ms 27228 KB Output is correct
6 Correct 6 ms 27228 KB Output is correct
7 Correct 5 ms 27228 KB Output is correct
8 Correct 5 ms 27228 KB Output is correct
9 Correct 5 ms 27228 KB Output is correct
10 Correct 5 ms 27228 KB Output is correct
11 Correct 5 ms 27228 KB Output is correct
12 Correct 5 ms 27228 KB Output is correct
13 Correct 5 ms 27228 KB Output is correct
14 Correct 5 ms 27228 KB Output is correct
15 Correct 5 ms 27228 KB Output is correct
16 Correct 5 ms 27228 KB Output is correct
17 Correct 5 ms 27228 KB Output is correct
18 Correct 5 ms 27228 KB Output is correct
19 Correct 5 ms 27228 KB Output is correct
20 Correct 6 ms 27224 KB Output is correct
21 Correct 5 ms 27228 KB Output is correct
22 Correct 5 ms 27224 KB Output is correct
23 Correct 5 ms 27228 KB Output is correct
24 Correct 5 ms 27228 KB Output is correct
25 Correct 5 ms 27480 KB Output is correct
26 Correct 5 ms 27228 KB Output is correct
27 Correct 6 ms 27228 KB Output is correct
28 Correct 6 ms 27228 KB Output is correct
29 Correct 6 ms 27228 KB Output is correct
30 Correct 6 ms 27256 KB Output is correct
31 Correct 6 ms 27228 KB Output is correct
32 Correct 6 ms 27228 KB Output is correct
33 Correct 6 ms 27228 KB Output is correct
34 Correct 6 ms 27228 KB Output is correct
35 Correct 6 ms 27228 KB Output is correct
36 Correct 6 ms 27228 KB Output is correct
37 Correct 6 ms 27480 KB Output is correct
38 Correct 6 ms 27228 KB Output is correct
39 Correct 6 ms 27228 KB Output is correct
40 Correct 6 ms 27228 KB Output is correct
41 Correct 24 ms 27228 KB Output is correct
42 Correct 25 ms 27228 KB Output is correct
43 Correct 26 ms 27224 KB Output is correct
44 Correct 25 ms 27320 KB Output is correct
45 Correct 28 ms 27368 KB Output is correct
46 Correct 31 ms 27224 KB Output is correct
47 Correct 23 ms 27228 KB Output is correct
48 Correct 26 ms 27228 KB Output is correct
49 Correct 28 ms 27224 KB Output is correct
50 Correct 29 ms 27228 KB Output is correct
51 Correct 26 ms 27228 KB Output is correct
52 Correct 25 ms 27228 KB Output is correct
53 Correct 22 ms 27228 KB Output is correct
54 Correct 26 ms 27224 KB Output is correct
55 Correct 30 ms 27316 KB Output is correct
56 Correct 29 ms 27228 KB Output is correct
57 Correct 37 ms 27228 KB Output is correct
58 Correct 29 ms 27224 KB Output is correct
59 Correct 27 ms 27224 KB Output is correct
60 Correct 28 ms 27228 KB Output is correct
61 Correct 28 ms 27224 KB Output is correct
62 Correct 1990 ms 29236 KB Output is correct
63 Correct 1591 ms 28976 KB Output is correct
64 Correct 1722 ms 29236 KB Output is correct
65 Correct 1831 ms 29264 KB Output is correct
66 Correct 1597 ms 29236 KB Output is correct
67 Correct 1729 ms 29240 KB Output is correct
68 Correct 1338 ms 29232 KB Output is correct
69 Correct 2004 ms 29232 KB Output is correct
70 Correct 1395 ms 29236 KB Output is correct
71 Correct 1730 ms 29236 KB Output is correct
72 Correct 1584 ms 29268 KB Output is correct
73 Correct 1598 ms 29232 KB Output is correct
74 Correct 1650 ms 29236 KB Output is correct
75 Correct 1855 ms 29232 KB Output is correct
76 Correct 1940 ms 29236 KB Output is correct
77 Correct 2209 ms 29236 KB Output is correct
78 Correct 2415 ms 29232 KB Output is correct
79 Correct 2403 ms 29232 KB Output is correct
80 Correct 2232 ms 29232 KB Output is correct
81 Correct 2248 ms 29236 KB Output is correct
82 Correct 1995 ms 29232 KB Output is correct
83 Correct 1940 ms 29236 KB Output is correct
84 Correct 2029 ms 29240 KB Output is correct
85 Correct 2146 ms 29184 KB Output is correct
86 Correct 2296 ms 29236 KB Output is correct
87 Correct 2211 ms 29268 KB Output is correct
88 Correct 1906 ms 30292 KB Output is correct
89 Correct 1856 ms 30352 KB Output is correct
90 Correct 2105 ms 30348 KB Output is correct
91 Correct 2326 ms 30356 KB Output is correct
92 Correct 2108 ms 30548 KB Output is correct
93 Correct 2278 ms 30348 KB Output is correct
94 Correct 2356 ms 30352 KB Output is correct
95 Correct 1730 ms 30224 KB Output is correct
96 Correct 1978 ms 30352 KB Output is correct
97 Correct 2122 ms 30352 KB Output is correct
98 Correct 2224 ms 30356 KB Output is correct
99 Correct 2317 ms 30356 KB Output is correct
100 Correct 2245 ms 30288 KB Output is correct
101 Correct 1431 ms 30352 KB Output is correct
102 Correct 1613 ms 30352 KB Output is correct
103 Correct 1773 ms 30360 KB Output is correct
104 Correct 1929 ms 30348 KB Output is correct
105 Correct 2148 ms 30352 KB Output is correct
106 Correct 2141 ms 30548 KB Output is correct
107 Correct 2183 ms 30352 KB Output is correct
108 Correct 2251 ms 30360 KB Output is correct
109 Correct 1681 ms 30352 KB Output is correct
110 Correct 2219 ms 30352 KB Output is correct
111 Correct 2216 ms 30348 KB Output is correct
112 Correct 2156 ms 30352 KB Output is correct
113 Correct 2347 ms 30352 KB Output is correct
114 Correct 2302 ms 30348 KB Output is correct
115 Correct 2005 ms 30352 KB Output is correct
116 Correct 1941 ms 30356 KB Output is correct
117 Correct 1975 ms 30352 KB Output is correct
118 Correct 1988 ms 30352 KB Output is correct
119 Correct 2150 ms 30348 KB Output is correct
120 Correct 2169 ms 30488 KB Output is correct