oj.uz

Submission #811986

# Submission time Handle Problem Language Result Execution time Memory
811986 2023-08-07T06:41:20 Z vjudge1 Financial Report (JOI21_financial) C++17
100 / 100
 516 ms 41988 KB 
#include<bits/stdc++.h>

using namespace std;
using ll = long long;

const int N = (1 << 19);
const int INF = 1e9;

int n, d;
int a[N];
vector<int> mx(2 * N, -INF);

void update(int pos, int val) {
    for(mx[pos += N] = val; pos > 1; pos >>= 1) {
        mx[pos >> 1] = max(mx[pos], mx[(pos ^ 1)]);
    }
}
// last index i < qr a[i] > val
int left_bound(int qr, int val, int l = 0, int r = N - 1, int v = 1) {
    if(l >= qr || mx[v] <= val)
        return -1;
    if(l == r) 
        return l;
    int m = (l + r) / 2;
    int res = left_bound(qr, val, m + 1, r, 2 * v + 1);
    if(res == -1) res = left_bound(qr, val, l, m, 2 * v);
    return res;
}
// first index i > ql a[i] > val
int right_bound(int ql, int val, int l = 0, int r = N - 1, int v = 1) {
    if(r <= ql || mx[v] <= val)
        return -1;
    if(l == r) 
        return l;
    int m = (l + r) / 2;
    int res = right_bound(ql, val, l, m, 2 * v);
    if(res == -1) res = right_bound(ql, val, m + 1, r, 2 * v + 1);
    return res;
}

void add(int pos) {
    // cout << "add: \n";
    int lb = left_bound(pos, -INF), rb = right_bound(pos, -INF);
    // cout << pos << ' ' << lb << ' ' << rb << '\n';
    if(rb != -1) update(rb, rb - pos);
    update(pos, (lb != -1 ? pos - lb : 0));
}
int get_rb(int pos) {
    int x = right_bound(pos, d);
    if(x == -1) x = n + 1;
    return min(left_bound(x, -INF) + d, n);
}

int st[2 * N];
void insert(int pos, int val, int i) {
    for(st[pos += N] = val; pos > 1; pos >>= 1) {
        st[pos >> 1] = max(st[pos], st[(pos ^ 1)]); 
    }        
}
void erase(int pos, int val, int i) {
    for(st[pos += N] = 0; pos > 1; pos >>= 1) {
        st[pos >> 1] = max(st[pos], st[(pos ^ 1)]); 
    }        
}
int get(int ql, int qr) {
    int res = 0;
    for(ql += N, qr += N + 1; ql < qr; ql >>= 1, qr >>= 1) {
        if(ql & 1) {
            res = max(res, st[ql]);
            ql++;
        }
        if(qr & 1) {
            qr--;
            res = max(res, st[qr]);
        }
    }
    return res;
}
vector<int> cl[N];

