oj.uz

답안 #420011

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
420011 2021-06-07T21:59:57 Z vkgainz Financial Report (JOI21_financial) C++17
100 / 100
 623 ms 32724 KB 
#include <bits/stdc++.h>
using namespace std;

struct Node {
    int pref, suf, val, en, st, len;
};

int N, D;
Node comb(Node x, Node y) {
    Node ret;
    ret.pref = x.pref;
    if(x.pref == x.len)
        ret.pref = x.pref + y.pref;
    ret.suf = y.suf;
    if(y.suf == y.len)
        ret.suf = y.suf + x.suf;
    ret.val = max({x.val, y.val, x.suf + y.pref});
    ret.en = max(x.en, y.en);
    if(x.suf + y.pref >= D) {
        ret.en = max(ret.en, y.st + y.pref - 1);
    }
    ret.st = x.st;
    ret.len = x.len + y.len;
    return ret;
}
    

struct seg_tree {
    vector<Node> seg;
    int sz;
    void build(int x, int lx, int rx) {
        if(rx - lx == 1) {
            seg[x] = {1, 1, 1, -1, lx, 1};
            if(1 >= D) seg[x].en = lx;
            return;
        }
        int m = (lx + rx) / 2;
        build(2 * x + 1, lx, m);
        build(2 * x + 2, m, rx);
        seg[x] = comb(seg[2 * x + 1], seg[2 * x + 2]);
    }
    void init(int N) {
        sz = 1;
        while(sz < N) sz *= 2;
        seg.resize(2 * sz);
        build(0, 0, sz);
    }
    void upd(int i, int x, int lx, int rx) {
        if(rx - lx == 1) {
           seg[x] = {0, 0, 0, -1, lx, 1};
           return;
        }
        int m = (lx + rx) / 2;
        if(i < m) upd(i, 2 * x + 1, lx, m);
        else upd(i, 2 * x + 2, m, rx);
        seg[x] = comb(seg[2 * x + 1], seg[2 * x + 2]);
    }
    void upd(int i) { upd(i, 0, 0, sz); }
    Node query(int l, int r, int x, int lx, int rx) {
        if(lx >= r || rx <= l) return {0, 0, 0, -1, lx, 0};
        if(lx >= l && rx <= r) {
            return seg[x];
        }
        int m = (lx + rx) / 2;
        return comb(query(l, r, 2 * x + 1, lx, m), query(l, r, 2 * x + 2, m, rx));
    }
    Node query(int l, int r) { return query(l, r, 0, 0, sz); }
} in;

