oj.uz

Submission #950648

# Submission time Handle Problem Language Result Execution time Memory
950648 2024-03-20T14:21:18 Z glebustim Financial Report (JOI21_financial) C++17
100 / 100
 684 ms 90232 KB 
#include <bits/extc++.h>
using namespace std;
using namespace __gnu_pbds;

#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define all(a) a.begin(), a.end()
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using vi = vector<int>;
using oset = tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>;

const int R = (1 << 19);
vi t(R * 2, 0);

void update(int i, int x) {
    int v = R + i;
    t[v] = x;
    v >>= 1;
    while (v > 0) {
        t[v] = max(t[v << 1], t[(v << 1) ^ 1]);
        v >>= 1;
    }
}

int get_max(int l, int r) {
    l += R;
    r += R;
    int res = 0;
    while (l < r) {
        if (l & 1) {
            res = max(res, t[l]);
            ++l;
        }
        if (!(r & 1)) {
            res = max(res, t[r]);
            --r;
        }
        l >>= 1;
        r >>= 1;
    }
    if (l == r)
        res = max(res, t[l]);
    return res;
}

vi t1(R * 2, R);

void update1(int ql, int qr, int x, int v = 1, int l = 0, int r = R) {
    if (ql >= r || l >= qr)
        return;
    if (ql <= l && r <= qr) {
        t1[v] = min(t1[v], x);
        return;
    }
    int m = (l + r) / 2;
    update1(ql, qr, x, (v << 1), l, m);
    update1(ql, qr, x, ((v << 1) ^ 1), m, r);
}

int get1(int i) {
    int v = R + i, res = R;
    while (v > 0) {
        res = min(res, t1[v]);
        v >>= 1;
    }
    return res;
}

void compress(vi &a) {
    vi b = a;
    sort(all(b));
    for (int &x: a)
        x = lower_bound(all(b), x) - b.begin();
}

