oj.uz

답안 #533158

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
533158 2022-03-05T03:26:10 Z 4fecta Financial Report (JOI21_financial) C++17
100 / 100
 917 ms 45764 KB 
#include <bits/stdc++.h>
 
using namespace std;
#define ll long long
#define int ll
#define ld long double
#define pii pair<int, int>
#define f first
#define s second
#define boost() cin.tie(0), cin.sync_with_stdio(0)
#define mid ((l + r) / 2)
 
struct node {
    int dp, dead, i, lzy;
};
 
const int MN = 300005;
 
int n, d, a[MN], ans = 1, pos[MN];
vector<pii> v;
node st[4 * MN];
 
node push_up(node p, node q) {
    node ret{};
    ret.dp = max(p.dp, q.dp);
    if (p.dead < q.dead) ret.dead = p.dead, ret.i = p.i;
    else ret.dead = q.dead, ret.i = q.i;
    return ret;
}
 
void push_down(int l, int r, int idx) {
    if (!st[idx].lzy) return;
    st[idx].dead = max(st[idx].dead, st[idx].lzy);
    if (l != r) st[idx * 2].lzy = max(st[idx * 2].lzy, st[idx].lzy), st[idx * 2 + 1].lzy = max(st[idx * 2 + 1].lzy, st[idx].lzy);
    st[idx].lzy = 0;
}
 
void build(int l, int r, int idx) {
    if (l == r) {st[idx] = {-0x3f3f3f3f, 0x3f3f3f3f, l, 0}; return;}
    build(l, mid, idx * 2), build(mid + 1, r, idx * 2 + 1);
    st[idx] = push_up(st[idx * 2], st[idx * 2 + 1]);
}
 
void set_dp(int l, int r, int x, int val, int idx) {
    push_down(l, r, idx);
    if (x < l || r < x) return;
    if (l == r) {st[idx].dp = val; return;}
    set_dp(l, mid, x, val, idx * 2);
    set_dp(mid + 1, r, x, val, idx * 2 + 1);
    st[idx] = push_up(st[idx * 2], st[idx * 2 + 1]);
}
 
void set_dead(int l, int r, int x, int val, int idx) {
    push_down(l, r, idx);
    if (x < l || r < x) return;
    if (l == r) {st[idx].dead = val; return;}
    set_dead(l, mid, x, val, idx * 2);
    set_dead(mid + 1, r, x, val, idx * 2 + 1);
    st[idx] = push_up(st[idx * 2], st[idx * 2 + 1]);
}
 
void chmax(int l, int r, int x, int y, int val, int idx) {
    push_down(l, r, idx);
    if (r < x || l > y) return;
    if (r <= y && l >= x) {
        st[idx].lzy = val;
        push_down(l, r, idx);
        return;
    }
    chmax(l, mid, x, y, val, idx * 2), chmax(mid + 1, r, x, y, val, idx * 2 + 1);
    st[idx] = push_up(st[idx * 2], st[idx * 2 + 1]);
}
 
int qry(int l, int r, int x, int y, int idx) {
    push_down(l, r, idx);
    if (r < x || l > y) return -0x3f3f3f3f;
    if (r <= y && l >= x) return st[idx].dp;
    return max(qry(l, mid, x, y, idx * 2), qry(mid + 1, r, x, y, idx * 2 + 1));
}
 
bool cmp(pii p, pii q) {
    if (p.f != q.f) return p.f < q.f;
    return p.s > q.s;
}
 
