oj.uz

Submission #811966

# Submission time Handle Problem Language Result Execution time Memory
811966 2023-08-07T06:36:28 Z vjudge1 Financial Report (JOI21_financial) C++17
60 / 100
 4000 ms 355628 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);
}

set<pair<int, int>> st[2 * N];
void insert(int pos, int val, int i) {
    for(pos += N; pos; pos >>= 1) {
        st[pos].insert({val, i});
    }        
}
void erase(int pos, int val, int i) {
    for(pos += N; pos; pos >>= 1) {
        st[pos].erase({val, i});
    }
}
int get(int ql, int qr) {
    int res = 0;
    for(ql += N, qr += N + 1; ql < qr; ql >>= 1, qr >>= 1) {
        if(ql & 1) {
            if(!st[ql].empty())
                res = max(res, (--st[ql].end())->first);
            ql++;
        }
        if(qr & 1) {
            qr--;
            if(!st[qr].empty())
                res = max(res, (--st[qr].end())->first);
        }
    }
    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] = {};
    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;
    });
    
    for(auto [a, i] : order) {
        add(i);
        rb[i] = get_rb(i);
    }
    vector<int> dp(n + 1, 1);
    for(int i = 1; i <= n; i++) {
        for(int j : cl[i]) 
            erase(a[j], dp[j], j);
        dp[i] = get(0, a[i] - 1) + 1;
        insert(a[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 33 ms 65944 KB Output is correct
2 Correct 32 ms 65876 KB Output is correct
3 Correct 33 ms 65916 KB Output is correct
4 Correct 37 ms 66004 KB Output is correct
5 Correct 33 ms 66004 KB Output is correct
6 Correct 33 ms 65904 KB Output is correct
7 Correct 33 ms 66004 KB Output is correct
8 Correct 32 ms 65956 KB Output is correct
9 Correct 32 ms 65908 KB Output is correct
10 Correct 32 ms 65936 KB Output is correct
11 Correct 33 ms 65984 KB Output is correct
12 Correct 33 ms 65980 KB Output is correct
13 Correct 32 ms 66004 KB Output is correct
14 Correct 31 ms 65864 KB Output is correct
15 Correct 33 ms 65908 KB Output is correct
16 Correct 33 ms 65964 KB Output is correct
17 Correct 32 ms 65948 KB Output is correct
18 Correct 33 ms 65904 KB Output is correct
19 Correct 33 ms 65956 KB Output is correct
20 Correct 32 ms 66004 KB Output is correct
21 Correct 32 ms 65948 KB Output is correct
22 Correct 32 ms 65872 KB Output is correct
23 Correct 32 ms 65964 KB Output is correct
24 Correct 32 ms 66004 KB Output is correct
25 Correct 34 ms 66004 KB Output is correct
26 Correct 32 ms 65948 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 65944 KB Output is correct
2 Correct 32 ms 65876 KB Output is correct
3 Correct 33 ms 65916 KB Output is correct
4 Correct 37 ms 66004 KB Output is correct
5 Correct 33 ms 66004 KB Output is correct
6 Correct 33 ms 65904 KB Output is correct
7 Correct 33 ms 66004 KB Output is correct
8 Correct 32 ms 65956 KB Output is correct
9 Correct 32 ms 65908 KB Output is correct
10 Correct 32 ms 65936 KB Output is correct
11 Correct 33 ms 65984 KB Output is correct
12 Correct 33 ms 65980 KB Output is correct
13 Correct 32 ms 66004 KB Output is correct
14 Correct 31 ms 65864 KB Output is correct
15 Correct 33 ms 65908 KB Output is correct
16 Correct 33 ms 65964 KB Output is correct
17 Correct 32 ms 65948 KB Output is correct
18 Correct 33 ms 65904 KB Output is correct
19 Correct 33 ms 65956 KB Output is correct
20 Correct 32 ms 66004 KB Output is correct
21 Correct 32 ms 65948 KB Output is correct
22 Correct 32 ms 65872 KB Output is correct
23 Correct 32 ms 65964 KB Output is correct
24 Correct 32 ms 66004 KB Output is correct
25 Correct 34 ms 66004 KB Output is correct
26 Correct 32 ms 65948 KB Output is correct
27 Correct 32 ms 65964 KB Output is correct
28 Correct 33 ms 66076 KB Output is correct
29 Correct 33 ms 66156 KB Output is correct
30 Correct 32 ms 66180 KB Output is correct
31 Correct 43 ms 66316 KB Output is correct
32 Correct 31 ms 66388 KB Output is correct
33 Correct 32 ms 66004 KB Output is correct
34 Correct 32 ms 66000 KB Output is correct
35 Correct 32 ms 66048 KB Output is correct
36 Correct 39 ms 66252 KB Output is correct
37 Correct 38 ms 65936 KB Output is correct
38 Correct 39 ms 66028 KB Output is correct
39 Correct 41 ms 66272 KB Output is correct
40 Correct 30 ms 66260 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 65944 KB Output is correct
2 Correct 32 ms 65876 KB Output is correct
3 Correct 33 ms 65916 KB Output is correct
4 Correct 37 ms 66004 KB Output is correct
5 Correct 33 ms 66004 KB Output is correct
6 Correct 33 ms 65904 KB Output is correct
7 Correct 33 ms 66004 KB Output is correct
8 Correct 32 ms 65956 KB Output is correct
9 Correct 32 ms 65908 KB Output is correct
10 Correct 32 ms 65936 KB Output is correct
11 Correct 33 ms 65984 KB Output is correct
12 Correct 33 ms 65980 KB Output is correct
13 Correct 32 ms 66004 KB Output is correct
14 Correct 31 ms 65864 KB Output is correct
15 Correct 33 ms 65908 KB Output is correct
16 Correct 33 ms 65964 KB Output is correct
17 Correct 32 ms 65948 KB Output is correct
18 Correct 33 ms 65904 KB Output is correct
19 Correct 33 ms 65956 KB Output is correct
20 Correct 32 ms 66004 KB Output is correct
21 Correct 32 ms 65948 KB Output is correct
22 Correct 32 ms 65872 KB Output is correct
23 Correct 32 ms 65964 KB Output is correct
24 Correct 32 ms 66004 KB Output is correct
25 Correct 34 ms 66004 KB Output is correct
26 Correct 32 ms 65948 KB Output is correct
27 Correct 32 ms 65964 KB Output is correct
28 Correct 33 ms 66076 KB Output is correct
29 Correct 33 ms 66156 KB Output is correct
30 Correct 32 ms 66180 KB Output is correct
31 Correct 43 ms 66316 KB Output is correct
32 Correct 31 ms 66388 KB Output is correct
33 Correct 32 ms 66004 KB Output is correct
34 Correct 32 ms 66000 KB Output is correct
35 Correct 32 ms 66048 KB Output is correct
36 Correct 39 ms 66252 KB Output is correct
37 Correct 38 ms 65936 KB Output is correct
38 Correct 39 ms 66028 KB Output is correct
39 Correct 41 ms 66272 KB Output is correct
40 Correct 30 ms 66260 KB Output is correct
41 Correct 42 ms 66260 KB Output is correct
42 Correct 63 ms 66304 KB Output is correct
43 Correct 48 ms 68196 KB Output is correct
44 Correct 67 ms 69848 KB Output is correct
45 Correct 53 ms 72124 KB Output is correct
46 Correct 54 ms 72708 KB Output is correct
47 Correct 48 ms 66740 KB Output is correct
48 Correct 53 ms 67808 KB Output is correct
49 Correct 69 ms 68716 KB Output is correct
50 Correct 60 ms 68676 KB Output is correct
51 Correct 57 ms 66380 KB Output is correct
52 Correct 49 ms 66260 KB Output is correct
53 Correct 43 ms 66324 KB Output is correct
54 Correct 50 ms 66376 KB Output is correct
55 Correct 58 ms 72124 KB Output is correct
56 Correct 59 ms 72552 KB Output is correct
57 Correct 65 ms 72000 KB Output is correct
58 Correct 57 ms 72612 KB Output is correct
59 Correct 55 ms 72616 KB Output is correct
60 Correct 59 ms 72464 KB Output is correct
61 Correct 55 ms 72444 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2001 ms 354772 KB Output is correct
2 Correct 1247 ms 116284 KB Output is correct
3 Correct 833 ms 79144 KB Output is correct
4 Correct 823 ms 80340 KB Output is correct
5 Correct 688 ms 82344 KB Output is correct
6 Correct 828 ms 82396 KB Output is correct
7 Correct 493 ms 82988 KB Output is correct
8 Correct 1443 ms 355628 KB Output is correct
9 Correct 505 ms 82388 KB Output is correct
10 Correct 1385 ms 216244 KB Output is correct
11 Correct 734 ms 82396 KB Output is correct
12 Correct 751 ms 82372 KB Output is correct
13 Correct 783 ms 82936 KB Output is correct
14 Correct 905 ms 82404 KB Output is correct

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1758 ms 354792 KB Output is correct
2 Correct 2662 ms 354820 KB Output is correct
3 Execution timed out 4094 ms 354804 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 65944 KB Output is correct
2 Correct 32 ms 65876 KB Output is correct
3 Correct 33 ms 65916 KB Output is correct
4 Correct 37 ms 66004 KB Output is correct
5 Correct 33 ms 66004 KB Output is correct
6 Correct 33 ms 65904 KB Output is correct
7 Correct 33 ms 66004 KB Output is correct
8 Correct 32 ms 65956 KB Output is correct
9 Correct 32 ms 65908 KB Output is correct
10 Correct 32 ms 65936 KB Output is correct
11 Correct 33 ms 65984 KB Output is correct
12 Correct 33 ms 65980 KB Output is correct
13 Correct 32 ms 66004 KB Output is correct
14 Correct 31 ms 65864 KB Output is correct
15 Correct 33 ms 65908 KB Output is correct
16 Correct 33 ms 65964 KB Output is correct
17 Correct 32 ms 65948 KB Output is correct
18 Correct 33 ms 65904 KB Output is correct
19 Correct 33 ms 65956 KB Output is correct
20 Correct 32 ms 66004 KB Output is correct
21 Correct 32 ms 65948 KB Output is correct
22 Correct 32 ms 65872 KB Output is correct
23 Correct 32 ms 65964 KB Output is correct
24 Correct 32 ms 66004 KB Output is correct
25 Correct 34 ms 66004 KB Output is correct
26 Correct 32 ms 65948 KB Output is correct
27 Correct 32 ms 65964 KB Output is correct
28 Correct 33 ms 66076 KB Output is correct
29 Correct 33 ms 66156 KB Output is correct
30 Correct 32 ms 66180 KB Output is correct
31 Correct 43 ms 66316 KB Output is correct
32 Correct 31 ms 66388 KB Output is correct
33 Correct 32 ms 66004 KB Output is correct
34 Correct 32 ms 66000 KB Output is correct
35 Correct 32 ms 66048 KB Output is correct
36 Correct 39 ms 66252 KB Output is correct
37 Correct 38 ms 65936 KB Output is correct
38 Correct 39 ms 66028 KB Output is correct
39 Correct 41 ms 66272 KB Output is correct
40 Correct 30 ms 66260 KB Output is correct
41 Correct 42 ms 66260 KB Output is correct
42 Correct 63 ms 66304 KB Output is correct
43 Correct 48 ms 68196 KB Output is correct
44 Correct 67 ms 69848 KB Output is correct
45 Correct 53 ms 72124 KB Output is correct
46 Correct 54 ms 72708 KB Output is correct
47 Correct 48 ms 66740 KB Output is correct
48 Correct 53 ms 67808 KB Output is correct
49 Correct 69 ms 68716 KB Output is correct
50 Correct 60 ms 68676 KB Output is correct
51 Correct 57 ms 66380 KB Output is correct
52 Correct 49 ms 66260 KB Output is correct
53 Correct 43 ms 66324 KB Output is correct
54 Correct 50 ms 66376 KB Output is correct
55 Correct 58 ms 72124 KB Output is correct
56 Correct 59 ms 72552 KB Output is correct
57 Correct 65 ms 72000 KB Output is correct
58 Correct 57 ms 72612 KB Output is correct
59 Correct 55 ms 72616 KB Output is correct
60 Correct 59 ms 72464 KB Output is correct
61 Correct 55 ms 72444 KB Output is correct
62 Correct 2001 ms 354772 KB Output is correct
63 Correct 1247 ms 116284 KB Output is correct
64 Correct 833 ms 79144 KB Output is correct
65 Correct 823 ms 80340 KB Output is correct
66 Correct 688 ms 82344 KB Output is correct
67 Correct 828 ms 82396 KB Output is correct
68 Correct 493 ms 82988 KB Output is correct
69 Correct 1443 ms 355628 KB Output is correct
70 Correct 505 ms 82388 KB Output is correct
71 Correct 1385 ms 216244 KB Output is correct
72 Correct 734 ms 82396 KB Output is correct
73 Correct 751 ms 82372 KB Output is correct
74 Correct 783 ms 82936 KB Output is correct
75 Correct 905 ms 82404 KB Output is correct
76 Correct 1758 ms 354792 KB Output is correct
77 Correct 2662 ms 354820 KB Output is correct
78 Execution timed out 4094 ms 354804 KB Time limit exceeded
79 Halted 0 ms 0 KB -