oj.uz

Submission #661612

# Submission time Handle Problem Language Result Execution time Memory
661612 2022-11-26T03:15:44 Z LittleCube Financial Report (JOI21_financial) C++14
100 / 100
 1703 ms 30964 KB 
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define F first
#define S second
using namespace std;

struct mxSum
{
    int l = 0, m = 0, r = 0, len = 0;
};

mxSum merge(mxSum L, mxSum R)
{
    return mxSum{L.l == L.len ? L.l + R.l : L.l, max({L.m, R.m, L.r + R.l}), R.r == R.len ? R.r + L.r : R.r, L.len + R.len};
}

int N, D, A[300005], dp[300005];

struct mxSumSeg
{
    mxSum seg[1200005];
    bool lazy[1200005];

    void modify(int pos, bool val, int i = 1, int L = 1, int R = N)
    {
        if (L == R)
            seg[i] = (val ? mxSum{1, 1, 1, 1} : mxSum{0, 0, 0, 1});
        else
        {
            int mid = (L + R) / 2;
            if (pos <= mid)
                modify(pos, val, i << 1, L, mid);
            else
                modify(pos, val, i << 1 | 1, mid + 1, R);
            seg[i] = merge(seg[i << 1], seg[i << 1 | 1]);
        }
    }


    void hide(int mL, int mR, int i = 1, int L = 1, int R = N)
    {
        if (mL <= L && R <= mR)
            lazy[i] ^= 1;
        else if (R < mL || mR < L)
            return;
        else
        {
            int mid = (L + R) / 2;
            hide(mL, mR, i << 1, L, mid);
            hide(mL, mR, i << 1 | 1, mid + 1, R);
            seg[i] = merge(lazy[i << 1] ? mxSum{0, 0, 0, 0} : seg[i << 1], lazy[i << 1 | 1] ? mxSum{0, 0, 0, 0} : seg[i << 1 | 1]);
        }
    }

    mxSum query(int qL, int qR, int i = 1, int L = 1, int R = N)
    {
        if (lazy[i] || R < qL || qR < L)
            return mxSum{0, 0, 0, 0};
        else if (qL <= L && R <= qR)
            return seg[i];
        else
        {
            int mid = (L + R) / 2;
            return merge(query(qL, qR, i << 1, L, mid),
                         query(qL, qR, i << 1 | 1, mid + 1, R));
        }
    }
} sumSeg;

struct mxSeg
{
    int seg[1200005];

    void modify(int pos, int val, int i = 1, int L = 1, int R = N)
    {
        if (L == R)
            seg[i] = val;
        else
        {
            int mid = (L + R) / 2;
            if (pos <= mid)
                modify(pos, val, i << 1, L, mid);
            else
                modify(pos, val, i << 1 | 1, mid + 1, R);
            seg[i] = max(seg[i << 1], seg[i << 1 | 1]);
        }
    }

