oj.uz

Submission #422680

# Submission time Handle Problem Language Result Execution time Memory
422680 2021-06-10T10:17:03 Z schse Financial Report (JOI21_financial) C++17
100 / 100
 2365 ms 34380 KB 
#include <bits/stdc++.h>
#pragma GCC optimize "O3"
#define INF INT32_MAX
using namespace std;

struct segtreenode
{
    int left, midle, right;
    int b, e;
};

segtreenode operator+(segtreenode const &l, segtreenode const &r)
{
    segtreenode res = {l.left, l.right + r.left, r.right, l.b, r.e};
    if (l.left == l.e - l.b)
        res.left += r.left;
    if (r.right == r.e - r.b)
        res.right += l.right;
    res.midle = max(res.midle, r.midle);
    res.midle = max(res.midle, l.midle);
    res.midle = max(res.midle, res.left);
    res.midle = max(res.midle, res.right);
    return res;
}

struct segtree
{
    vector<segtreenode> tree;
    void initial(int N)
    {
        tree.resize(4 * N + 5);
        init(1, 0, N);
    }
    segtreenode init(int index, int b, int e)
    {
        if (e - b == 1)
            return tree[index] = {1, 1, 1, b, e};
        return tree[index] = init(index * 2, b, (b + e) / 2) +
                             init(index * 2 + 1, (b + e) / 2, e);
    }

    segtreenode upd(int index, int b, int e, int p)
    {
        if (e - b == 1 && b == p)
            return tree[index] = {0, 0, 0, b, e};
        if (p < b || e <= p)
            return tree[index];
        return tree[index] = upd(index << 1, b, (b + e) / 2, p) +
                             upd(index * 2 + 1, (b + e) / 2, e, p);
    }

    segtreenode query(int index, int b, int e, int l, int r)
    {
        if (l <= b && e <= r)
            return tree[index];

        if ((b + e) / 2 <= l)
            return query(index * 2 + 1, (b + e) / 2, e, l, r);
        else if (r <= (e + b) / 2)
            return query(index * 2, b, (b + e) / 2, l, r);
        else
            return query(index * 2, b, (b + e) / 2, l, r) + query(index * 2 + 1, (b + e) / 2, e, l, r);
    }
};

struct maxtree
{
    vector<int> tree;
    void initial(int N)
    {
        tree.resize(4 * N + 5);
    }
    int mx(int index, int b, int e, int l, int r)
    {
        if (l <= b && e <= r)
            return tree[index];
        if (r <= b || e <= l)
            return 0;
        return max(mx(index * 2, b, (e + b) / 2, l, r),
                   mx(index * 2 + 1, (e + b) / 2, e, l, r));
    }

    int upd(int index, int b, int e, int p, int v)
    {
        if (b > p || e <= p)
            return tree[index];
        if (b == e - 1)
            return tree[index] = v;
        upd(index * 2, b, (e + b) / 2, p, v);
        upd(index * 2 + 1, (b + e) / 2, e, p, v);
        return tree[index] = max(tree[index * 2], tree[index * 2 + 1]);
    }
};