int32_t main() {
    boost();
 
    cin >> n >> d;
    for (int i = 1; i <= n; i++) cin >> a[i], v.push_back({a[i], i});
    sort(v.begin(), v.end(), cmp);
    for (int i = 0; i < n; i++) pos[v[i].s] = i + 1;
    build(1, n, 1);
    for (int i = 1; i <= n; i++) {
        while (st[1].dead < i - d) {
            int j = st[1].i;
            set_dp(1, n, j, -0x3f3f3f3f, 1);
            set_dead(1, n, j, 0x3f3f3f3f, 1);
        }
        int tmp = max(0ll, qry(1, n, 1, pos[i], 1)) + 1;
        set_dead(1, n, pos[i], i, 1);
        chmax(1, n, pos[i], n, i, 1);
        ans = max(ans, tmp);
        set_dp(1, n, pos[i], tmp, 1);
    }
    printf("%lld\n", ans);
 
    return 0;
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 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 0 ms 204 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 0 ms 332 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 0 ms 332 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 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 0 ms 204 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 0 ms 332 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 0 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 392 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 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 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 0 ms 204 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 0 ms 332 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 0 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 392 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 15 ms 1208 KB Output is correct
42 Correct 15 ms 1100 KB Output is correct
43 Correct 13 ms 1192 KB Output is correct
44 Correct 11 ms 1100 KB Output is correct
45 Correct 10 ms 1192 KB Output is correct
46 Correct 10 ms 1100 KB Output is correct
47 Correct 14 ms 1100 KB Output is correct
48 Correct 13 ms 1100 KB Output is correct
49 Correct 14 ms 1100 KB Output is correct
50 Correct 14 ms 1100 KB Output is correct
51 Correct 14 ms 1100 KB Output is correct
52 Correct 15 ms 1100 KB Output is correct
53 Correct 14 ms 1100 KB Output is correct
54 Correct 14 ms 1100 KB Output is correct
55 Correct 12 ms 1208 KB Output is correct
56 Correct 11 ms 1100 KB Output is correct
57 Correct 10 ms 1100 KB Output is correct
58 Correct 9 ms 1100 KB Output is correct
59 Correct 10 ms 1100 KB Output is correct
60 Correct 9 ms 1100 KB Output is correct
61 Correct 9 ms 1100 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 502 ms 42660 KB Output is correct
2 Correct 768 ms 42576 KB Output is correct
3 Correct 859 ms 42568 KB Output is correct
4 Correct 910 ms 42564 KB Output is correct
5 Correct 843 ms 42700 KB Output is correct
6 Correct 914 ms 42664 KB Output is correct
7 Correct 751 ms 42596 KB Output is correct
8 Correct 509 ms 42636 KB Output is correct
9 Correct 744 ms 42616 KB Output is correct
10 Correct 615 ms 42592 KB Output is correct
11 Correct 847 ms 42660 KB Output is correct
12 Correct 885 ms 42584 KB Output is correct
13 Correct 877 ms 42576 KB Output is correct
14 Correct 913 ms 42672 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 496 ms 42652 KB Output is correct
2 Correct 589 ms 42648 KB Output is correct
3 Correct 630 ms 42660 KB Output is correct
4 Correct 657 ms 42620 KB Output is correct
5 Correct 605 ms 42660 KB Output is correct
6 Correct 651 ms 42632 KB Output is correct
7 Correct 499 ms 42652 KB Output is correct
8 Correct 491 ms 42568 KB Output is correct
9 Correct 506 ms 42520 KB Output is correct
10 Correct 564 ms 42532 KB Output is correct
11 Correct 633 ms 42660 KB Output is correct
12 Correct 604 ms 42564 KB Output is correct

Subtask #6
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 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 0 ms 204 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 0 ms 332 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 0 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 392 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 15 ms 1208 KB Output is correct
42 Correct 15 ms 1100 KB Output is correct
43 Correct 13 ms 1192 KB Output is correct
44 Correct 11 ms 1100 KB Output is correct
45 Correct 10 ms 1192 KB Output is correct
46 Correct 10 ms 1100 KB Output is correct
47 Correct 14 ms 1100 KB Output is correct
48 Correct 13 ms 1100 KB Output is correct
49 Correct 14 ms 1100 KB Output is correct
50 Correct 14 ms 1100 KB Output is correct
51 Correct 14 ms 1100 KB Output is correct
52 Correct 15 ms 1100 KB Output is correct
53 Correct 14 ms 1100 KB Output is correct
54 Correct 14 ms 1100 KB Output is correct
55 Correct 12 ms 1208 KB Output is correct
56 Correct 11 ms 1100 KB Output is correct
57 Correct 10 ms 1100 KB Output is correct
58 Correct 9 ms 1100 KB Output is correct
59 Correct 10 ms 1100 KB Output is correct
60 Correct 9 ms 1100 KB Output is correct
61 Correct 9 ms 1100 KB Output is correct
62 Correct 502 ms 42660 KB Output is correct
63 Correct 768 ms 42576 KB Output is correct
64 Correct 859 ms 42568 KB Output is correct
65 Correct 910 ms 42564 KB Output is correct
66 Correct 843 ms 42700 KB Output is correct
67 Correct 914 ms 42664 KB Output is correct
68 Correct 751 ms 42596 KB Output is correct
69 Correct 509 ms 42636 KB Output is correct
70 Correct 744 ms 42616 KB Output is correct
71 Correct 615 ms 42592 KB Output is correct
72 Correct 847 ms 42660 KB Output is correct
73 Correct 885 ms 42584 KB Output is correct
74 Correct 877 ms 42576 KB Output is correct
75 Correct 913 ms 42672 KB Output is correct
76 Correct 496 ms 42652 KB Output is correct
77 Correct 589 ms 42648 KB Output is correct
78 Correct 630 ms 42660 KB Output is correct
79 Correct 657 ms 42620 KB Output is correct
80 Correct 605 ms 42660 KB Output is correct
81 Correct 651 ms 42632 KB Output is correct
82 Correct 499 ms 42652 KB Output is correct
83 Correct 491 ms 42568 KB Output is correct
84 Correct 506 ms 42520 KB Output is correct
85 Correct 564 ms 42532 KB Output is correct
86 Correct 633 ms 42660 KB Output is correct
87 Correct 604 ms 42564 KB Output is correct
88 Correct 903 ms 45468 KB Output is correct
89 Correct 917 ms 45476 KB Output is correct
90 Correct 861 ms 45476 KB Output is correct
91 Correct 684 ms 45556 KB Output is correct
92 Correct 614 ms 45480 KB Output is correct
93 Correct 638 ms 45484 KB Output is correct
94 Correct 646 ms 45472 KB Output is correct
95 Correct 894 ms 45480 KB Output is correct
96 Correct 894 ms 45588 KB Output is correct
97 Correct 909 ms 45488 KB Output is correct
98 Correct 691 ms 45476 KB Output is correct
99 Correct 647 ms 45504 KB Output is correct
100 Correct 664 ms 45476 KB Output is correct
101 Correct 776 ms 45764 KB Output is correct
102 Correct 779 ms 45488 KB Output is correct
103 Correct 778 ms 45556 KB Output is correct
104 Correct 791 ms 45480 KB Output is correct
105 Correct 784 ms 45472 KB Output is correct
106 Correct 585 ms 45484 KB Output is correct
107 Correct 604 ms 45552 KB Output is correct
108 Correct 639 ms 45476 KB Output is correct
109 Correct 850 ms 45520 KB Output is correct
110 Correct 740 ms 45492 KB Output is correct
111 Correct 686 ms 45576 KB Output is correct
112 Correct 628 ms 45480 KB Output is correct
113 Correct 634 ms 45560 KB Output is correct
114 Correct 624 ms 45472 KB Output is correct
115 Correct 486 ms 45584 KB Output is correct
116 Correct 500 ms 45480 KB Output is correct
117 Correct 554 ms 45476 KB Output is correct
118 Correct 545 ms 45532 KB Output is correct
119 Correct 572 ms 45444 KB Output is correct
120 Correct 577 ms 45536 KB Output is correct