    int query(int qL, int qR, int i = 1, int L = 1, int R = N)
    {
        if (R < qL || qR < L)
            return 0;
        else if (qL <= L && R <= qR)
            return seg[i];
        else
        {
            int mid = (L + R) / 2;
            return max(query(qL, qR, i << 1, L, mid),
                       query(qL, qR, i << 1 | 1, mid + 1, R));
        }
    }
} maxSeg;

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    cin >> N >> D;
    for (int i = 1; i <= N; i++)
        cin >> A[i];
    vector<int> v;
    for (int i = 1; i <= N; i++)
        v.emplace_back(i);
    sort(v.begin(), v.end(), [&](int i, int j)
         { return pii(A[i], -i) < pii(A[j], -j); });

    for (int i = 1; i <= N; i++)
        sumSeg.modify(i, 1);

    for (int i : v)
    {
        int L = 1, R = i - 1;
        sumSeg.hide(i, N);
        while(L < R)
        {
            int mid = (L + R) / 2;
            if(sumSeg.query(mid + 1, N).m >= D)
                L = mid + 1;
            else
                R = mid;
        }
        sumSeg.hide(i, N);
        dp[i] = maxSeg.query(L, i - 1) + 1;
        maxSeg.modify(i, dp[i]);
        sumSeg.modify(i, 0);
    }
    cout << maxSeg.query(1, N) << '\n';
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 19028 KB Output is correct
2 Correct 10 ms 19096 KB Output is correct
3 Correct 8 ms 19028 KB Output is correct
4 Correct 8 ms 19028 KB Output is correct
5 Correct 8 ms 19028 KB Output is correct
6 Correct 8 ms 19028 KB Output is correct
7 Correct 9 ms 19120 KB Output is correct
8 Correct 8 ms 19028 KB Output is correct
9 Correct 10 ms 19028 KB Output is correct
10 Correct 8 ms 19096 KB Output is correct
11 Correct 8 ms 19028 KB Output is correct
12 Correct 9 ms 19084 KB Output is correct
13 Correct 8 ms 19028 KB Output is correct
14 Correct 8 ms 19120 KB Output is correct
15 Correct 8 ms 19120 KB Output is correct
16 Correct 8 ms 19080 KB Output is correct
17 Correct 9 ms 19028 KB Output is correct
18 Correct 8 ms 19028 KB Output is correct
19 Correct 8 ms 19028 KB Output is correct
20 Correct 9 ms 19028 KB Output is correct
21 Correct 8 ms 19116 KB Output is correct
22 Correct 9 ms 19028 KB Output is correct
23 Correct 9 ms 19108 KB Output is correct
24 Correct 10 ms 19028 KB Output is correct
25 Correct 9 ms 19128 KB Output is correct
26 Correct 8 ms 19124 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 19028 KB Output is correct
2 Correct 10 ms 19096 KB Output is correct
3 Correct 8 ms 19028 KB Output is correct
4 Correct 8 ms 19028 KB Output is correct
5 Correct 8 ms 19028 KB Output is correct
6 Correct 8 ms 19028 KB Output is correct
7 Correct 9 ms 19120 KB Output is correct
8 Correct 8 ms 19028 KB Output is correct
9 Correct 10 ms 19028 KB Output is correct
10 Correct 8 ms 19096 KB Output is correct
11 Correct 8 ms 19028 KB Output is correct
12 Correct 9 ms 19084 KB Output is correct
13 Correct 8 ms 19028 KB Output is correct
14 Correct 8 ms 19120 KB Output is correct
15 Correct 8 ms 19120 KB Output is correct
16 Correct 8 ms 19080 KB Output is correct
17 Correct 9 ms 19028 KB Output is correct
18 Correct 8 ms 19028 KB Output is correct
19 Correct 8 ms 19028 KB Output is correct
20 Correct 9 ms 19028 KB Output is correct
21 Correct 8 ms 19116 KB Output is correct
22 Correct 9 ms 19028 KB Output is correct
23 Correct 9 ms 19108 KB Output is correct
24 Correct 10 ms 19028 KB Output is correct
25 Correct 9 ms 19128 KB Output is correct
26 Correct 8 ms 19124 KB Output is correct
27 Correct 9 ms 19156 KB Output is correct
28 Correct 8 ms 19112 KB Output is correct
29 Correct 9 ms 19156 KB Output is correct
30 Correct 9 ms 19156 KB Output is correct
31 Correct 8 ms 19156 KB Output is correct
32 Correct 8 ms 19100 KB Output is correct
33 Correct 10 ms 19156 KB Output is correct
34 Correct 9 ms 19124 KB Output is correct
35 Correct 9 ms 19124 KB Output is correct
36 Correct 10 ms 19120 KB Output is correct
37 Correct 10 ms 19156 KB Output is correct
38 Correct 9 ms 19124 KB Output is correct
39 Correct 9 ms 19156 KB Output is correct
40 Correct 8 ms 19156 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 19028 KB Output is correct
2 Correct 10 ms 19096 KB Output is correct
3 Correct 8 ms 19028 KB Output is correct
4 Correct 8 ms 19028 KB Output is correct
5 Correct 8 ms 19028 KB Output is correct
6 Correct 8 ms 19028 KB Output is correct
7 Correct 9 ms 19120 KB Output is correct
8 Correct 8 ms 19028 KB Output is correct
9 Correct 10 ms 19028 KB Output is correct
10 Correct 8 ms 19096 KB Output is correct
11 Correct 8 ms 19028 KB Output is correct
12 Correct 9 ms 19084 KB Output is correct
13 Correct 8 ms 19028 KB Output is correct
14 Correct 8 ms 19120 KB Output is correct
15 Correct 8 ms 19120 KB Output is correct
16 Correct 8 ms 19080 KB Output is correct
17 Correct 9 ms 19028 KB Output is correct
18 Correct 8 ms 19028 KB Output is correct
19 Correct 8 ms 19028 KB Output is correct
20 Correct 9 ms 19028 KB Output is correct
21 Correct 8 ms 19116 KB Output is correct
22 Correct 9 ms 19028 KB Output is correct
23 Correct 9 ms 19108 KB Output is correct
24 Correct 10 ms 19028 KB Output is correct
25 Correct 9 ms 19128 KB Output is correct
26 Correct 8 ms 19124 KB Output is correct
27 Correct 9 ms 19156 KB Output is correct
28 Correct 8 ms 19112 KB Output is correct
29 Correct 9 ms 19156 KB Output is correct
30 Correct 9 ms 19156 KB Output is correct
31 Correct 8 ms 19156 KB Output is correct
32 Correct 8 ms 19100 KB Output is correct
33 Correct 10 ms 19156 KB Output is correct
34 Correct 9 ms 19124 KB Output is correct
35 Correct 9 ms 19124 KB Output is correct
36 Correct 10 ms 19120 KB Output is correct
37 Correct 10 ms 19156 KB Output is correct
38 Correct 9 ms 19124 KB Output is correct
39 Correct 9 ms 19156 KB Output is correct
40 Correct 8 ms 19156 KB Output is correct
41 Correct 25 ms 19380 KB Output is correct
42 Correct 26 ms 19412 KB Output is correct
43 Correct 24 ms 19392 KB Output is correct
44 Correct 23 ms 19284 KB Output is correct
45 Correct 24 ms 19392 KB Output is correct
46 Correct 29 ms 19332 KB Output is correct
47 Correct 23 ms 19284 KB Output is correct
48 Correct 25 ms 19388 KB Output is correct
49 Correct 25 ms 19384 KB Output is correct
50 Correct 27 ms 19516 KB Output is correct
51 Correct 26 ms 19284 KB Output is correct
52 Correct 25 ms 19392 KB Output is correct
53 Correct 23 ms 19380 KB Output is correct
54 Correct 23 ms 19284 KB Output is correct
55 Correct 25 ms 19284 KB Output is correct
56 Correct 25 ms 19284 KB Output is correct
57 Correct 24 ms 19284 KB Output is correct
58 Correct 22 ms 19312 KB Output is correct
59 Correct 22 ms 19320 KB Output is correct
60 Correct 23 ms 19412 KB Output is correct
61 Correct 23 ms 19384 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1125 ms 28016 KB Output is correct
2 Correct 1263 ms 28644 KB Output is correct
3 Correct 1603 ms 30792 KB Output is correct
4 Correct 1650 ms 30780 KB Output is correct
5 Correct 1437 ms 30764 KB Output is correct
6 Correct 1703 ms 30784 KB Output is correct
7 Correct 1126 ms 30788 KB Output is correct
8 Correct 1099 ms 30824 KB Output is correct
9 Correct 1146 ms 30888 KB Output is correct
10 Correct 1107 ms 30872 KB Output is correct
11 Correct 1301 ms 30864 KB Output is correct
12 Correct 1483 ms 30912 KB Output is correct
13 Correct 1527 ms 30864 KB Output is correct
14 Correct 1645 ms 30772 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1143 ms 28140 KB Output is correct
2 Correct 1324 ms 30636 KB Output is correct
3 Correct 1409 ms 30780 KB Output is correct
4 Correct 1447 ms 30768 KB Output is correct
5 Correct 1356 ms 30760 KB Output is correct
6 Correct 1497 ms 30964 KB Output is correct
7 Correct 1132 ms 30912 KB Output is correct
8 Correct 1152 ms 30828 KB Output is correct
9 Correct 1165 ms 30852 KB Output is correct
10 Correct 1258 ms 30852 KB Output is correct
11 Correct 1401 ms 30784 KB Output is correct
12 Correct 1311 ms 30936 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 19028 KB Output is correct
2 Correct 10 ms 19096 KB Output is correct
3 Correct 8 ms 19028 KB Output is correct
4 Correct 8 ms 19028 KB Output is correct
5 Correct 8 ms 19028 KB Output is correct
6 Correct 8 ms 19028 KB Output is correct
7 Correct 9 ms 19120 KB Output is correct
8 Correct 8 ms 19028 KB Output is correct
9 Correct 10 ms 19028 KB Output is correct
10 Correct 8 ms 19096 KB Output is correct
11 Correct 8 ms 19028 KB Output is correct
12 Correct 9 ms 19084 KB Output is correct
13 Correct 8 ms 19028 KB Output is correct
14 Correct 8 ms 19120 KB Output is correct
15 Correct 8 ms 19120 KB Output is correct
16 Correct 8 ms 19080 KB Output is correct
17 Correct 9 ms 19028 KB Output is correct
18 Correct 8 ms 19028 KB Output is correct
19 Correct 8 ms 19028 KB Output is correct
20 Correct 9 ms 19028 KB Output is correct
21 Correct 8 ms 19116 KB Output is correct
22 Correct 9 ms 19028 KB Output is correct
23 Correct 9 ms 19108 KB Output is correct
24 Correct 10 ms 19028 KB Output is correct
25 Correct 9 ms 19128 KB Output is correct
26 Correct 8 ms 19124 KB Output is correct
27 Correct 9 ms 19156 KB Output is correct
28 Correct 8 ms 19112 KB Output is correct
29 Correct 9 ms 19156 KB Output is correct
30 Correct 9 ms 19156 KB Output is correct
31 Correct 8 ms 19156 KB Output is correct
32 Correct 8 ms 19100 KB Output is correct
33 Correct 10 ms 19156 KB Output is correct
34 Correct 9 ms 19124 KB Output is correct
35 Correct 9 ms 19124 KB Output is correct
36 Correct 10 ms 19120 KB Output is correct
37 Correct 10 ms 19156 KB Output is correct
38 Correct 9 ms 19124 KB Output is correct
39 Correct 9 ms 19156 KB Output is correct
40 Correct 8 ms 19156 KB Output is correct
41 Correct 25 ms 19380 KB Output is correct
42 Correct 26 ms 19412 KB Output is correct
43 Correct 24 ms 19392 KB Output is correct
44 Correct 23 ms 19284 KB Output is correct
45 Correct 24 ms 19392 KB Output is correct
46 Correct 29 ms 19332 KB Output is correct
47 Correct 23 ms 19284 KB Output is correct
48 Correct 25 ms 19388 KB Output is correct
49 Correct 25 ms 19384 KB Output is correct
50 Correct 27 ms 19516 KB Output is correct
51 Correct 26 ms 19284 KB Output is correct
52 Correct 25 ms 19392 KB Output is correct
53 Correct 23 ms 19380 KB Output is correct
54 Correct 23 ms 19284 KB Output is correct
55 Correct 25 ms 19284 KB Output is correct
56 Correct 25 ms 19284 KB Output is correct
57 Correct 24 ms 19284 KB Output is correct
58 Correct 22 ms 19312 KB Output is correct
59 Correct 22 ms 19320 KB Output is correct
60 Correct 23 ms 19412 KB Output is correct
61 Correct 23 ms 19384 KB Output is correct
62 Correct 1125 ms 28016 KB Output is correct
63 Correct 1263 ms 28644 KB Output is correct
64 Correct 1603 ms 30792 KB Output is correct
65 Correct 1650 ms 30780 KB Output is correct
66 Correct 1437 ms 30764 KB Output is correct
67 Correct 1703 ms 30784 KB Output is correct
68 Correct 1126 ms 30788 KB Output is correct
69 Correct 1099 ms 30824 KB Output is correct
70 Correct 1146 ms 30888 KB Output is correct
71 Correct 1107 ms 30872 KB Output is correct
72 Correct 1301 ms 30864 KB Output is correct
73 Correct 1483 ms 30912 KB Output is correct
74 Correct 1527 ms 30864 KB Output is correct
75 Correct 1645 ms 30772 KB Output is correct
76 Correct 1143 ms 28140 KB Output is correct
77 Correct 1324 ms 30636 KB Output is correct
78 Correct 1409 ms 30780 KB Output is correct
79 Correct 1447 ms 30768 KB Output is correct
80 Correct 1356 ms 30760 KB Output is correct
81 Correct 1497 ms 30964 KB Output is correct
82 Correct 1132 ms 30912 KB Output is correct
83 Correct 1152 ms 30828 KB Output is correct
84 Correct 1165 ms 30852 KB Output is correct
85 Correct 1258 ms 30852 KB Output is correct
86 Correct 1401 ms 30784 KB Output is correct
87 Correct 1311 ms 30936 KB Output is correct
88 Correct 1633 ms 30792 KB Output is correct
89 Correct 1654 ms 30796 KB Output is correct
90 Correct 1588 ms 30792 KB Output is correct
91 Correct 1448 ms 30784 KB Output is correct
92 Correct 1317 ms 30772 KB Output is correct
93 Correct 1467 ms 30788 KB Output is correct
94 Correct 1425 ms 30764 KB Output is correct
95 Correct 1512 ms 30772 KB Output is correct
96 Correct 1525 ms 30792 KB Output is correct
97 Correct 1536 ms 30676 KB Output is correct
98 Correct 1470 ms 30788 KB Output is correct
99 Correct 1424 ms 30732 KB Output is correct
100 Correct 1445 ms 30772 KB Output is correct
101 Correct 1147 ms 30692 KB Output is correct
102 Correct 1166 ms 30792 KB Output is correct
103 Correct 1194 ms 30756 KB Output is correct
104 Correct 1232 ms 30752 KB Output is correct
105 Correct 1344 ms 30848 KB Output is correct
106 Correct 1275 ms 30780 KB Output is correct
107 Correct 1339 ms 30856 KB Output is correct
108 Correct 1417 ms 30828 KB Output is correct
109 Correct 1315 ms 30784 KB Output is correct
110 Correct 1557 ms 30784 KB Output is correct
111 Correct 1475 ms 30676 KB Output is correct
112 Correct 1256 ms 30896 KB Output is correct
113 Correct 1398 ms 30776 KB Output is correct
114 Correct 1404 ms 30784 KB Output is correct
115 Correct 1137 ms 30680 KB Output is correct
116 Correct 1135 ms 30840 KB Output is correct
117 Correct 1179 ms 30792 KB Output is correct
118 Correct 1184 ms 30776 KB Output is correct
119 Correct 1292 ms 30804 KB Output is correct
120 Correct 1283 ms 30780 KB Output is correct