int main()
{
    int N, D;
    cin >> N >> D;

    vector<pair<int, int>> arr(N);
    segtree stree;
    maxtree mxtree;
    vector<int> varr(N, 0);

    stree.initial(N);
    mxtree.initial(N);

    vector<int> biggest(N + 2, INF);
    vector<int> lastindex(N + 2, -1);

    for (int i = 0; i < N; i++)
    {
        arr[i] = {0, i};
        cin >> arr[i].first;
    }

    sort(arr.begin(), arr.end(), [](pair<int, int> a, pair<int, int> b)
         { return a.first == b.first ? a.second > b.second : a.first < b.first; });

    for (auto [val, pos] : arr)
    {
        int b = 0, e = pos;
        int nv = 0;
        if (pos != 0)
        {

            auto a = stree.query(1, 0, N, 0, pos);
            if (a.midle >= D)
            {
                while (e - b != 1)
                {
                    if (stree.query(1, 0, N, (b + e) / 2, pos).midle >= D)
                        b = (b + e) / 2;
                    else
                        e = (b + e) / 2;
                }
            }
            nv = mxtree.mx(1, 0, N, b, pos);
        }
        mxtree.upd(1, 0, N, pos, nv + 1);
        stree.upd(1, 0, N, pos);
        varr[pos] = nv + 1;
    }

    cout << mxtree.mx(1, 0, N, 0, N);
}

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 25 ms 972 KB Output is correct
42 Correct 24 ms 1080 KB Output is correct
43 Correct 21 ms 1088 KB Output is correct
44 Correct 14 ms 988 KB Output is correct
45 Correct 10 ms 972 KB Output is correct
46 Correct 11 ms 1100 KB Output is correct
47 Correct 26 ms 1068 KB Output is correct
48 Correct 26 ms 1068 KB Output is correct
49 Correct 20 ms 1080 KB Output is correct
50 Correct 15 ms 1104 KB Output is correct
51 Correct 22 ms 1100 KB Output is correct
52 Correct 23 ms 1100 KB Output is correct
53 Correct 9 ms 1096 KB Output is correct
54 Correct 9 ms 1092 KB Output is correct
55 Correct 10 ms 1100 KB Output is correct
56 Correct 10 ms 1092 KB Output is correct
57 Correct 13 ms 972 KB Output is correct
58 Correct 8 ms 1104 KB Output is correct
59 Correct 8 ms 972 KB Output is correct
60 Correct 9 ms 972 KB Output is correct
61 Correct 9 ms 972 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1455 ms 34332 KB Output is correct
2 Correct 1647 ms 34324 KB Output is correct
3 Correct 2083 ms 34348 KB Output is correct
4 Correct 2286 ms 34336 KB Output is correct
5 Correct 1913 ms 34380 KB Output is correct
6 Correct 2312 ms 34332 KB Output is correct
7 Correct 391 ms 34120 KB Output is correct
8 Correct 1399 ms 34236 KB Output is correct
9 Correct 756 ms 34328 KB Output is correct
10 Correct 1522 ms 34344 KB Output is correct
11 Correct 1851 ms 34244 KB Output is correct
12 Correct 2045 ms 34332 KB Output is correct
13 Correct 2316 ms 34348 KB Output is correct
14 Correct 2346 ms 34332 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 458 ms 34328 KB Output is correct
2 Correct 572 ms 34336 KB Output is correct
3 Correct 619 ms 34328 KB Output is correct
4 Correct 645 ms 34380 KB Output is correct
5 Correct 568 ms 34340 KB Output is correct
6 Correct 684 ms 34344 KB Output is correct
7 Correct 400 ms 34328 KB Output is correct
8 Correct 398 ms 34336 KB Output is correct
9 Correct 402 ms 34124 KB Output is correct
10 Correct 492 ms 34236 KB Output is correct
11 Correct 618 ms 34344 KB Output is correct
12 Correct 518 ms 34252 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 25 ms 972 KB Output is correct
42 Correct 24 ms 1080 KB Output is correct
43 Correct 21 ms 1088 KB Output is correct
44 Correct 14 ms 988 KB Output is correct
45 Correct 10 ms 972 KB Output is correct
46 Correct 11 ms 1100 KB Output is correct
47 Correct 26 ms 1068 KB Output is correct
48 Correct 26 ms 1068 KB Output is correct
49 Correct 20 ms 1080 KB Output is correct
50 Correct 15 ms 1104 KB Output is correct
51 Correct 22 ms 1100 KB Output is correct
52 Correct 23 ms 1100 KB Output is correct
53 Correct 9 ms 1096 KB Output is correct
54 Correct 9 ms 1092 KB Output is correct
55 Correct 10 ms 1100 KB Output is correct
56 Correct 10 ms 1092 KB Output is correct
57 Correct 13 ms 972 KB Output is correct
58 Correct 8 ms 1104 KB Output is correct
59 Correct 8 ms 972 KB Output is correct
60 Correct 9 ms 972 KB Output is correct
61 Correct 9 ms 972 KB Output is correct
62 Correct 1455 ms 34332 KB Output is correct
63 Correct 1647 ms 34324 KB Output is correct
64 Correct 2083 ms 34348 KB Output is correct
65 Correct 2286 ms 34336 KB Output is correct
66 Correct 1913 ms 34380 KB Output is correct
67 Correct 2312 ms 34332 KB Output is correct
68 Correct 391 ms 34120 KB Output is correct
69 Correct 1399 ms 34236 KB Output is correct
70 Correct 756 ms 34328 KB Output is correct
71 Correct 1522 ms 34344 KB Output is correct
72 Correct 1851 ms 34244 KB Output is correct
73 Correct 2045 ms 34332 KB Output is correct
74 Correct 2316 ms 34348 KB Output is correct
75 Correct 2346 ms 34332 KB Output is correct
76 Correct 458 ms 34328 KB Output is correct
77 Correct 572 ms 34336 KB Output is correct
78 Correct 619 ms 34328 KB Output is correct
79 Correct 645 ms 34380 KB Output is correct
80 Correct 568 ms 34340 KB Output is correct
81 Correct 684 ms 34344 KB Output is correct
82 Correct 400 ms 34328 KB Output is correct
83 Correct 398 ms 34336 KB Output is correct
84 Correct 402 ms 34124 KB Output is correct
85 Correct 492 ms 34236 KB Output is correct
86 Correct 618 ms 34344 KB Output is correct
87 Correct 518 ms 34252 KB Output is correct
88 Correct 2334 ms 34336 KB Output is correct
89 Correct 2365 ms 34332 KB Output is correct
90 Correct 2052 ms 34328 KB Output is correct
91 Correct 886 ms 34372 KB Output is correct
92 Correct 561 ms 34332 KB Output is correct
93 Correct 720 ms 34336 KB Output is correct
94 Correct 679 ms 34336 KB Output is correct
95 Correct 2131 ms 34252 KB Output is correct
96 Correct 2099 ms 34252 KB Output is correct
97 Correct 1594 ms 34340 KB Output is correct
98 Correct 840 ms 34336 KB Output is correct
99 Correct 688 ms 34332 KB Output is correct
100 Correct 679 ms 34332 KB Output is correct
101 Correct 666 ms 34332 KB Output is correct
102 Correct 445 ms 34352 KB Output is correct
103 Correct 444 ms 34372 KB Output is correct
104 Correct 506 ms 34332 KB Output is correct
105 Correct 539 ms 34372 KB Output is correct
106 Correct 1897 ms 34336 KB Output is correct
107 Correct 2160 ms 34340 KB Output is correct
108 Correct 1075 ms 34332 KB Output is correct
109 Correct 2037 ms 34336 KB Output is correct
110 Correct 1402 ms 34336 KB Output is correct
111 Correct 917 ms 34336 KB Output is correct
112 Correct 830 ms 34336 KB Output is correct
113 Correct 649 ms 34348 KB Output is correct
114 Correct 687 ms 34328 KB Output is correct
115 Correct 395 ms 34332 KB Output is correct
116 Correct 398 ms 34332 KB Output is correct
117 Correct 484 ms 34336 KB Output is correct
118 Correct 443 ms 34244 KB Output is correct
119 Correct 512 ms 34264 KB Output is correct
120 Correct 528 ms 34296 KB Output is correct