oj.uz

Submission #479846

# Submission time Handle Problem Language Result Execution time Memory
479846 2021-10-13T13:48:45 Z alextodoran Financial Report (JOI21_financial) C++17
100 / 100
 430 ms 29668 KB 
/**
 ____ ____ ____ ____ ____
||a |||t |||o |||d |||o ||
||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|

**/

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N_MAX = 300000;

int N, D;

int A[N_MAX + 2];

struct DSUNode
{
    int root;
    int l, r;
};

DSUNode DSU[N_MAX + 2];

void init ()
{
    for(int u = 1; u <= N; u++)
    {
        DSU[u].root = u;
        DSU[u].l = u;
        DSU[u].r = u;
    }
}

int findRoot (int u)
{
    if(DSU[u].root == u)
        return u;
    return DSU[u].root = findRoot(DSU[u].root);
}

void join (int u, int v)
{
    u = findRoot(u);
    v = findRoot(v);
    if(u == v)
        return;
    DSU[v].l = DSU[u].l;
    DSU[u].root = v;
}

bool active[N_MAX + 2];

void activate (int u)
{
    active[u] = true;
    if(active[u - 1] == true)
        join(u - 1, u);
    if(active[u + 1] == true)
        join(u, u + 1);
}

int order[N_MAX + 2];

int leftBound[N_MAX + 2];

int SGT[N_MAX * 4 + 2];

void update (int node, int l, int r, int upos, int uval)
{
    if(l == r)
    {
        SGT[node] = uval;
        return;
    }

    int mid = (l + r) / 2;
    int lSon = node * 2, rSon = node * 2 + 1;

    if(upos <= mid)
        update(lSon, l, mid, upos, uval);
    if(mid + 1 <= upos)
        update(rSon, mid + 1, r, upos, uval);

    SGT[node] = max(SGT[lSon], SGT[rSon]);
}
void update (int upos, int uval)
{
    update(1, 1, N, upos, uval);
}

int query (int node, int l, int r, int ql, int qr)
{
    if(ql <= l && r <= qr)
        return SGT[node];

    int mid = (l + r) / 2;
    int lSon = node * 2, rSon = node * 2 + 1;

    int answer = 0;
    if(ql <= mid)
        answer = max(answer, query(lSon, l, mid, ql, qr));
    if(mid + 1 <= qr)
        answer = max(answer, query(rSon, mid + 1, r, ql, qr));
    return answer;
}
int query (int ql, int qr)
{
    if(ql > qr)
        return 0;
    return query(1, 1, N, ql, qr);
}