int main() {
    fast;
    int n, d;
    cin >> n >> d;
    vi a(n);
    for (int i = 0; i < n; ++i)
        cin >> a[i];
    compress(a);
    vi r(n);
    multiset<int> s;
    for (int i = n - d; i < n; ++i) {
        r[i] = n;
        s.insert(a[i]);
    }
    for (int i = n - d - 1; i >= 0; --i) {
        update1(0, *s.begin(), i);
        r[i] = min(get1(a[i]) + d, n);
        s.erase(s.find(a[i + d]));
        s.insert(a[i]);
    }
    vi b(n);
    vector<multiset<int>> c(n);
    for (int i = 0; i < n; ++i)
        c[i].insert(0);
    multiset<tuple<int, int, int>> ss;
    for (int i = 0; i < n; ++i) {
        b[i] = get_max(0, a[i] - 1) + 1;
        ss.emplace(r[i], a[i], b[i]);
        c[a[i]].insert(b[i]);
        update(a[i], *(--c[a[i]].end()));
        while (!ss.empty() && get<0>(*ss.begin()) == i) {
            c[get<1>(*ss.begin())].erase(c[get<1>(*ss.begin())].find(get<2>(*ss.begin())));
            update(get<1>(*ss.begin()), *(--c[get<1>(*ss.begin())].end()));
            ss.erase(ss.begin());
        }
    }
    int ans = 0;
    for (int i = 0; i < n; ++i) {
        if (r[i] >= n - 1)
            ans = max(ans, b[i]);
    }
    cout << ans << '\n';
}

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8536 KB Output is correct
2 Correct 3 ms 8540 KB Output is correct
3 Correct 3 ms 8540 KB Output is correct
4 Correct 3 ms 8540 KB Output is correct
5 Correct 3 ms 8540 KB Output is correct
6 Correct 2 ms 8540 KB Output is correct
7 Correct 2 ms 8540 KB Output is correct
8 Correct 3 ms 8540 KB Output is correct
9 Correct 3 ms 8540 KB Output is correct
10 Correct 3 ms 8536 KB Output is correct
11 Correct 3 ms 8792 KB Output is correct
12 Correct 3 ms 8540 KB Output is correct
13 Correct 2 ms 8540 KB Output is correct
14 Correct 3 ms 8540 KB Output is correct
15 Correct 3 ms 8540 KB Output is correct
16 Correct 2 ms 8540 KB Output is correct
17 Correct 3 ms 8540 KB Output is correct
18 Correct 3 ms 8540 KB Output is correct
19 Correct 7 ms 8540 KB Output is correct
20 Correct 3 ms 8612 KB Output is correct
21 Correct 3 ms 8540 KB Output is correct
22 Correct 3 ms 8540 KB Output is correct
23 Correct 3 ms 8540 KB Output is correct
24 Correct 3 ms 8540 KB Output is correct
25 Correct 3 ms 8792 KB Output is correct
26 Correct 3 ms 8696 KB Output is correct
27 Correct 3 ms 8540 KB Output is correct
28 Correct 3 ms 8540 KB Output is correct
29 Correct 3 ms 8540 KB Output is correct
30 Correct 4 ms 8540 KB Output is correct
31 Correct 3 ms 8540 KB Output is correct
32 Correct 3 ms 8540 KB Output is correct
33 Correct 3 ms 8540 KB Output is correct
34 Correct 3 ms 8536 KB Output is correct
35 Correct 3 ms 8540 KB Output is correct
36 Correct 3 ms 8540 KB Output is correct
37 Correct 3 ms 8540 KB Output is correct
38 Correct 3 ms 8544 KB Output is correct
39 Correct 3 ms 8564 KB Output is correct
40 Correct 4 ms 8540 KB Output is correct
41 Correct 7 ms 9304 KB Output is correct
42 Correct 7 ms 9308 KB Output is correct
43 Correct 6 ms 9564 KB Output is correct
44 Correct 7 ms 9564 KB Output is correct
45 Correct 9 ms 10076 KB Output is correct
46 Correct 8 ms 10520 KB Output is correct
47 Correct 7 ms 9244 KB Output is correct
48 Correct 8 ms 9564 KB Output is correct
49 Correct 8 ms 9680 KB Output is correct
50 Correct 11 ms 9700 KB Output is correct
51 Correct 7 ms 9304 KB Output is correct
52 Correct 7 ms 9308 KB Output is correct
53 Correct 7 ms 9420 KB Output is correct
54 Correct 7 ms 9308 KB Output is correct
55 Correct 9 ms 10076 KB Output is correct
56 Correct 8 ms 10032 KB Output is correct
57 Correct 8 ms 10076 KB Output is correct
58 Correct 7 ms 10332 KB Output is correct
59 Correct 7 ms 10332 KB Output is correct
60 Correct 7 ms 10072 KB Output is correct
61 Correct 8 ms 10072 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 213 ms 72988 KB Output is correct
2 Correct 175 ms 44988 KB Output is correct
3 Correct 193 ms 43372 KB Output is correct
4 Correct 300 ms 43076 KB Output is correct
5 Correct 230 ms 43224 KB Output is correct
6 Correct 295 ms 43468 KB Output is correct
7 Correct 159 ms 42816 KB Output is correct
8 Correct 202 ms 75712 KB Output is correct
9 Correct 175 ms 43224 KB Output is correct
10 Correct 195 ms 59324 KB Output is correct
11 Correct 234 ms 43196 KB Output is correct
12 Correct 243 ms 43280 KB Output is correct
13 Correct 258 ms 43204 KB Output is correct
14 Correct 316 ms 43456 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 247 ms 87272 KB Output is correct
2 Correct 472 ms 87236 KB Output is correct
3 Correct 613 ms 87320 KB Output is correct
4 Correct 684 ms 87564 KB Output is correct
5 Correct 544 ms 87128 KB Output is correct
6 Correct 669 ms 87408 KB Output is correct
7 Correct 219 ms 87264 KB Output is correct
8 Correct 213 ms 87232 KB Output is correct
9 Correct 249 ms 86736 KB Output is correct
10 Correct 381 ms 87068 KB Output is correct
11 Correct 651 ms 87224 KB Output is correct
12 Correct 508 ms 87240 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8536 KB Output is correct
2 Correct 3 ms 8540 KB Output is correct
3 Correct 3 ms 8540 KB Output is correct
4 Correct 3 ms 8540 KB Output is correct
5 Correct 3 ms 8540 KB Output is correct
6 Correct 2 ms 8540 KB Output is correct
7 Correct 2 ms 8540 KB Output is correct
8 Correct 3 ms 8540 KB Output is correct
9 Correct 3 ms 8540 KB Output is correct
10 Correct 3 ms 8536 KB Output is correct
11 Correct 3 ms 8792 KB Output is correct
12 Correct 3 ms 8540 KB Output is correct
13 Correct 2 ms 8540 KB Output is correct
14 Correct 3 ms 8540 KB Output is correct
15 Correct 3 ms 8540 KB Output is correct
16 Correct 2 ms 8540 KB Output is correct
17 Correct 3 ms 8540 KB Output is correct
18 Correct 3 ms 8540 KB Output is correct
19 Correct 7 ms 8540 KB Output is correct
20 Correct 3 ms 8612 KB Output is correct
21 Correct 3 ms 8540 KB Output is correct
22 Correct 3 ms 8540 KB Output is correct
23 Correct 3 ms 8540 KB Output is correct
24 Correct 3 ms 8540 KB Output is correct
25 Correct 3 ms 8792 KB Output is correct
26 Correct 3 ms 8696 KB Output is correct
27 Correct 3 ms 8540 KB Output is correct
28 Correct 3 ms 8540 KB Output is correct
29 Correct 3 ms 8540 KB Output is correct
30 Correct 4 ms 8540 KB Output is correct
31 Correct 3 ms 8540 KB Output is correct
32 Correct 3 ms 8540 KB Output is correct
33 Correct 3 ms 8540 KB Output is correct
34 Correct 3 ms 8536 KB Output is correct
35 Correct 3 ms 8540 KB Output is correct
36 Correct 3 ms 8540 KB Output is correct
37 Correct 3 ms 8540 KB Output is correct
38 Correct 3 ms 8544 KB Output is correct
39 Correct 3 ms 8564 KB Output is correct
40 Correct 4 ms 8540 KB Output is correct
41 Correct 7 ms 9304 KB Output is correct
42 Correct 7 ms 9308 KB Output is correct
43 Correct 6 ms 9564 KB Output is correct
44 Correct 7 ms 9564 KB Output is correct
45 Correct 9 ms 10076 KB Output is correct
46 Correct 8 ms 10520 KB Output is correct
47 Correct 7 ms 9244 KB Output is correct
48 Correct 8 ms 9564 KB Output is correct
49 Correct 8 ms 9680 KB Output is correct
50 Correct 11 ms 9700 KB Output is correct
51 Correct 7 ms 9304 KB Output is correct
52 Correct 7 ms 9308 KB Output is correct
53 Correct 7 ms 9420 KB Output is correct
54 Correct 7 ms 9308 KB Output is correct
55 Correct 9 ms 10076 KB Output is correct
56 Correct 8 ms 10032 KB Output is correct
57 Correct 8 ms 10076 KB Output is correct
58 Correct 7 ms 10332 KB Output is correct
59 Correct 7 ms 10332 KB Output is correct
60 Correct 7 ms 10072 KB Output is correct
61 Correct 8 ms 10072 KB Output is correct
62 Correct 213 ms 72988 KB Output is correct
63 Correct 175 ms 44988 KB Output is correct
64 Correct 193 ms 43372 KB Output is correct
65 Correct 300 ms 43076 KB Output is correct
66 Correct 230 ms 43224 KB Output is correct
67 Correct 295 ms 43468 KB Output is correct
68 Correct 159 ms 42816 KB Output is correct
69 Correct 202 ms 75712 KB Output is correct
70 Correct 175 ms 43224 KB Output is correct
71 Correct 195 ms 59324 KB Output is correct
72 Correct 234 ms 43196 KB Output is correct
73 Correct 243 ms 43280 KB Output is correct
74 Correct 258 ms 43204 KB Output is correct
75 Correct 316 ms 43456 KB Output is correct
76 Correct 247 ms 87272 KB Output is correct
77 Correct 472 ms 87236 KB Output is correct
78 Correct 613 ms 87320 KB Output is correct
79 Correct 684 ms 87564 KB Output is correct
80 Correct 544 ms 87128 KB Output is correct
81 Correct 669 ms 87408 KB Output is correct
82 Correct 219 ms 87264 KB Output is correct
83 Correct 213 ms 87232 KB Output is correct
84 Correct 249 ms 86736 KB Output is correct
85 Correct 381 ms 87068 KB Output is correct
86 Correct 651 ms 87224 KB Output is correct
87 Correct 508 ms 87240 KB Output is correct
88 Correct 271 ms 43464 KB Output is correct
89 Correct 337 ms 43868 KB Output is correct
90 Correct 380 ms 52168 KB Output is correct
91 Correct 644 ms 72524 KB Output is correct
92 Correct 390 ms 76184 KB Output is correct
93 Correct 609 ms 76792 KB Output is correct
94 Correct 653 ms 86020 KB Output is correct
95 Correct 281 ms 43636 KB Output is correct
96 Correct 354 ms 48068 KB Output is correct
97 Correct 428 ms 54484 KB Output is correct
98 Correct 582 ms 72248 KB Output is correct
99 Correct 618 ms 75704 KB Output is correct
100 Correct 592 ms 75844 KB Output is correct
101 Correct 180 ms 43456 KB Output is correct
102 Correct 215 ms 43220 KB Output is correct
103 Correct 248 ms 43216 KB Output is correct
104 Correct 298 ms 44220 KB Output is correct
105 Correct 421 ms 54044 KB Output is correct
106 Correct 336 ms 74568 KB Output is correct
107 Correct 384 ms 75980 KB Output is correct
108 Correct 606 ms 76492 KB Output is correct
109 Correct 265 ms 43452 KB Output is correct
110 Correct 463 ms 64788 KB Output is correct
111 Correct 527 ms 71356 KB Output is correct
112 Correct 387 ms 70592 KB Output is correct
113 Correct 592 ms 76528 KB Output is correct
114 Correct 561 ms 76216 KB Output is correct
115 Correct 220 ms 90232 KB Output is correct
116 Correct 217 ms 90032 KB Output is correct
117 Correct 266 ms 83456 KB Output is correct
118 Correct 265 ms 83128 KB Output is correct
119 Correct 333 ms 76128 KB Output is correct
120 Correct 326 ms 76020 KB Output is correct