oj.uz

Submission #891304

# Submission time Handle Problem Language Result Execution time Memory
891304 2023-12-22T17:25:56 Z lolicon Financial Report (JOI21_financial) C++14
100 / 100
 422 ms 42256 KB 
#include <bits/stdc++.h>
using namespace std;

const int maxn = 3e5 + 5;

struct SGT {
    vector<int> tr;
    vector<multiset<int>> arr;
    SGT(int sz) : tr(sz << 2), arr(sz + 1) {}
    void pull(int x) {
        tr[x] = max(tr[x << 1], tr[(x << 1) | 1]);
    }
    void add(int x, int L, int R, int pos, int val) {
        if(L == R) {
            arr[L].insert(val);
            tr[x] = *arr[L].rbegin();
            return;
        }
        int mid = (L + R) >> 1;
        if(pos <= mid) add(x << 1, L, mid, pos, val);
        else add((x << 1) | 1, mid + 1, R, pos, val);
        pull(x);
    }
    void kill(int x, int L, int R, int pos, int val) {
        if(L == R) {
            arr[L].erase(arr[L].find(val));
            if(!arr[L].empty()) tr[x] = *arr[L].rbegin();
            else tr[x] = 0;
            return;
        }
        int mid = (L + R) >> 1;
        if(pos <= mid) kill(x << 1, L, mid, pos, val);
        else kill((x << 1) | 1, mid + 1, R, pos, val);
        pull(x);
    }
    int ask(int x, int L, int R, int l, int r) {
        if(l > r) return 0;
        if(l <= L && R <= r) {
            return tr[x];
        }
        int ret = 0, mid = (L + R) >> 1;
        if(l <= mid) ret = max(ret, ask(x << 1, L, mid, l, r));
        if(r > mid) ret = max(ret, ask((x << 1) | 1, mid + 1, R, l, r));
        return ret;
    }
};

vector<int> V;
int A[maxn];
int n, D;


void getr(vector<int> &r) {
    set<int> st;
    vector<pair<int, int>> arr;
    vector<int> op(n + 1), ed(n + 1);
    for(int i = 1; i <= n; ++i) {
        arr.emplace_back(A[i], -i);
    }
    sort(begin(arr), end(arr));
    for(int i = 0; i < n; ++i) {
        int pos = -arr[i].second;
        op[pos] = ed[pos] = pos;
        auto it = st.upper_bound(pos);
        if(it != st.end() && op[*it] < pos) {
            r[pos] = *it + D;
            continue;
        }
        it = st.insert(pos).first;
        // printf("insert %d\n", pos);
        auto xx = next(it);
        r[pos] = pos + D;
        if(xx != st.end()) {
            if(*xx - pos <= D) {
                int ll = op[pos];
                int rr = ed[*xx];
                // printf("merge (%d, %d), (%d, %d)\n", op[pos], ed[pos], op[*xx], ed[*xx]);
                ed[ll] = rr;
                op[rr] = ll;
                r[pos] = rr + D;
                if(pos != ll) st.erase(pos);
                if(*xx != rr) st.erase(*xx);
            }
        }
        if(it != st.begin()) {
            xx = prev(it);
            if(pos - *xx <= D) {
                int ll = op[*xx];
                int rr = ed[pos];
                // printf("merge (%d, %d), (%d, %d)\n", op[pos], ed[pos], op[*xx], ed[*xx]);
                ed[ll] = rr;
                op[rr] = ll;
                
                if(pos != rr) st.erase(pos);
                if(*xx != ll) st.erase(*xx);
            }
        }
    }
}