int maxRec[N_MAX + 2];

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    cin >> N >> D;
    for(int i = 1; i <= N; i++)
        cin >> A[i];

    for(int k = 1; k <= N; k++)
        order[k] = k;

    {
        sort(order + 1, order + N + 1, [&] (const int &i, const int &j)
             {
                 return make_pair(A[i], i) > make_pair(A[j], j);
             });

        set <int> s;
        init();

        for(int k = 1; k <= N; k++)
        {
            int i = order[k];

            set <int> :: iterator it = s.upper_bound(i);
            if(it == s.begin())
                leftBound[i] = 1;
            else
                leftBound[i] = (*prev(it) - D + 1);

            activate(i);
            int root = findRoot(i);
            if(DSU[root].r - DSU[root].l + 1 >= D)
                s.insert(DSU[root].r);
        }
    }

    {
        sort(order + 1, order + N + 1, [&] (const int &i, const int &j)
             {
                 return make_pair(A[i], N - i) < make_pair(A[j], N - j);
             });

        for(int k = 1; k <= N; k++)
        {
            int i = order[k];
            maxRec[i] = query(leftBound[i], i - 1) + 1;
            update(i, maxRec[i]);
        }

        cout << query(1, N) << "\n";
    }

    return 0;
}

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 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 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 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 6 ms 844 KB Output is correct
42 Correct 6 ms 716 KB Output is correct
43 Correct 4 ms 588 KB Output is correct
44 Correct 4 ms 676 KB Output is correct
45 Correct 4 ms 664 KB Output is correct
46 Correct 6 ms 588 KB Output is correct
47 Correct 4 ms 720 KB Output is correct
48 Correct 5 ms 588 KB Output is correct
49 Correct 5 ms 668 KB Output is correct
50 Correct 4 ms 588 KB Output is correct
51 Correct 5 ms 844 KB Output is correct
52 Correct 5 ms 716 KB Output is correct
53 Correct 3 ms 588 KB Output is correct
54 Correct 4 ms 588 KB Output is correct
55 Correct 4 ms 588 KB Output is correct
56 Correct 4 ms 588 KB Output is correct
57 Correct 5 ms 588 KB Output is correct
58 Correct 3 ms 716 KB Output is correct
59 Correct 3 ms 660 KB Output is correct
60 Correct 3 ms 588 KB Output is correct
61 Correct 4 ms 588 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 154 ms 13592 KB Output is correct
2 Correct 246 ms 21496 KB Output is correct
3 Correct 327 ms 22724 KB Output is correct
4 Correct 392 ms 22720 KB Output is correct
5 Correct 311 ms 20784 KB Output is correct
6 Correct 379 ms 22732 KB Output is correct
7 Correct 141 ms 15684 KB Output is correct
8 Correct 231 ms 29668 KB Output is correct
9 Correct 177 ms 19616 KB Output is correct
10 Correct 187 ms 24516 KB Output is correct
11 Correct 295 ms 22724 KB Output is correct
12 Correct 306 ms 22696 KB Output is correct
13 Correct 245 ms 15708 KB Output is correct
14 Correct 430 ms 29636 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 157 ms 13632 KB Output is correct
2 Correct 228 ms 15712 KB Output is correct
3 Correct 233 ms 15808 KB Output is correct
4 Correct 229 ms 15688 KB Output is correct
5 Correct 213 ms 15684 KB Output is correct
6 Correct 223 ms 15652 KB Output is correct
7 Correct 133 ms 15640 KB Output is correct
8 Correct 134 ms 15704 KB Output is correct
9 Correct 154 ms 15632 KB Output is correct
10 Correct 218 ms 15684 KB Output is correct
11 Correct 219 ms 15704 KB Output is correct
12 Correct 181 ms 15684 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 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 6 ms 844 KB Output is correct
42 Correct 6 ms 716 KB Output is correct
43 Correct 4 ms 588 KB Output is correct
44 Correct 4 ms 676 KB Output is correct
45 Correct 4 ms 664 KB Output is correct
46 Correct 6 ms 588 KB Output is correct
47 Correct 4 ms 720 KB Output is correct
48 Correct 5 ms 588 KB Output is correct
49 Correct 5 ms 668 KB Output is correct
50 Correct 4 ms 588 KB Output is correct
51 Correct 5 ms 844 KB Output is correct
52 Correct 5 ms 716 KB Output is correct
53 Correct 3 ms 588 KB Output is correct
54 Correct 4 ms 588 KB Output is correct
55 Correct 4 ms 588 KB Output is correct
56 Correct 4 ms 588 KB Output is correct
57 Correct 5 ms 588 KB Output is correct
58 Correct 3 ms 716 KB Output is correct
59 Correct 3 ms 660 KB Output is correct
60 Correct 3 ms 588 KB Output is correct
61 Correct 4 ms 588 KB Output is correct
62 Correct 154 ms 13592 KB Output is correct
63 Correct 246 ms 21496 KB Output is correct
64 Correct 327 ms 22724 KB Output is correct
65 Correct 392 ms 22720 KB Output is correct
66 Correct 311 ms 20784 KB Output is correct
67 Correct 379 ms 22732 KB Output is correct
68 Correct 141 ms 15684 KB Output is correct
69 Correct 231 ms 29668 KB Output is correct
70 Correct 177 ms 19616 KB Output is correct
71 Correct 187 ms 24516 KB Output is correct
72 Correct 295 ms 22724 KB Output is correct
73 Correct 306 ms 22696 KB Output is correct
74 Correct 245 ms 15708 KB Output is correct
75 Correct 430 ms 29636 KB Output is correct
76 Correct 157 ms 13632 KB Output is correct
77 Correct 228 ms 15712 KB Output is correct
78 Correct 233 ms 15808 KB Output is correct
79 Correct 229 ms 15688 KB Output is correct
80 Correct 213 ms 15684 KB Output is correct
81 Correct 223 ms 15652 KB Output is correct
82 Correct 133 ms 15640 KB Output is correct
83 Correct 134 ms 15704 KB Output is correct
84 Correct 154 ms 15632 KB Output is correct
85 Correct 218 ms 15684 KB Output is correct
86 Correct 219 ms 15704 KB Output is correct
87 Correct 181 ms 15684 KB Output is correct
88 Correct 367 ms 20312 KB Output is correct
89 Correct 330 ms 19140 KB Output is correct
90 Correct 292 ms 17220 KB Output is correct
91 Correct 229 ms 15888 KB Output is correct
92 Correct 208 ms 15688 KB Output is correct
93 Correct 245 ms 15708 KB Output is correct
94 Correct 221 ms 15620 KB Output is correct
95 Correct 303 ms 19540 KB Output is correct
96 Correct 259 ms 17240 KB Output is correct
97 Correct 239 ms 16072 KB Output is correct
98 Correct 230 ms 15940 KB Output is correct
99 Correct 221 ms 15684 KB Output is correct
100 Correct 227 ms 15812 KB Output is correct
101 Correct 169 ms 18324 KB Output is correct
102 Correct 157 ms 15980 KB Output is correct
103 Correct 162 ms 15712 KB Output is correct
104 Correct 175 ms 15684 KB Output is correct
105 Correct 229 ms 15696 KB Output is correct
106 Correct 204 ms 15940 KB Output is correct
107 Correct 229 ms 15640 KB Output is correct
108 Correct 241 ms 15840 KB Output is correct
109 Correct 204 ms 15684 KB Output is correct
110 Correct 230 ms 15964 KB Output is correct
111 Correct 222 ms 15960 KB Output is correct
112 Correct 184 ms 15728 KB Output is correct
113 Correct 198 ms 15728 KB Output is correct
114 Correct 232 ms 15688 KB Output is correct
115 Correct 140 ms 19652 KB Output is correct
116 Correct 128 ms 19524 KB Output is correct
117 Correct 174 ms 17636 KB Output is correct
118 Correct 176 ms 17640 KB Output is correct
119 Correct 181 ms 15812 KB Output is correct
120 Correct 180 ms 15732 KB Output is correct