oj.uz

Submission #501973

# Submission time Handle Problem Language Result Execution time Memory
501973 2022-01-05T03:06:29 Z tengiz05 Financial Report (JOI21_financial) C++17
100 / 100
 1331 ms 22328 KB 
#include <bits/stdc++.h>

using i64 = long long;

struct Info {
    int mx;
    Info(int mx = 0) : mx(mx) {}
};
Info operator+(const Info &a, const Info &b) {
    return Info(std::max(a.mx, b.mx));
}
struct Tag {
    int x;
    Tag(int x = -1) : x(x) {}
};
void apply(Tag &a, Tag b) {
    if (b.x != -1) {
        a.x = b.x;
    }
}
void apply(Info &a, Tag b) {
    if (b.x != -1) {
        a.mx = b.x;
    }
}

template<class Info, class Tag,
    class Merge = std::plus<Info>>
struct LazySegmentTree {
    const int n;
    const Merge merge;
    std::vector<Info> info;
    std::vector<Tag> tag;
    LazySegmentTree(int n) : n(n), merge(Merge()), info(4 << std::__lg(n)), tag(4 << std::__lg(n)) {}
    LazySegmentTree(std::vector<Info> init) : LazySegmentTree(init.size()) {
        std::function<void(int, int, int)> build = [&](int p, int l, int r) {
            if (r - l == 1) {
                info[p] = init[l];
                return;
            }
            int m = (l + r) / 2;
            build(2 * p, l, m);
            build(2 * p + 1, m, r);
            pull(p);
        };
        build(1, 0, n);
    }
    void pull(int p) {
        info[p] = merge(info[2 * p], info[2 * p + 1]);
    }
    void apply(int p, const Tag &v) {
        ::apply(info[p], v);
        ::apply(tag[p], v);
    }
    void push(int p) {
        apply(2 * p, tag[p]);
        apply(2 * p + 1, tag[p]);
        tag[p] = Tag();
    }
    void modify(int p, int l, int r, int x, Info v) {
        if (r - l == 1) {
            info[p] = v;
            return;
        }
        int m = (l + r) / 2;
        push(p);
        if (x < m) {
            modify(2 * p, l, m, x, v);
        } else {
            modify(2 * p + 1, m, r, x, v);
        }
        pull(p);
    }
    void modify(int x, Info v) {
        modify(1, 0, n, x, v);
    }
    Info rangeQuery(int p, int l, int r, int x, int y) {
        if (l >= y || r <= x) {
            return Info();
        }
        if (l >= x && r <= y) {
            return info[p];
        }
        int m = (l + r) / 2;
        push(p);
        return merge(rangeQuery(2 * p, l, m, x, y), rangeQuery(2 * p + 1, m, r, x, y));
    }
    Info rangeQuery(int l, int r) {
        if (l >= r) return Info();
        return rangeQuery(1, 0, n, l, r);
    }
    void rangeApply(int p, int l, int r, int x, int y, const Tag &v) {
        if (l >= y || r <= x) {
            return;
        }
        if (l >= x && r <= y) {
            apply(p, v);
            return;
        }
        int m = (l + r) / 2;
        push(p);
        rangeApply(2 * p, l, m, x, y, v);
        rangeApply(2 * p + 1, m, r, x, y, v);
        pull(p);
    }
    void rangeApply(int l, int r, const Tag &v) {
        if (l >= r) return;
        return rangeApply(1, 0, n, l, r, v);
    }
};

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int n, d;
    std::cin >> n >> d;
    
    std::vector<int> a(n), f{-1};
    for (int i = 0; i < n; i++) {
        std::cin >> a[i];
        f.push_back(a[i]);
    }
    
    std::sort(f.begin(), f.end());
    f.erase(std::unique(f.begin(), f.end()), f.end());
    
    int m = f.size();
    
    for (int i = 0; i < n; i++) {
        a[i] = std::lower_bound(f.begin(), f.end(), a[i]) - f.begin();
    }
    
    LazySegmentTree<Info, Tag> s(m), t(m);
    
    for (int i = 0; i < n - 1; i++) {
        int x = s.rangeQuery(0, a[i]).mx;
        s.modify(a[i], std::max(s.rangeQuery(a[i], a[i] + 1).mx, x + 1));
        t.modify(a[i], i);
        int l = -1, r = m;
        while (l + 1 < r) {
            int m = (l + r) / 2;
            if (t.rangeQuery(0, m).mx <= i - d) {
                l = m;
            } else {
                r = m;
            }
        }
        s.rangeApply(0, l, Tag(0));
    }
    
    int x = s.rangeQuery(0, a[n - 1]).mx;
    int ans = std::max(s.rangeQuery(a[n - 1], m).mx, x + 1);
    
    std::cout << ans << "\n";
    
    return 0;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory 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 0 ms 204 KB Output is correct