void solve() {
    vector<int> dp(n + 1), r(n + 1);
    // for(int i = 1; i <= n; ++i) {
    //     int lst = i;
    //     for(int j = i; j <= n; ++j) {
    //         if(j - lst > D) break;
    //         if(A[j] <= A[i]) lst = j;
    //     }
    //     r[i] = lst + D;
    // }
    // for(int i = 1; i <= n; ++i) printf("%d%c", r[i], " \n"[i == n]);
    getr(r);
    // for(int i = 1; i <= n; ++i) printf("%d%c", r[i], " \n"[i == n]);
    // O(n^2) dp
    SGT loli(n);
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
    for(int i = 1; i <= n; ++i) {
        // printf("here at %d\n", i);
        while(pq.size() && pq.top().first < i) {
            int pos = pq.top().second;
            loli.kill(1, 1, n, A[pos], dp[pos]);
            pq.pop();
        }
        // printf("ask %d %d\n", 1, A[i] - 1);
        dp[i] = loli.ask(1, 1, n, 1, A[i] - 1) + 1;
        // printf("dp[%d] = %d\n", i, dp[i]);
        loli.add(1, 1, n, A[i], dp[i]);
        pq.emplace(r[i], i);
        // for(int j = 1; j < i; ++j) {
        //     if(r[j] >= i && A[j] < A[i]) 
        //         dp[i] = max(dp[i], dp[j] + 1);
        // }
    }
    cout << *max_element(begin(dp), end(dp)) << '\n';
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> n >> D;
    for(int i = 1; i <= n; ++i) {
        cin >> A[i]; V.push_back(A[i]);
    }
    sort(begin(V), end(V));
    for(int i = 1; i <= n; ++i) {
        A[i] = lower_bound(begin(V), end(V), A[i]) - begin(V) + 1;
    }
    solve();
    return 0;
}

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 424 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 7 ms 1116 KB Output is correct
42 Correct 6 ms 1116 KB Output is correct
43 Correct 4 ms 1116 KB Output is correct
44 Correct 4 ms 1116 KB Output is correct
45 Correct 4 ms 1336 KB Output is correct
46 Correct 4 ms 1324 KB Output is correct
47 Correct 6 ms 860 KB Output is correct
48 Correct 5 ms 1116 KB Output is correct
49 Correct 5 ms 1112 KB Output is correct
50 Correct 5 ms 1072 KB Output is correct
51 Correct 5 ms 860 KB Output is correct
52 Correct 6 ms 1012 KB Output is correct
53 Correct 4 ms 816 KB Output is correct
54 Correct 4 ms 816 KB Output is correct
55 Correct 5 ms 1328 KB Output is correct
56 Correct 4 ms 1328 KB Output is correct
57 Correct 4 ms 1272 KB Output is correct
58 Correct 3 ms 1328 KB Output is correct
59 Correct 3 ms 1324 KB Output is correct
60 Correct 3 ms 1332 KB Output is correct
61 Correct 3 ms 1332 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 136 ms 41784 KB Output is correct
2 Correct 234 ms 29172 KB Output is correct
3 Correct 307 ms 29352 KB Output is correct
4 Correct 422 ms 29372 KB Output is correct
5 Correct 308 ms 27376 KB Output is correct
6 Correct 398 ms 29252 KB Output is correct
7 Correct 149 ms 23708 KB Output is correct
8 Correct 129 ms 41708 KB Output is correct
9 Correct 177 ms 23956 KB Output is correct
10 Correct 176 ms 32036 KB Output is correct
11 Correct 318 ms 24420 KB Output is correct
12 Correct 339 ms 24560 KB Output is correct
13 Correct 256 ms 23824 KB Output is correct
14 Correct 336 ms 24216 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 128 ms 42152 KB Output is correct
2 Correct 219 ms 41704 KB Output is correct
3 Correct 268 ms 40572 KB Output is correct
4 Correct 240 ms 41148 KB Output is correct
5 Correct 211 ms 41800 KB Output is correct
6 Correct 255 ms 41404 KB Output is correct
7 Correct 128 ms 41624 KB Output is correct
8 Correct 133 ms 40532 KB Output is correct
9 Correct 134 ms 41360 KB Output is correct
10 Correct 198 ms 42084 KB Output is correct
11 Correct 255 ms 40904 KB Output is correct
12 Correct 202 ms 42228 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 424 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 7 ms 1116 KB Output is correct
42 Correct 6 ms 1116 KB Output is correct
43 Correct 4 ms 1116 KB Output is correct
44 Correct 4 ms 1116 KB Output is correct
45 Correct 4 ms 1336 KB Output is correct
46 Correct 4 ms 1324 KB Output is correct
47 Correct 6 ms 860 KB Output is correct
48 Correct 5 ms 1116 KB Output is correct
49 Correct 5 ms 1112 KB Output is correct
50 Correct 5 ms 1072 KB Output is correct
51 Correct 5 ms 860 KB Output is correct
52 Correct 6 ms 1012 KB Output is correct
53 Correct 4 ms 816 KB Output is correct
54 Correct 4 ms 816 KB Output is correct
55 Correct 5 ms 1328 KB Output is correct
56 Correct 4 ms 1328 KB Output is correct
57 Correct 4 ms 1272 KB Output is correct
58 Correct 3 ms 1328 KB Output is correct
59 Correct 3 ms 1324 KB Output is correct
60 Correct 3 ms 1332 KB Output is correct
61 Correct 3 ms 1332 KB Output is correct
62 Correct 136 ms 41784 KB Output is correct
63 Correct 234 ms 29172 KB Output is correct
64 Correct 307 ms 29352 KB Output is correct
65 Correct 422 ms 29372 KB Output is correct
66 Correct 308 ms 27376 KB Output is correct
67 Correct 398 ms 29252 KB Output is correct
68 Correct 149 ms 23708 KB Output is correct
69 Correct 129 ms 41708 KB Output is correct
70 Correct 177 ms 23956 KB Output is correct
71 Correct 176 ms 32036 KB Output is correct
72 Correct 318 ms 24420 KB Output is correct
73 Correct 339 ms 24560 KB Output is correct
74 Correct 256 ms 23824 KB Output is correct
75 Correct 336 ms 24216 KB Output is correct
76 Correct 128 ms 42152 KB Output is correct
77 Correct 219 ms 41704 KB Output is correct
78 Correct 268 ms 40572 KB Output is correct
79 Correct 240 ms 41148 KB Output is correct
80 Correct 211 ms 41800 KB Output is correct
81 Correct 255 ms 41404 KB Output is correct
82 Correct 128 ms 41624 KB Output is correct
83 Correct 133 ms 40532 KB Output is correct
84 Correct 134 ms 41360 KB Output is correct
85 Correct 198 ms 42084 KB Output is correct
86 Correct 255 ms 40904 KB Output is correct
87 Correct 202 ms 42228 KB Output is correct
88 Correct 362 ms 27260 KB Output is correct
89 Correct 363 ms 26216 KB Output is correct
90 Correct 309 ms 28260 KB Output is correct
91 Correct 255 ms 42076 KB Output is correct
92 Correct 236 ms 41388 KB Output is correct
93 Correct 279 ms 41196 KB Output is correct
94 Correct 261 ms 41840 KB Output is correct
95 Correct 323 ms 26404 KB Output is correct
96 Correct 305 ms 26636 KB Output is correct
97 Correct 327 ms 29524 KB Output is correct
98 Correct 261 ms 41136 KB Output is correct
99 Correct 249 ms 41864 KB Output is correct
100 Correct 251 ms 41976 KB Output is correct
101 Correct 167 ms 24040 KB Output is correct
102 Correct 179 ms 24068 KB Output is correct
103 Correct 203 ms 23888 KB Output is correct
104 Correct 231 ms 24372 KB Output is correct
105 Correct 256 ms 28944 KB Output is correct
106 Correct 190 ms 42256 KB Output is correct
107 Correct 195 ms 41220 KB Output is correct
108 Correct 222 ms 41824 KB Output is correct
109 Correct 234 ms 23884 KB Output is correct
110 Correct 271 ms 34572 KB Output is correct
111 Correct 266 ms 37864 KB Output is correct
112 Correct 214 ms 37760 KB Output is correct
113 Correct 231 ms 42168 KB Output is correct
114 Correct 228 ms 42168 KB Output is correct
115 Correct 123 ms 41904 KB Output is correct
116 Correct 118 ms 41564 KB Output is correct
117 Correct 194 ms 41952 KB Output is correct
118 Correct 168 ms 41652 KB Output is correct
119 Correct 192 ms 41540 KB Output is correct
120 Correct 217 ms 41040 KB Output is correct