oj.uz

Submission #811937

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

multiset<int> st[2 * N];
void insert(int pos, int val) {
    for(pos += N; pos; pos >>= 1) {
        st[pos].insert(val);
    }        
}
void erase(int pos, int val) {
    for(pos += N; pos; pos >>= 1) {
        st[pos].erase(st[pos].find(val));
    }
}
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()));
            ql++;
        }
        if(qr & 1) {
            qr--;
            if(!st[qr].empty())
                res = max(res, *(--st[qr].end()));
        }
    }
    return res;
}
vector<pair<int, 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(auto [x, val] : cl[i]) 
            erase(x, val);
        dp[i] = get(0, a[i] - 1) + 1;
        insert(a[i], dp[i]);
        cl[rb[i] + 1].push_back({a[i], dp[i]});
    }
    cout << *max_element(dp.begin(), dp.end());
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 65964 KB Output is correct
2 Correct 32 ms 65972 KB Output is correct
3 Correct 32 ms 65944 KB Output is correct
4 Correct 35 ms 65944 KB Output is correct
5 Correct 43 ms 66008 KB Output is correct
6 Correct 33 ms 65876 KB Output is correct
7 Correct 33 ms 65964 KB Output is correct
8 Correct 36 ms 65928 KB Output is correct
9 Correct 33 ms 65876 KB Output is correct
10 Correct 34 ms 65920 KB Output is correct
11 Correct 40 ms 65984 KB Output is correct
12 Correct 41 ms 65868 KB Output is correct
13 Correct 40 ms 65992 KB Output is correct
14 Correct 32 ms 65988 KB Output is correct
15 Correct 35 ms 65904 KB Output is correct
16 Correct 31 ms 65916 KB Output is correct
17 Correct 32 ms 65896 KB Output is correct
18 Correct 42 ms 65984 KB Output is correct
19 Correct 34 ms 65996 KB Output is correct
20 Correct 33 ms 66004 KB Output is correct
21 Correct 32 ms 65868 KB Output is correct
22 Correct 32 ms 65924 KB Output is correct
23 Correct 40 ms 65908 KB Output is correct
24 Correct 33 ms 65976 KB Output is correct
25 Correct 41 ms 65968 KB Output is correct
26 Correct 35 ms 65880 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 65964 KB Output is correct
2 Correct 32 ms 65972 KB Output is correct
3 Correct 32 ms 65944 KB Output is correct
4 Correct 35 ms 65944 KB Output is correct
5 Correct 43 ms 66008 KB Output is correct
6 Correct 33 ms 65876 KB Output is correct
7 Correct 33 ms 65964 KB Output is correct
8 Correct 36 ms 65928 KB Output is correct
9 Correct 33 ms 65876 KB Output is correct
10 Correct 34 ms 65920 KB Output is correct
11 Correct 40 ms 65984 KB Output is correct
12 Correct 41 ms 65868 KB Output is correct
13 Correct 40 ms 65992 KB Output is correct
14 Correct 32 ms 65988 KB Output is correct
15 Correct 35 ms 65904 KB Output is correct
16 Correct 31 ms 65916 KB Output is correct
17 Correct 32 ms 65896 KB Output is correct
18 Correct 42 ms 65984 KB Output is correct
19 Correct 34 ms 65996 KB Output is correct
20 Correct 33 ms 66004 KB Output is correct
21 Correct 32 ms 65868 KB Output is correct
22 Correct 32 ms 65924 KB Output is correct
23 Correct 40 ms 65908 KB Output is correct
24 Correct 33 ms 65976 KB Output is correct
25 Correct 41 ms 65968 KB Output is correct
26 Correct 35 ms 65880 KB Output is correct
27 Correct 32 ms 65924 KB Output is correct
28 Correct 30 ms 66128 KB Output is correct
29 Correct 35 ms 66124 KB Output is correct
30 Correct 33 ms 66256 KB Output is correct
31 Correct 42 ms 66324 KB Output is correct
32 Correct 44 ms 66368 KB Output is correct
33 Correct 38 ms 66044 KB Output is correct
34 Correct 38 ms 66052 KB Output is correct
35 Correct 35 ms 66068 KB Output is correct
36 Correct 36 ms 66268 KB Output is correct
37 Correct 35 ms 65940 KB Output is correct
38 Correct 35 ms 66000 KB Output is correct
39 Correct 42 ms 66224 KB Output is correct
40 Correct 35 ms 66260 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 65964 KB Output is correct
2 Correct 32 ms 65972 KB Output is correct
3 Correct 32 ms 65944 KB Output is correct
4 Correct 35 ms 65944 KB Output is correct
5 Correct 43 ms 66008 KB Output is correct
6 Correct 33 ms 65876 KB Output is correct
7 Correct 33 ms 65964 KB Output is correct
8 Correct 36 ms 65928 KB Output is correct
9 Correct 33 ms 65876 KB Output is correct
10 Correct 34 ms 65920 KB Output is correct
11 Correct 40 ms 65984 KB Output is correct
12 Correct 41 ms 65868 KB Output is correct
13 Correct 40 ms 65992 KB Output is correct
14 Correct 32 ms 65988 KB Output is correct
15 Correct 35 ms 65904 KB Output is correct
16 Correct 31 ms 65916 KB Output is correct
17 Correct 32 ms 65896 KB Output is correct
18 Correct 42 ms 65984 KB Output is correct
19 Correct 34 ms 65996 KB Output is correct
20 Correct 33 ms 66004 KB Output is correct
21 Correct 32 ms 65868 KB Output is correct
22 Correct 32 ms 65924 KB Output is correct
23 Correct 40 ms 65908 KB Output is correct
24 Correct 33 ms 65976 KB Output is correct
25 Correct 41 ms 65968 KB Output is correct
26 Correct 35 ms 65880 KB Output is correct
27 Correct 32 ms 65924 KB Output is correct
28 Correct 30 ms 66128 KB Output is correct
29 Correct 35 ms 66124 KB Output is correct
30 Correct 33 ms 66256 KB Output is correct
31 Correct 42 ms 66324 KB Output is correct
32 Correct 44 ms 66368 KB Output is correct
33 Correct 38 ms 66044 KB Output is correct
34 Correct 38 ms 66052 KB Output is correct
35 Correct 35 ms 66068 KB Output is correct
36 Correct 36 ms 66268 KB Output is correct
37 Correct 35 ms 65940 KB Output is correct
38 Correct 35 ms 66000 KB Output is correct
39 Correct 42 ms 66224 KB Output is correct
40 Correct 35 ms 66260 KB Output is correct
41 Correct 48 ms 66332 KB Output is correct
42 Correct 49 ms 66424 KB Output is correct
43 Correct 55 ms 68304 KB Output is correct
44 Correct 55 ms 69968 KB Output is correct
45 Correct 64 ms 72284 KB Output is correct
46 Correct 60 ms 72748 KB Output is correct
47 Correct 55 ms 66836 KB Output is correct
48 Correct 59 ms 67896 KB Output is correct
49 Correct 75 ms 68828 KB Output is correct
50 Correct 66 ms 68704 KB Output is correct
51 Correct 46 ms 66388 KB Output is correct
52 Correct 52 ms 66384 KB Output is correct
53 Correct 51 ms 66388 KB Output is correct
54 Correct 63 ms 66448 KB Output is correct
55 Correct 69 ms 72148 KB Output is correct
56 Correct 64 ms 72676 KB Output is correct
57 Correct 68 ms 72088 KB Output is correct
58 Correct 57 ms 72780 KB Output is correct
59 Correct 57 ms 72780 KB Output is correct
60 Correct 63 ms 72560 KB Output is correct
61 Correct 65 ms 72512 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1897 ms 357656 KB Output is correct
2 Correct 1720 ms 118308 KB Output is correct
3 Correct 1064 ms 81364 KB Output is correct
4 Correct 792 ms 81752 KB Output is correct
5 Correct 814 ms 83828 KB Output is correct
6 Correct 1063 ms 83804 KB Output is correct
7 Correct 456 ms 84296 KB Output is correct
8 Correct 1579 ms 358300 KB Output is correct
9 Correct 446 ms 83888 KB Output is correct
10 Correct 1520 ms 218360 KB Output is correct
11 Correct 846 ms 83788 KB Output is correct
12 Correct 741 ms 83956 KB Output is correct
13 Correct 797 ms 84452 KB Output is correct
14 Correct 1022 ms 83892 KB Output is correct

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1926 ms 357728 KB Output is correct
2 Correct 2967 ms 357448 KB Output is correct
3 Execution timed out 4062 ms 357436 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 65964 KB Output is correct
2 Correct 32 ms 65972 KB Output is correct
3 Correct 32 ms 65944 KB Output is correct
4 Correct 35 ms 65944 KB Output is correct
5 Correct 43 ms 66008 KB Output is correct
6 Correct 33 ms 65876 KB Output is correct
7 Correct 33 ms 65964 KB Output is correct
8 Correct 36 ms 65928 KB Output is correct
9 Correct 33 ms 65876 KB Output is correct
10 Correct 34 ms 65920 KB Output is correct
11 Correct 40 ms 65984 KB Output is correct
12 Correct 41 ms 65868 KB Output is correct
13 Correct 40 ms 65992 KB Output is correct
14 Correct 32 ms 65988 KB Output is correct
15 Correct 35 ms 65904 KB Output is correct
16 Correct 31 ms 65916 KB Output is correct
17 Correct 32 ms 65896 KB Output is correct
18 Correct 42 ms 65984 KB Output is correct
19 Correct 34 ms 65996 KB Output is correct
20 Correct 33 ms 66004 KB Output is correct
21 Correct 32 ms 65868 KB Output is correct
22 Correct 32 ms 65924 KB Output is correct
23 Correct 40 ms 65908 KB Output is correct
24 Correct 33 ms 65976 KB Output is correct
25 Correct 41 ms 65968 KB Output is correct
26 Correct 35 ms 65880 KB Output is correct
27 Correct 32 ms 65924 KB Output is correct
28 Correct 30 ms 66128 KB Output is correct
29 Correct 35 ms 66124 KB Output is correct
30 Correct 33 ms 66256 KB Output is correct
31 Correct 42 ms 66324 KB Output is correct
32 Correct 44 ms 66368 KB Output is correct
33 Correct 38 ms 66044 KB Output is correct
34 Correct 38 ms 66052 KB Output is correct
35 Correct 35 ms 66068 KB Output is correct
36 Correct 36 ms 66268 KB Output is correct
37 Correct 35 ms 65940 KB Output is correct
38 Correct 35 ms 66000 KB Output is correct
39 Correct 42 ms 66224 KB Output is correct
40 Correct 35 ms 66260 KB Output is correct
41 Correct 48 ms 66332 KB Output is correct
42 Correct 49 ms 66424 KB Output is correct
43 Correct 55 ms 68304 KB Output is correct
44 Correct 55 ms 69968 KB Output is correct
45 Correct 64 ms 72284 KB Output is correct
46 Correct 60 ms 72748 KB Output is correct
47 Correct 55 ms 66836 KB Output is correct
48 Correct 59 ms 67896 KB Output is correct
49 Correct 75 ms 68828 KB Output is correct
50 Correct 66 ms 68704 KB Output is correct
51 Correct 46 ms 66388 KB Output is correct
52 Correct 52 ms 66384 KB Output is correct
53 Correct 51 ms 66388 KB Output is correct
54 Correct 63 ms 66448 KB Output is correct
55 Correct 69 ms 72148 KB Output is correct
56 Correct 64 ms 72676 KB Output is correct
57 Correct 68 ms 72088 KB Output is correct
58 Correct 57 ms 72780 KB Output is correct
59 Correct 57 ms 72780 KB Output is correct
60 Correct 63 ms 72560 KB Output is correct
61 Correct 65 ms 72512 KB Output is correct
62 Correct 1897 ms 357656 KB Output is correct
63 Correct 1720 ms 118308 KB Output is correct
64 Correct 1064 ms 81364 KB Output is correct
65 Correct 792 ms 81752 KB Output is correct
66 Correct 814 ms 83828 KB Output is correct
67 Correct 1063 ms 83804 KB Output is correct
68 Correct 456 ms 84296 KB Output is correct
69 Correct 1579 ms 358300 KB Output is correct
70 Correct 446 ms 83888 KB Output is correct
71 Correct 1520 ms 218360 KB Output is correct
72 Correct 846 ms 83788 KB Output is correct
73 Correct 741 ms 83956 KB Output is correct
74 Correct 797 ms 84452 KB Output is correct
75 Correct 1022 ms 83892 KB Output is correct
76 Correct 1926 ms 357728 KB Output is correct
77 Correct 2967 ms 357448 KB Output is correct
78 Execution timed out 4062 ms 357436 KB Time limit exceeded
79 Halted 0 ms 0 KB -