11 Correct 0 ms 304 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 312 KB Output is correct
17 Correct 0 ms 312 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 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 0 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory 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 0 ms 204 KB Output is correct
11 Correct 0 ms 304 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 312 KB Output is correct
17 Correct 0 ms 312 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 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 0 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 1 ms 304 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 0 ms 204 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 312 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 308 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory 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 0 ms 204 KB Output is correct
11 Correct 0 ms 304 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 312 KB Output is correct
17 Correct 0 ms 312 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 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 0 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 1 ms 304 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 0 ms 204 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 312 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 308 KB Output is correct
41 Correct 9 ms 520 KB Output is correct
42 Correct 15 ms 716 KB Output is correct
43 Correct 2 ms 452 KB Output is correct
44 Correct 10 ms 452 KB Output is correct
45 Correct 10 ms 580 KB Output is correct
46 Correct 12 ms 716 KB Output is correct
47 Correct 11 ms 716 KB Output is correct
48 Correct 14 ms 708 KB Output is correct
49 Correct 13 ms 672 KB Output is correct
50 Correct 13 ms 716 KB Output is correct
51 Correct 12 ms 708 KB Output is correct
52 Correct 13 ms 704 KB Output is correct
53 Correct 11 ms 716 KB Output is correct
54 Correct 10 ms 708 KB Output is correct
55 Correct 13 ms 692 KB Output is correct
56 Correct 15 ms 716 KB Output is correct
57 Correct 14 ms 716 KB Output is correct
58 Correct 11 ms 712 KB Output is correct
59 Correct 11 ms 716 KB Output is correct
60 Correct 12 ms 716 KB Output is correct
61 Correct 12 ms 724 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 3656 KB Output is correct
2 Correct 84 ms 3636 KB Output is correct
3 Correct 188 ms 6304 KB Output is correct
4 Correct 993 ms 13976 KB Output is correct
5 Correct 1189 ms 22196 KB Output is correct
6 Correct 1331 ms 22328 KB Output is correct
7 Correct 849 ms 22092 KB Output is correct
8 Correct 717 ms 22056 KB Output is correct
9 Correct 792 ms 22084 KB Output is correct
10 Correct 845 ms 22124 KB Output is correct
11 Correct 963 ms 22124 KB Output is correct
12 Correct 796 ms 22124 KB Output is correct
13 Correct 1169 ms 22200 KB Output is correct
14 Correct 971 ms 22196 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 3648 KB Output is correct
2 Correct 151 ms 3620 KB Output is correct
3 Correct 392 ms 6232 KB Output is correct
4 Correct 1004 ms 22232 KB Output is correct
5 Correct 992 ms 22120 KB Output is correct
6 Correct 957 ms 22076 KB Output is correct
7 Correct 827 ms 22068 KB Output is correct
8 Correct 859 ms 22156 KB Output is correct
9 Correct 920 ms 22096 KB Output is correct
10 Correct 865 ms 22140 KB Output is correct
11 Correct 998 ms 22048 KB Output is correct
12 Correct 910 ms 22212 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory 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 0 ms 204 KB Output is correct
11 Correct 0 ms 304 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 312 KB Output is correct
17 Correct 0 ms 312 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 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 0 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 1 ms 304 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 0 ms 204 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 312 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 308 KB Output is correct
41 Correct 9 ms 520 KB Output is correct
42 Correct 15 ms 716 KB Output is correct
43 Correct 2 ms 452 KB Output is correct
44 Correct 10 ms 452 KB Output is correct
45 Correct 10 ms 580 KB Output is correct
46 Correct 12 ms 716 KB Output is correct
47 Correct 11 ms 716 KB Output is correct
48 Correct 14 ms 708 KB Output is correct
49 Correct 13 ms 672 KB Output is correct
50 Correct 13 ms 716 KB Output is correct
51 Correct 12 ms 708 KB Output is correct
52 Correct 13 ms 704 KB Output is correct
53 Correct 11 ms 716 KB Output is correct
54 Correct 10 ms 708 KB Output is correct
55 Correct 13 ms 692 KB Output is correct
56 Correct 15 ms 716 KB Output is correct
57 Correct 14 ms 716 KB Output is correct
58 Correct 11 ms 712 KB Output is correct
59 Correct 11 ms 716 KB Output is correct
60 Correct 12 ms 716 KB Output is correct
61 Correct 12 ms 724 KB Output is correct
62 Correct 42 ms 3656 KB Output is correct
63 Correct 84 ms 3636 KB Output is correct
64 Correct 188 ms 6304 KB Output is correct
65 Correct 993 ms 13976 KB Output is correct
66 Correct 1189 ms 22196 KB Output is correct
67 Correct 1331 ms 22328 KB Output is correct
68 Correct 849 ms 22092 KB Output is correct
69 Correct 717 ms 22056 KB Output is correct
70 Correct 792 ms 22084 KB Output is correct
71 Correct 845 ms 22124 KB Output is correct
72 Correct 963 ms 22124 KB Output is correct
73 Correct 796 ms 22124 KB Output is correct
74 Correct 1169 ms 22200 KB Output is correct
75 Correct 971 ms 22196 KB Output is correct
76 Correct 48 ms 3648 KB Output is correct
77 Correct 151 ms 3620 KB Output is correct
78 Correct 392 ms 6232 KB Output is correct
79 Correct 1004 ms 22232 KB Output is correct
80 Correct 992 ms 22120 KB Output is correct
81 Correct 957 ms 22076 KB Output is correct
82 Correct 827 ms 22068 KB Output is correct
83 Correct 859 ms 22156 KB Output is correct
84 Correct 920 ms 22096 KB Output is correct
85 Correct 865 ms 22140 KB Output is correct
86 Correct 998 ms 22048 KB Output is correct
87 Correct 910 ms 22212 KB Output is correct
88 Correct 466 ms 6324 KB Output is correct
89 Correct 1295 ms 22120 KB Output is correct
90 Correct 562 ms 7492 KB Output is correct
91 Correct 1055 ms 22204 KB Output is correct
92 Correct 117 ms 6328 KB Output is correct
93 Correct 505 ms 6332 KB Output is correct
94 Correct 806 ms 13996 KB Output is correct
95 Correct 1166 ms 22188 KB Output is correct
96 Correct 974 ms 22196 KB Output is correct
97 Correct 1086 ms 22220 KB Output is correct
98 Correct 966 ms 22144 KB Output is correct
99 Correct 1116 ms 22192 KB Output is correct
100 Correct 1156 ms 22276 KB Output is correct
101 Correct 851 ms 22120 KB Output is correct
102 Correct 839 ms 22200 KB Output is correct
103 Correct 936 ms 22204 KB Output is correct
104 Correct 641 ms 22212 KB Output is correct
105 Correct 850 ms 22124 KB Output is correct
106 Correct 993 ms 22204 KB Output is correct
107 Correct 951 ms 22132 KB Output is correct
108 Correct 1089 ms 22132 KB Output is correct
109 Correct 992 ms 22188 KB Output is correct
110 Correct 1180 ms 22136 KB Output is correct
111 Correct 1070 ms 22120 KB Output is correct
112 Correct 987 ms 22208 KB Output is correct
113 Correct 1104 ms 22128 KB Output is correct
114 Correct 1115 ms 22076 KB Output is correct
115 Correct 900 ms 22192 KB Output is correct
116 Correct 853 ms 22172 KB Output is correct
117 Correct 909 ms 22124 KB Output is correct
118 Correct 899 ms 22196 KB Output is correct
119 Correct 1049 ms 22212 KB Output is correct
120 Correct 987 ms 22228 KB Output is correct