oj.uz

Submission #422677

# Submission time Handle Problem Language Result Execution time Memory
422677 2021-06-10T10:12:54 Z schse Financial Report (JOI21_financial) C++17
100 / 100
 2447 ms 34456 KB 
#include <bits/stdc++.h>
#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 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 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 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 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 1 ms 204 KB Output is correct
23 Correct 1 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 1 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 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 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 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 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 1 ms 204 KB Output is correct
23 Correct 1 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 1 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 204 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 204 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 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 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 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 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 1 ms 204 KB Output is correct
23 Correct 1 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 1 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 204 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 204 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 26 ms 1100 KB Output is correct
42 Correct 26 ms 972 KB Output is correct
43 Correct 22 ms 1088 KB Output is correct
44 Correct 14 ms 988 KB Output is correct
45 Correct 11 ms 1048 KB Output is correct
46 Correct 11 ms 1100 KB Output is correct
47 Correct 28 ms 1056 KB Output is correct
48 Correct 22 ms 1076 KB Output is correct
49 Correct 18 ms 972 KB Output is correct
50 Correct 14 ms 1104 KB Output is correct
51 Correct 24 ms 1096 KB Output is correct
52 Correct 25 ms 972 KB Output is correct
53 Correct 9 ms 972 KB Output is correct
54 Correct 14 ms 1096 KB Output is correct
55 Correct 13 ms 972 KB Output is correct
56 Correct 11 ms 1088 KB Output is correct
57 Correct 14 ms 1100 KB Output is correct
58 Correct 12 ms 1096 KB Output is correct
59 Correct 9 ms 972 KB Output is correct
60 Correct 10 ms 1084 KB Output is correct
61 Correct 10 ms 972 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1603 ms 34332 KB Output is correct
2 Correct 1722 ms 34332 KB Output is correct
3 Correct 2198 ms 34372 KB Output is correct
4 Correct 2443 ms 34340 KB Output is correct
5 Correct 2041 ms 34340 KB Output is correct
6 Correct 2447 ms 34328 KB Output is correct
7 Correct 439 ms 34244 KB Output is correct
8 Correct 1531 ms 34212 KB Output is correct
9 Correct 820 ms 34376 KB Output is correct
10 Correct 1570 ms 34328 KB Output is correct
11 Correct 1910 ms 34456 KB Output is correct
12 Correct 2067 ms 34340 KB Output is correct
13 Correct 2244 ms 34332 KB Output is correct
14 Correct 2402 ms 34336 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 451 ms 34392 KB Output is correct
2 Correct 601 ms 34372 KB Output is correct
3 Correct 660 ms 34324 KB Output is correct
4 Correct 673 ms 34328 KB Output is correct
5 Correct 606 ms 34248 KB Output is correct
6 Correct 654 ms 34332 KB Output is correct
7 Correct 440 ms 34372 KB Output is correct
8 Correct 452 ms 34340 KB Output is correct
9 Correct 453 ms 34120 KB Output is correct
10 Correct 559 ms 34216 KB Output is correct
11 Correct 620 ms 34332 KB Output is correct
12 Correct 579 ms 34340 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 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 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 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 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 1 ms 204 KB Output is correct
23 Correct 1 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 1 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 204 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 204 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 26 ms 1100 KB Output is correct
42 Correct 26 ms 972 KB Output is correct
43 Correct 22 ms 1088 KB Output is correct
44 Correct 14 ms 988 KB Output is correct
45 Correct 11 ms 1048 KB Output is correct
46 Correct 11 ms 1100 KB Output is correct
47 Correct 28 ms 1056 KB Output is correct
48 Correct 22 ms 1076 KB Output is correct
49 Correct 18 ms 972 KB Output is correct
50 Correct 14 ms 1104 KB Output is correct
51 Correct 24 ms 1096 KB Output is correct
52 Correct 25 ms 972 KB Output is correct
53 Correct 9 ms 972 KB Output is correct
54 Correct 14 ms 1096 KB Output is correct
55 Correct 13 ms 972 KB Output is correct
56 Correct 11 ms 1088 KB Output is correct
57 Correct 14 ms 1100 KB Output is correct
58 Correct 12 ms 1096 KB Output is correct
59 Correct 9 ms 972 KB Output is correct
60 Correct 10 ms 1084 KB Output is correct
61 Correct 10 ms 972 KB Output is correct
62 Correct 1603 ms 34332 KB Output is correct
63 Correct 1722 ms 34332 KB Output is correct
64 Correct 2198 ms 34372 KB Output is correct
65 Correct 2443 ms 34340 KB Output is correct
66 Correct 2041 ms 34340 KB Output is correct
67 Correct 2447 ms 34328 KB Output is correct
68 Correct 439 ms 34244 KB Output is correct
69 Correct 1531 ms 34212 KB Output is correct
70 Correct 820 ms 34376 KB Output is correct
71 Correct 1570 ms 34328 KB Output is correct
72 Correct 1910 ms 34456 KB Output is correct
73 Correct 2067 ms 34340 KB Output is correct
74 Correct 2244 ms 34332 KB Output is correct
75 Correct 2402 ms 34336 KB Output is correct
76 Correct 451 ms 34392 KB Output is correct
77 Correct 601 ms 34372 KB Output is correct
78 Correct 660 ms 34324 KB Output is correct
79 Correct 673 ms 34328 KB Output is correct
80 Correct 606 ms 34248 KB Output is correct
81 Correct 654 ms 34332 KB Output is correct
82 Correct 440 ms 34372 KB Output is correct
83 Correct 452 ms 34340 KB Output is correct
84 Correct 453 ms 34120 KB Output is correct
85 Correct 559 ms 34216 KB Output is correct
86 Correct 620 ms 34332 KB Output is correct
87 Correct 579 ms 34340 KB Output is correct
88 Correct 2365 ms 34344 KB Output is correct
89 Correct 2443 ms 34332 KB Output is correct
90 Correct 2089 ms 34332 KB Output is correct
91 Correct 894 ms 34344 KB Output is correct
92 Correct 626 ms 34348 KB Output is correct
93 Correct 677 ms 34340 KB Output is correct
94 Correct 685 ms 34336 KB Output is correct
95 Correct 2276 ms 34336 KB Output is correct
96 Correct 2253 ms 34332 KB Output is correct
97 Correct 1568 ms 34332 KB Output is correct
98 Correct 896 ms 34332 KB Output is correct
99 Correct 702 ms 34336 KB Output is correct
100 Correct 695 ms 34372 KB Output is correct
101 Correct 731 ms 34252 KB Output is correct
102 Correct 496 ms 34336 KB Output is correct
103 Correct 502 ms 34380 KB Output is correct
104 Correct 522 ms 34336 KB Output is correct
105 Correct 563 ms 34336 KB Output is correct
106 Correct 1980 ms 34332 KB Output is correct
107 Correct 2131 ms 34336 KB Output is correct
108 Correct 1134 ms 34332 KB Output is correct
109 Correct 2105 ms 34332 KB Output is correct
110 Correct 1272 ms 34336 KB Output is correct
111 Correct 911 ms 34372 KB Output is correct
112 Correct 784 ms 34332 KB Output is correct
113 Correct 620 ms 34340 KB Output is correct
114 Correct 647 ms 34376 KB Output is correct
115 Correct 459 ms 34372 KB Output is correct
116 Correct 449 ms 34328 KB Output is correct
117 Correct 488 ms 34348 KB Output is correct
118 Correct 477 ms 34332 KB Output is correct
119 Correct 565 ms 34424 KB Output is correct
120 Correct 556 ms 34372 KB Output is correct