oj.uz

Submission #906107

# Submission time Handle Problem Language Result Execution time Memory
906107 2024-01-13T14:03:11 Z hmm789 Financial Report (JOI21_financial) C++14
100 / 100
 746 ms 106832 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF 1000000000000000000
#define MOD 998244353

struct node1 {
    int s, e, m, v;
    node1 *l, *r;
    node1(int _s, int _e) {
        s = _s, e = _e, m = (s+e)/2, v = -INF;
        if(s != e) {
            l = new node1(s, m);
            r = new node1(m+1, e);
        }
    }
    void update(int x, int val) {
        if(s == e) {v = val; return;}
        else if(x > m) r->update(x, val);
        else l->update(x, val);
        v = max(l->v, r->v);
    }
    int query(int x) {
        if(s == e) return s;
        if(l->v > x) return l->query(x);
        else if(r->v > x) return r->query(x);
        else return e;
    }
} *root1;

struct node2 {
    int s, e, m, v, lz;
    node2 *l, *r;
    node2(int _s, int _e) {
        s = _s, e = _e, m = (s+e)/2, v = 1, lz = -1;
        if(s != e) {
            l = new node2(s, m);
            r = new node2(m+1, e);
        }
    }
    void prop() {
        if(lz == -1) return;
        v = max(v, lz);
        if(s != e) {
            l->lz = max(l->lz, lz);
            r->lz = max(r->lz, lz);
        }
        lz = -1;
    }
    void update(int x, int y, int val) {
        prop();
        if(x <= s && e <= y) {lz = max(lz, val); return;}
        else if(x > m) r->update(x, y, val);
        else if(y <= m) l->update(x, y, val);
        else l->update(x, y, val), r->update(x, y, val);
        l->prop(); r->prop();
        v = max(l->v, r->v);
    }
    int query(int x) {
        prop();
        if(s == e) return v;
        else if(x > m) return r->query(x);
        else return l->query(x);
    }
} *root2;

bool cmp(pair<int, int> a, pair<int, int> b) {
    if(a.first != b.first) return a.first < b.first;
    else return a.second > b.second;
}

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int n, d, ans = 0;
    cin >> n >> d;
    int a[n], r[n], tr[n], dp[n];
    for(int i = 0; i < n; i++) cin >> a[i];
    multiset<int> s;
    root1 = new node1(0, n-1);
    for(int i = 0; i < n; i++) {
        s.insert(a[i]);
        if(i >= d) s.erase(s.find(a[i-d]));
        tr[i] = *s.begin();
    }
    for(int i = n-1; i >= 0; i--) {
        if(i+d < n) root1->update(i+d, tr[i+d]);
        r[i] = root1->query(a[i]);
    }
    pair<int, int> ord[n];
    for(int i = 0; i < n; i++) {
        ord[i] = {a[i], i};
    }
    sort(ord, ord+n, cmp);
    root2 = new node2(0, n-1);
    for(int i = 0; i < n; i++) {
        int idx = ord[i].second;
        dp[idx] = root2->query(idx);
        root2->update(idx, r[idx], dp[idx]+1);
        ans = max(ans, dp[idx]);
    }
    cout << ans;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 456 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 504 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 452 KB Output is correct