struct mx_tree {
    vector<int> seg;
    int sz;
    void init(int N) {
        sz = 1;
        while(sz < N) sz *= 2;
        seg.resize(2 * sz);
    }
    void upd(int i, int v, int x, int lx, int rx) {
        if(rx - lx == 1) {
            seg[x] = v;
            return;
        }
        int m = (lx + rx) / 2;
        if(i < m) upd(i, v, 2 * x + 1, lx, m);
        else upd(i, v, 2 * x + 2, m, rx);
        seg[x] = max(seg[2 * x + 1], seg[2 * x + 2]);
    }
    void upd(int i, int v) { upd(i, v, 0, 0, sz); }
    int query(int l, int r, int x, int lx, int rx) {
        if(lx >= r || rx <= l) return 0;
        if(lx >= l && rx <= r) return seg[x];
        int m = (lx + rx) / 2;
        return max(query(l, r, 2 * x + 1, lx, m), query(l, r, 2 * x + 2, m, rx));
    }
    int query(int l, int r) { return query(l, r, 0, 0, sz); }
} to_query;

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

    cin >> N >> D;
    vector<int> A(N);
    for(int i = 0; i < N; i++) {
        cin >> A[i];
    }
    vector<pair<int, int>> ord(N);
    for(int i = 0; i < N; i++) {
        ord[i] = {A[i], -i};
    }
    sort(ord.begin(), ord.end());
    int ans = 0;
    in.init(N), to_query.init(N);
    for(int i = 0; i < N; i++) {
        int idx = -ord[i].second;
        in.upd(idx);
        int lst = in.query(0, idx + 1).en;
        int curr = to_query.query(lst + 1, idx) + 1;
        ans = max(ans, curr);
        to_query.upd(idx, curr);
    }
    cout << ans << "\n";
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 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 0 ms 204 KB Output is correct
10 Correct 1 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 1 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 1 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 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 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 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 0 ms 204 KB Output is correct
10 Correct 1 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 1 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 1 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 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 1 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 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 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 0 ms 204 KB Output is correct
10 Correct 1 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 1 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 1 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 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 1 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 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 9 ms 856 KB Output is correct
42 Correct 9 ms 844 KB Output is correct
43 Correct 8 ms 852 KB Output is correct
44 Correct 8 ms 848 KB Output is correct
45 Correct 8 ms 844 KB Output is correct
46 Correct 10 ms 864 KB Output is correct
47 Correct 8 ms 844 KB Output is correct
48 Correct 10 ms 856 KB Output is correct
49 Correct 9 ms 860 KB Output is correct
50 Correct 8 ms 844 KB Output is correct
51 Correct 8 ms 844 KB Output is correct
52 Correct 9 ms 844 KB Output is correct
53 Correct 8 ms 860 KB Output is correct
54 Correct 8 ms 856 KB Output is correct
55 Correct 8 ms 844 KB Output is correct
56 Correct 8 ms 844 KB Output is correct
57 Correct 9 ms 844 KB Output is correct
58 Correct 7 ms 856 KB Output is correct
59 Correct 7 ms 860 KB Output is correct
60 Correct 8 ms 844 KB Output is correct
61 Correct 7 ms 844 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 398 ms 32580 KB Output is correct
2 Correct 442 ms 32556 KB Output is correct
3 Correct 579 ms 32568 KB Output is correct
4 Correct 603 ms 32684 KB Output is correct
5 Correct 497 ms 32456 KB Output is correct
6 Correct 577 ms 32612 KB Output is correct
7 Correct 390 ms 32544 KB Output is correct
8 Correct 385 ms 32552 KB Output is correct
9 Correct 398 ms 32592 KB Output is correct
10 Correct 405 ms 32556 KB Output is correct
11 Correct 487 ms 32596 KB Output is correct
12 Correct 506 ms 32468 KB Output is correct
13 Correct 510 ms 32656 KB Output is correct
14 Correct 580 ms 32564 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 398 ms 32496 KB Output is correct
2 Correct 523 ms 32580 KB Output is correct
3 Correct 553 ms 32564 KB Output is correct
4 Correct 585 ms 32560 KB Output is correct
5 Correct 509 ms 32580 KB Output is correct
6 Correct 548 ms 32588 KB Output is correct
7 Correct 387 ms 32560 KB Output is correct
8 Correct 383 ms 32560 KB Output is correct
9 Correct 397 ms 32600 KB Output is correct
10 Correct 464 ms 32588 KB Output is correct
11 Correct 536 ms 32708 KB Output is correct
12 Correct 479 ms 32560 KB Output is correct