void compress() {
    map<int, int> mp;
    for(int i = 1; i <= n; i++) 
        mp[a[i]] = 1;
    int k = 0;
    for(auto &c : mp) 
        c.second = k++;
    for(int i = 1; i <= n; i++) 
        a[i] = mp[a[i]];
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    cin >> n >> d;
    for(int i = 1; i <= n; i++) 
        cin >> a[i];
    compress();
    vector<pair<int, int>> order;
    for(int i = 1; i <= n; i++) {
        order.push_back({a[i], i});
    }
    int rb[n + 1] = {}, b[n + 1];
    sort(order.begin(), order.end(), [](pair<int, int> x, pair<int, int> y) {
        if(x.first == y.first) return x.second > y.second;
        return x.first < y.first;
    });
    
    int ki = 0;
    for(auto [a, i] : order) {
        add(i);
        rb[i] = get_rb(i);
        b[i] = ki++;
    }
    vector<int> dp(n + 1, 1);
    for(int i = 1; i <= n; i++) {
        for(int j : cl[i]) 
            erase(b[j], dp[j], j);
        dp[i] = get(0, b[i] - 1) + 1;
        insert(b[i], dp[i], i);
        cl[rb[i] + 1].push_back(i);
    }
    cout << *max_element(dp.begin(), dp.end());
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 16728 KB Output is correct
2 Correct 8 ms 16724 KB Output is correct
3 Correct 8 ms 16724 KB Output is correct
4 Correct 8 ms 16724 KB Output is correct
5 Correct 8 ms 16724 KB Output is correct
6 Correct 8 ms 16724 KB Output is correct
7 Correct 8 ms 16720 KB Output is correct
8 Correct 8 ms 16724 KB Output is correct
9 Correct 8 ms 16724 KB Output is correct
10 Correct 10 ms 16684 KB Output is correct
11 Correct 8 ms 16724 KB Output is correct
12 Correct 8 ms 16756 KB Output is correct
13 Correct 11 ms 16724 KB Output is correct
14 Correct 9 ms 16724 KB Output is correct
15 Correct 8 ms 16736 KB Output is correct
16 Correct 8 ms 16680 KB Output is correct
17 Correct 8 ms 16724 KB Output is correct
18 Correct 8 ms 16724 KB Output is correct
19 Correct 8 ms 16724 KB Output is correct
20 Correct 8 ms 16740 KB Output is correct
21 Correct 9 ms 16724 KB Output is correct
22 Correct 8 ms 16724 KB Output is correct
23 Correct 9 ms 16724 KB Output is correct
24 Correct 8 ms 16748 KB Output is correct
25 Correct 8 ms 16724 KB Output is correct
26 Correct 9 ms 16724 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 16728 KB Output is correct
2 Correct 8 ms 16724 KB Output is correct
3 Correct 8 ms 16724 KB Output is correct
4 Correct 8 ms 16724 KB Output is correct
5 Correct 8 ms 16724 KB Output is correct
6 Correct 8 ms 16724 KB Output is correct
7 Correct 8 ms 16720 KB Output is correct
8 Correct 8 ms 16724 KB Output is correct
9 Correct 8 ms 16724 KB Output is correct
10 Correct 10 ms 16684 KB Output is correct
11 Correct 8 ms 16724 KB Output is correct
12 Correct 8 ms 16756 KB Output is correct
13 Correct 11 ms 16724 KB Output is correct
14 Correct 9 ms 16724 KB Output is correct
15 Correct 8 ms 16736 KB Output is correct
16 Correct 8 ms 16680 KB Output is correct
17 Correct 8 ms 16724 KB Output is correct
18 Correct 8 ms 16724 KB Output is correct
19 Correct 8 ms 16724 KB Output is correct
20 Correct 8 ms 16740 KB Output is correct
21 Correct 9 ms 16724 KB Output is correct
22 Correct 8 ms 16724 KB Output is correct
23 Correct 9 ms 16724 KB Output is correct
24 Correct 8 ms 16748 KB Output is correct
25 Correct 8 ms 16724 KB Output is correct
26 Correct 9 ms 16724 KB Output is correct
27 Correct 9 ms 16724 KB Output is correct
28 Correct 8 ms 16724 KB Output is correct
29 Correct 10 ms 16724 KB Output is correct
30 Correct 9 ms 16800 KB Output is correct
31 Correct 8 ms 16716 KB Output is correct
32 Correct 8 ms 16724 KB Output is correct
33 Correct 9 ms 16724 KB Output is correct
34 Correct 9 ms 16724 KB Output is correct
35 Correct 8 ms 16748 KB Output is correct
36 Correct 9 ms 16736 KB Output is correct
37 Correct 8 ms 16724 KB Output is correct
38 Correct 8 ms 16724 KB Output is correct
39 Correct 9 ms 16788 KB Output is correct
40 Correct 10 ms 16788 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 16728 KB Output is correct
2 Correct 8 ms 16724 KB Output is correct
3 Correct 8 ms 16724 KB Output is correct
4 Correct 8 ms 16724 KB Output is correct
5 Correct 8 ms 16724 KB Output is correct
6 Correct 8 ms 16724 KB Output is correct
7 Correct 8 ms 16720 KB Output is correct
8 Correct 8 ms 16724 KB Output is correct
9 Correct 8 ms 16724 KB Output is correct
10 Correct 10 ms 16684 KB Output is correct
11 Correct 8 ms 16724 KB Output is correct
12 Correct 8 ms 16756 KB Output is correct
13 Correct 11 ms 16724 KB Output is correct
14 Correct 9 ms 16724 KB Output is correct
15 Correct 8 ms 16736 KB Output is correct
16 Correct 8 ms 16680 KB Output is correct
17 Correct 8 ms 16724 KB Output is correct
18 Correct 8 ms 16724 KB Output is correct
19 Correct 8 ms 16724 KB Output is correct
20 Correct 8 ms 16740 KB Output is correct
21 Correct 9 ms 16724 KB Output is correct
22 Correct 8 ms 16724 KB Output is correct
23 Correct 9 ms 16724 KB Output is correct
24 Correct 8 ms 16748 KB Output is correct
25 Correct 8 ms 16724 KB Output is correct
26 Correct 9 ms 16724 KB Output is correct
27 Correct 9 ms 16724 KB Output is correct
28 Correct 8 ms 16724 KB Output is correct
29 Correct 10 ms 16724 KB Output is correct
30 Correct 9 ms 16800 KB Output is correct
31 Correct 8 ms 16716 KB Output is correct
32 Correct 8 ms 16724 KB Output is correct
33 Correct 9 ms 16724 KB Output is correct
34 Correct 9 ms 16724 KB Output is correct
35 Correct 8 ms 16748 KB Output is correct
36 Correct 9 ms 16736 KB Output is correct
37 Correct 8 ms 16724 KB Output is correct
38 Correct 8 ms 16724 KB Output is correct
39 Correct 9 ms 16788 KB Output is correct
40 Correct 10 ms 16788 KB Output is correct
41 Correct 16 ms 17108 KB Output is correct
42 Correct 16 ms 17168 KB Output is correct
43 Correct 12 ms 16968 KB Output is correct
44 Correct 13 ms 17064 KB Output is correct
45 Correct 13 ms 17076 KB Output is correct
46 Correct 17 ms 17228 KB Output is correct
47 Correct 15 ms 17220 KB Output is correct
48 Correct 15 ms 17236 KB Output is correct
49 Correct 16 ms 17236 KB Output is correct
50 Correct 14 ms 17236 KB Output is correct
51 Correct 17 ms 17184 KB Output is correct
52 Correct 16 ms 17236 KB Output is correct
53 Correct 14 ms 17176 KB Output is correct
54 Correct 14 ms 17264 KB Output is correct
55 Correct 14 ms 17264 KB Output is correct
56 Correct 14 ms 17236 KB Output is correct
57 Correct 14 ms 17176 KB Output is correct
58 Correct 12 ms 17236 KB Output is correct
59 Correct 13 ms 17252 KB Output is correct
60 Correct 13 ms 17244 KB Output is correct
61 Correct 13 ms 17164 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 160 ms 29412 KB Output is correct
2 Correct 240 ms 30440 KB Output is correct
3 Correct 298 ms 30904 KB Output is correct
4 Correct 506 ms 34552 KB Output is correct
5 Correct 401 ms 36616 KB Output is correct
6 Correct 504 ms 36656 KB Output is correct
7 Correct 238 ms 37148 KB Output is correct
8 Correct 212 ms 36608 KB Output is correct
9 Correct 235 ms 36684 KB Output is correct
10 Correct 262 ms 36716 KB Output is correct
11 Correct 398 ms 36656 KB Output is correct
12 Correct 435 ms 36740 KB Output is correct
13 Correct 432 ms 37296 KB Output is correct
14 Correct 516 ms 36656 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 149 ms 29312 KB Output is correct
2 Correct 236 ms 29276 KB Output is correct
3 Correct 260 ms 29444 KB Output is correct
4 Correct 416 ms 36712 KB Output is correct
5 Correct 363 ms 36684 KB Output is correct
6 Correct 404 ms 39052 KB Output is correct
7 Correct 232 ms 36624 KB Output is correct
8 Correct 217 ms 36688 KB Output is correct
9 Correct 222 ms 36572 KB Output is correct
10 Correct 339 ms 36592 KB Output is correct
11 Correct 412 ms 36660 KB Output is correct
12 Correct 386 ms 36656 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 16728 KB Output is correct
2 Correct 8 ms 16724 KB Output is correct
3 Correct 8 ms 16724 KB Output is correct
4 Correct 8 ms 16724 KB Output is correct
5 Correct 8 ms 16724 KB Output is correct
6 Correct 8 ms 16724 KB Output is correct
7 Correct 8 ms 16720 KB Output is correct
8 Correct 8 ms 16724 KB Output is correct
9 Correct 8 ms 16724 KB Output is correct
10 Correct 10 ms 16684 KB Output is correct
11 Correct 8 ms 16724 KB Output is correct
12 Correct 8 ms 16756 KB Output is correct
13 Correct 11 ms 16724 KB Output is correct
14 Correct 9 ms 16724 KB Output is correct
15 Correct 8 ms 16736 KB Output is correct
16 Correct 8 ms 16680 KB Output is correct
17 Correct 8 ms 16724 KB Output is correct
18 Correct 8 ms 16724 KB Output is correct
19 Correct 8 ms 16724 KB Output is correct
20 Correct 8 ms 16740 KB Output is correct
21 Correct 9 ms 16724 KB Output is correct
22 Correct 8 ms 16724 KB Output is correct
23 Correct 9 ms 16724 KB Output is correct
24 Correct 8 ms 16748 KB Output is correct
25 Correct 8 ms 16724 KB Output is correct
26 Correct 9 ms 16724 KB Output is correct
27 Correct 9 ms 16724 KB Output is correct
28 Correct 8 ms 16724 KB Output is correct
29 Correct 10 ms 16724 KB Output is correct
30 Correct 9 ms 16800 KB Output is correct
31 Correct 8 ms 16716 KB Output is correct
32 Correct 8 ms 16724 KB Output is correct
33 Correct 9 ms 16724 KB Output is correct
34 Correct 9 ms 16724 KB Output is correct
35 Correct 8 ms 16748 KB Output is correct
36 Correct 9 ms 16736 KB Output is correct
37 Correct 8 ms 16724 KB Output is correct
38 Correct 8 ms 16724 KB Output is correct
39 Correct 9 ms 16788 KB Output is correct
40 Correct 10 ms 16788 KB Output is correct
41 Correct 16 ms 17108 KB Output is correct
42 Correct 16 ms 17168 KB Output is correct
43 Correct 12 ms 16968 KB Output is correct
44 Correct 13 ms 17064 KB Output is correct
45 Correct 13 ms 17076 KB Output is correct
46 Correct 17 ms 17228 KB Output is correct
47 Correct 15 ms 17220 KB Output is correct
48 Correct 15 ms 17236 KB Output is correct
49 Correct 16 ms 17236 KB Output is correct
50 Correct 14 ms 17236 KB Output is correct
51 Correct 17 ms 17184 KB Output is correct
52 Correct 16 ms 17236 KB Output is correct
53 Correct 14 ms 17176 KB Output is correct
54 Correct 14 ms 17264 KB Output is correct
55 Correct 14 ms 17264 KB Output is correct
56 Correct 14 ms 17236 KB Output is correct
57 Correct 14 ms 17176 KB Output is correct
58 Correct 12 ms 17236 KB Output is correct
59 Correct 13 ms 17252 KB Output is correct
60 Correct 13 ms 17244 KB Output is correct
61 Correct 13 ms 17164 KB Output is correct
62 Correct 160 ms 29412 KB Output is correct
63 Correct 240 ms 30440 KB Output is correct
64 Correct 298 ms 30904 KB Output is correct
65 Correct 506 ms 34552 KB Output is correct
66 Correct 401 ms 36616 KB Output is correct
67 Correct 504 ms 36656 KB Output is correct
68 Correct 238 ms 37148 KB Output is correct
69 Correct 212 ms 36608 KB Output is correct
70 Correct 235 ms 36684 KB Output is correct
71 Correct 262 ms 36716 KB Output is correct
72 Correct 398 ms 36656 KB Output is correct
73 Correct 435 ms 36740 KB Output is correct
74 Correct 432 ms 37296 KB Output is correct
75 Correct 516 ms 36656 KB Output is correct
76 Correct 149 ms 29312 KB Output is correct
77 Correct 236 ms 29276 KB Output is correct
78 Correct 260 ms 29444 KB Output is correct
79 Correct 416 ms 36712 KB Output is correct
80 Correct 363 ms 36684 KB Output is correct
81 Correct 404 ms 39052 KB Output is correct
82 Correct 232 ms 36624 KB Output is correct
83 Correct 217 ms 36688 KB Output is correct
84 Correct 222 ms 36572 KB Output is correct
85 Correct 339 ms 36592 KB Output is correct
86 Correct 412 ms 36660 KB Output is correct
87 Correct 386 ms 36656 KB Output is correct
88 Correct 332 ms 32664 KB Output is correct
89 Correct 507 ms 39152 KB Output is correct
90 Correct 362 ms 31556 KB Output is correct
91 Correct 440 ms 41916 KB Output is correct
92 Correct 230 ms 32192 KB Output is correct
93 Correct 261 ms 32356 KB Output is correct
94 Correct 372 ms 37720 KB Output is correct
95 Correct 451 ms 39564 KB Output is correct
96 Correct 436 ms 39568 KB Output is correct
97 Correct 471 ms 41924 KB Output is correct
98 Correct 461 ms 39628 KB Output is correct
99 Correct 402 ms 39564 KB Output is correct
100 Correct 415 ms 39564 KB Output is correct
101 Correct 240 ms 39548 KB Output is correct
102 Correct 247 ms 39556 KB Output is correct
103 Correct 273 ms 39636 KB Output is correct
104 Correct 297 ms 39608 KB Output is correct
105 Correct 371 ms 39564 KB Output is correct
106 Correct 290 ms 39612 KB Output is correct
107 Correct 342 ms 39568 KB Output is correct
108 Correct 399 ms 39576 KB Output is correct
109 Correct 389 ms 41916 KB Output is correct
110 Correct 469 ms 41984 KB Output is correct
111 Correct 487 ms 39564 KB Output is correct
112 Correct 319 ms 39520 KB Output is correct
113 Correct 497 ms 41988 KB Output is correct
114 Correct 452 ms 41920 KB Output is correct
115 Correct 248 ms 39628 KB Output is correct
116 Correct 254 ms 39524 KB Output is correct
117 Correct 258 ms 39528 KB Output is correct
118 Correct 262 ms 39524 KB Output is correct
119 Correct 279 ms 39500 KB Output is correct
120 Correct 274 ms 39544 KB Output is correct