22 Correct 0 ms 456 KB Output is correct
23 Correct 0 ms 456 KB Output is correct
24 Correct 1 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 1 ms 348 KB Output is correct
2 Correct 0 ms 456 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 504 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 452 KB Output is correct
22 Correct 0 ms 456 KB Output is correct
23 Correct 0 ms 456 KB Output is correct
24 Correct 1 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 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 532 KB Output is correct
37 Correct 1 ms 460 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 344 KB Output is correct
40 Correct 1 ms 344 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 456 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 504 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 452 KB Output is correct
22 Correct 0 ms 456 KB Output is correct
23 Correct 0 ms 456 KB Output is correct
24 Correct 1 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 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 532 KB Output is correct
37 Correct 1 ms 460 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 344 KB Output is correct
40 Correct 1 ms 344 KB Output is correct
41 Correct 6 ms 2396 KB Output is correct
42 Correct 6 ms 2396 KB Output is correct
43 Correct 5 ms 2396 KB Output is correct
44 Correct 6 ms 2136 KB Output is correct
45 Correct 6 ms 2396 KB Output is correct
46 Correct 6 ms 2852 KB Output is correct
47 Correct 5 ms 2396 KB Output is correct
48 Correct 6 ms 2392 KB Output is correct
49 Correct 7 ms 2396 KB Output is correct
50 Correct 7 ms 2396 KB Output is correct
51 Correct 5 ms 2396 KB Output is correct
52 Correct 6 ms 2528 KB Output is correct
53 Correct 6 ms 2508 KB Output is correct
54 Correct 6 ms 2392 KB Output is correct
55 Correct 6 ms 2396 KB Output is correct
56 Correct 6 ms 2648 KB Output is correct
57 Correct 6 ms 2396 KB Output is correct
58 Correct 5 ms 2908 KB Output is correct
59 Correct 5 ms 2908 KB Output is correct
60 Correct 5 ms 2396 KB Output is correct
61 Correct 5 ms 2396 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 216 ms 92500 KB Output is correct
2 Correct 413 ms 92408 KB Output is correct
3 Correct 475 ms 92500 KB Output is correct
4 Correct 490 ms 92360 KB Output is correct
5 Correct 379 ms 92492 KB Output is correct
6 Correct 451 ms 92584 KB Output is correct
7 Correct 227 ms 91984 KB Output is correct
8 Correct 214 ms 92244 KB Output is correct
9 Correct 217 ms 92500 KB Output is correct
10 Correct 259 ms 92368 KB Output is correct
11 Correct 294 ms 92568 KB Output is correct
12 Correct 297 ms 92748 KB Output is correct
13 Correct 262 ms 92360 KB Output is correct
14 Correct 501 ms 92752 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 221 ms 106832 KB Output is correct
2 Correct 514 ms 106616 KB Output is correct
3 Correct 576 ms 106456 KB Output is correct
4 Correct 585 ms 106568 KB Output is correct
5 Correct 458 ms 106576 KB Output is correct
6 Correct 637 ms 106716 KB Output is correct
7 Correct 225 ms 106576 KB Output is correct
8 Correct 236 ms 106684 KB Output is correct
9 Correct 223 ms 105884 KB Output is correct
10 Correct 335 ms 106064 KB Output is correct
11 Correct 412 ms 106576 KB Output is correct
12 Correct 349 ms 106656 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 456 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 504 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 452 KB Output is correct
22 Correct 0 ms 456 KB Output is correct
23 Correct 0 ms 456 KB Output is correct
24 Correct 1 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 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 532 KB Output is correct
37 Correct 1 ms 460 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 344 KB Output is correct
40 Correct 1 ms 344 KB Output is correct
41 Correct 6 ms 2396 KB Output is correct
42 Correct 6 ms 2396 KB Output is correct
43 Correct 5 ms 2396 KB Output is correct
44 Correct 6 ms 2136 KB Output is correct
45 Correct 6 ms 2396 KB Output is correct
46 Correct 6 ms 2852 KB Output is correct
47 Correct 5 ms 2396 KB Output is correct
48 Correct 6 ms 2392 KB Output is correct
49 Correct 7 ms 2396 KB Output is correct
50 Correct 7 ms 2396 KB Output is correct
51 Correct 5 ms 2396 KB Output is correct
52 Correct 6 ms 2528 KB Output is correct
53 Correct 6 ms 2508 KB Output is correct
54 Correct 6 ms 2392 KB Output is correct
55 Correct 6 ms 2396 KB Output is correct
56 Correct 6 ms 2648 KB Output is correct
57 Correct 6 ms 2396 KB Output is correct
58 Correct 5 ms 2908 KB Output is correct
59 Correct 5 ms 2908 KB Output is correct
60 Correct 5 ms 2396 KB Output is correct
61 Correct 5 ms 2396 KB Output is correct
62 Correct 216 ms 92500 KB Output is correct
63 Correct 413 ms 92408 KB Output is correct
64 Correct 475 ms 92500 KB Output is correct
65 Correct 490 ms 92360 KB Output is correct
66 Correct 379 ms 92492 KB Output is correct
67 Correct 451 ms 92584 KB Output is correct
68 Correct 227 ms 91984 KB Output is correct
69 Correct 214 ms 92244 KB Output is correct
70 Correct 217 ms 92500 KB Output is correct
71 Correct 259 ms 92368 KB Output is correct
72 Correct 294 ms 92568 KB Output is correct
73 Correct 297 ms 92748 KB Output is correct
74 Correct 262 ms 92360 KB Output is correct
75 Correct 501 ms 92752 KB Output is correct
76 Correct 221 ms 106832 KB Output is correct
77 Correct 514 ms 106616 KB Output is correct
78 Correct 576 ms 106456 KB Output is correct
79 Correct 585 ms 106568 KB Output is correct
80 Correct 458 ms 106576 KB Output is correct
81 Correct 637 ms 106716 KB Output is correct
82 Correct 225 ms 106576 KB Output is correct
83 Correct 236 ms 106684 KB Output is correct
84 Correct 223 ms 105884 KB Output is correct
85 Correct 335 ms 106064 KB Output is correct
86 Correct 412 ms 106576 KB Output is correct
87 Correct 349 ms 106656 KB Output is correct
88 Correct 614 ms 92560 KB Output is correct
89 Correct 597 ms 92344 KB Output is correct
90 Correct 633 ms 92560 KB Output is correct
91 Correct 646 ms 92572 KB Output is correct
92 Correct 539 ms 92500 KB Output is correct
93 Correct 622 ms 93016 KB Output is correct
94 Correct 746 ms 102424 KB Output is correct
95 Correct 522 ms 92564 KB Output is correct
96 Correct 601 ms 92564 KB Output is correct
97 Correct 610 ms 92496 KB Output is correct
98 Correct 583 ms 92500 KB Output is correct
99 Correct 604 ms 92484 KB Output is correct
100 Correct 628 ms 92604 KB Output is correct
101 Correct 222 ms 92500 KB Output is correct
102 Correct 284 ms 92544 KB Output is correct
103 Correct 313 ms 92568 KB Output is correct
104 Correct 362 ms 92496 KB Output is correct
105 Correct 410 ms 93508 KB Output is correct
106 Correct 308 ms 92568 KB Output is correct
107 Correct 315 ms 92596 KB Output is correct
108 Correct 523 ms 92856 KB Output is correct
109 Correct 304 ms 92512 KB Output is correct
110 Correct 530 ms 92592 KB Output is correct
111 Correct 510 ms 92568 KB Output is correct
112 Correct 315 ms 92768 KB Output is correct
113 Correct 442 ms 92592 KB Output is correct
114 Correct 461 ms 92764 KB Output is correct
115 Correct 238 ms 106448 KB Output is correct
116 Correct 241 ms 106832 KB Output is correct
117 Correct 304 ms 99704 KB Output is correct
118 Correct 304 ms 99608 KB Output is correct
119 Correct 343 ms 92500 KB Output is correct
120 Correct 346 ms 92240 KB Output is correct