Subtask #6
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 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 0 ms 204 KB Output is correct
10 Correct 1 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 1 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 1 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 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 1 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 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 9 ms 856 KB Output is correct
42 Correct 9 ms 844 KB Output is correct
43 Correct 8 ms 852 KB Output is correct
44 Correct 8 ms 848 KB Output is correct
45 Correct 8 ms 844 KB Output is correct
46 Correct 10 ms 864 KB Output is correct
47 Correct 8 ms 844 KB Output is correct
48 Correct 10 ms 856 KB Output is correct
49 Correct 9 ms 860 KB Output is correct
50 Correct 8 ms 844 KB Output is correct
51 Correct 8 ms 844 KB Output is correct
52 Correct 9 ms 844 KB Output is correct
53 Correct 8 ms 860 KB Output is correct
54 Correct 8 ms 856 KB Output is correct
55 Correct 8 ms 844 KB Output is correct
56 Correct 8 ms 844 KB Output is correct
57 Correct 9 ms 844 KB Output is correct
58 Correct 7 ms 856 KB Output is correct
59 Correct 7 ms 860 KB Output is correct
60 Correct 8 ms 844 KB Output is correct
61 Correct 7 ms 844 KB Output is correct
62 Correct 398 ms 32580 KB Output is correct
63 Correct 442 ms 32556 KB Output is correct
64 Correct 579 ms 32568 KB Output is correct
65 Correct 603 ms 32684 KB Output is correct
66 Correct 497 ms 32456 KB Output is correct
67 Correct 577 ms 32612 KB Output is correct
68 Correct 390 ms 32544 KB Output is correct
69 Correct 385 ms 32552 KB Output is correct
70 Correct 398 ms 32592 KB Output is correct
71 Correct 405 ms 32556 KB Output is correct
72 Correct 487 ms 32596 KB Output is correct
73 Correct 506 ms 32468 KB Output is correct
74 Correct 510 ms 32656 KB Output is correct
75 Correct 580 ms 32564 KB Output is correct
76 Correct 398 ms 32496 KB Output is correct
77 Correct 523 ms 32580 KB Output is correct
78 Correct 553 ms 32564 KB Output is correct
79 Correct 585 ms 32560 KB Output is correct
80 Correct 509 ms 32580 KB Output is correct
81 Correct 548 ms 32588 KB Output is correct
82 Correct 387 ms 32560 KB Output is correct
83 Correct 383 ms 32560 KB Output is correct
84 Correct 397 ms 32600 KB Output is correct
85 Correct 464 ms 32588 KB Output is correct
86 Correct 536 ms 32708 KB Output is correct
87 Correct 479 ms 32560 KB Output is correct
88 Correct 618 ms 32556 KB Output is correct
89 Correct 580 ms 32556 KB Output is correct
90 Correct 623 ms 32452 KB Output is correct
91 Correct 572 ms 32560 KB Output is correct
92 Correct 482 ms 32560 KB Output is correct
93 Correct 567 ms 32580 KB Output is correct
94 Correct 569 ms 32596 KB Output is correct
95 Correct 530 ms 32564 KB Output is correct
96 Correct 570 ms 32608 KB Output is correct
97 Correct 584 ms 32568 KB Output is correct
98 Correct 562 ms 32452 KB Output is correct
99 Correct 574 ms 32564 KB Output is correct
100 Correct 585 ms 32568 KB Output is correct
101 Correct 400 ms 32452 KB Output is correct
102 Correct 413 ms 32724 KB Output is correct
103 Correct 432 ms 32452 KB Output is correct
104 Correct 455 ms 32560 KB Output is correct
105 Correct 477 ms 32584 KB Output is correct
106 Correct 475 ms 32580 KB Output is correct
107 Correct 521 ms 32452 KB Output is correct
108 Correct 540 ms 32564 KB Output is correct
109 Correct 477 ms 32580 KB Output is correct
110 Correct 549 ms 32564 KB Output is correct
111 Correct 549 ms 32456 KB Output is correct
112 Correct 447 ms 32592 KB Output is correct
113 Correct 586 ms 32560 KB Output is correct
114 Correct 541 ms 32464 KB Output is correct
115 Correct 391 ms 32580 KB Output is correct
116 Correct 386 ms 32464 KB Output is correct
117 Correct 414 ms 32592 KB Output is correct
118 Correct 413 ms 32468 KB Output is correct
119 Correct 481 ms 32564 KB Output is correct
120 Correct 477 ms 32460 KB Output is correct