oj.uz

Submission #423464

# Submission time Handle Problem Language Result Execution time Memory
423464 2021-06-11T07:26:32 Z qwerasdfzxcl Financial Report (JOI21_financial) C++14
100 / 100
 1967 ms 180496 KB 
#include <bits/stdc++.h>

typedef long long ll;
using namespace std;
int a[300300], dp[300300];
struct Seg1{
    vector<int> tree; int sz;
    void init(int n){
        sz = n;
        tree.resize(n*2);
    }
    void init2(int n, int* b){
        sz = n;
        tree.resize(n*2);
        for (int i=sz;i<sz*2;i++) tree[i] = b[i-sz];
        for (int i=sz-1;i;i--) tree[i] = max(tree[i<<1], tree[i<<1|1]);
    }
    void update(int p, int x){
        for (tree[p+=sz]=x;p>1;p>>=1) tree[p>>1] = max(tree[p], tree[p^1]);
    }
    int query(int l, int r = -1){
        int ret = 0;
        if (r==-1) r = sz;
        for (l += sz, r += sz;l<r;l>>=1, r>>=1){
            if (l&1) ret = max(ret, tree[l++]);
            if (r&1) ret = max(tree[--r], ret);
        }
        return ret;
    }
}TREE3;
struct MST{
    vector<pair<int, int>> tree[600600];
    Seg1 tree2[600600];
    int sz;
    int sp[300300][20], h[600600];
    void init(int n){
        sz = n;
        for (int i=sz;i<sz*2;i++){
            tree[i] = {make_pair(a[i-sz], i-sz)};
            tree2[i].init(tree[i].size());
            sp[i-sz][0] = 0;
        }
        for (int i=sz-1;i;i--){
            tree[i].resize(tree[i<<1].size()+tree[i<<1|1].size());
            merge(tree[i<<1].begin(), tree[i<<1].end(), tree[i<<1|1].begin(), tree[i<<1|1].end(), tree[i].begin());
            tree2[i].init(tree[i].size());
            h[i] = max(h[i<<1], h[i<<1|1])+1;
            for (int j=0;j<(int)tree[i].size();j++) sp[tree[i][j].second][h[i]] = j;
        }
    }
    void update(int p, int val){
        int x = p;
        for (p += sz;p;p>>=1){
            tree2[p].update(sp[x][h[p]], val);
        }
    }
    int query(int l, int r, int x){
        pair<int, int> p = make_pair(x, 1e9);
        int ret = 0;
        for (l += sz, r += sz;l<r;l>>=1, r>>=1){
            if (l&1){
                int idx = upper_bound(tree[l].begin(), tree[l].end(), p)-tree[l].begin();
                ret = max(ret, tree2[l].query(idx));
                l++;
            }
            if (r&1){
                --r;
                int idx = upper_bound(tree[r].begin(), tree[r].end(), p)-tree[r].begin();
                ret = max(ret, tree2[r].query(idx));
            }
        }
        return ret;
    }
}TREE1;

int b[300300];
struct MinSeg{
    int tree[600600], sz;
    void init(int n){
        sz = n;
        for (int i=sz;i<sz*2;i++) tree[i] = a[i-sz];
        for (int i=sz-1;i;i--) tree[i] = min(tree[i<<1], tree[i<<1|1]);
    }
    int query(int l, int r){
        int ret = 1e9;
        for (l += sz, r += sz;l<r;l>>=1, r>>=1){
            if (l&1) ret = min(ret, tree[l++]);
            if (r&1) ret = min(ret, tree[--r]);
        }
        return ret;
    }
}TREE2;

int main(){
    cin.tie(NULL);
    ios_base::sync_with_stdio(false);
    int n, k;
    cin >> n >> k;
    for (int i=0;i<n;i++) cin >> a[i];
    TREE1.init(n);
    TREE2.init(n);
    for (int i=0;i<n-k+1;i++) b[i] = TREE2.query(i, i+k);
    TREE3.init2(n-k+1, b);

    int ans = 1;
    for (int i=n-1;i>=0;i--){
        int l = i+1, r = n-k+1, idx = i;
        while(l<r){
            int m = (l+r)>>1;
            int tmp = TREE3.query(i, m+1);
            if (tmp>a[i]) r = m;
            else l = m+1, idx = m;
        }
        idx = min(idx+k, n-1);
        dp[i] = TREE1.query(i+1, idx+1, a[i])+1;
        TREE1.update(i, dp[i]);
        ans = max(ans, dp[i]);
    }
    cout << ans;

    return 0;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 33248 KB Output is correct
2 Correct 18 ms 33208 KB Output is correct
3 Correct 18 ms 33252 KB Output is correct
4 Correct 21 ms 33260 KB Output is correct
5 Correct 20 ms 33204 KB Output is correct
6 Correct 18 ms 33264 KB Output is correct
7 Correct 19 ms 33228 KB Output is correct
8 Correct 18 ms 33148 KB Output is correct
9 Correct 18 ms 33228 KB Output is correct
10 Correct 18 ms 33144 KB Output is correct
11 Correct 19 ms 33216 KB Output is correct
12 Correct 22 ms 33160 KB Output is correct
13 Correct 18 ms 33196 KB Output is correct
14 Correct 18 ms 33228 KB Output is correct
15 Correct 20 ms 33144 KB Output is correct
16 Correct 18 ms 33168 KB Output is correct
17 Correct 18 ms 33224 KB Output is correct
18 Correct 18 ms 33156 KB Output is correct
19 Correct 18 ms 33264 KB Output is correct
20 Correct 20 ms 33264 KB Output is correct
21 Correct 18 ms 33228 KB Output is correct
22 Correct 18 ms 33176 KB Output is correct
23 Correct 18 ms 33156 KB Output is correct
24 Correct 18 ms 33236 KB Output is correct
25 Correct 21 ms 33228 KB Output is correct
26 Correct 18 ms 33196 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 33248 KB Output is correct
2 Correct 18 ms 33208 KB Output is correct
3 Correct 18 ms 33252 KB Output is correct
4 Correct 21 ms 33260 KB Output is correct
5 Correct 20 ms 33204 KB Output is correct
6 Correct 18 ms 33264 KB Output is correct
7 Correct 19 ms 33228 KB Output is correct
8 Correct 18 ms 33148 KB Output is correct
9 Correct 18 ms 33228 KB Output is correct
10 Correct 18 ms 33144 KB Output is correct
11 Correct 19 ms 33216 KB Output is correct
12 Correct 22 ms 33160 KB Output is correct
13 Correct 18 ms 33196 KB Output is correct
14 Correct 18 ms 33228 KB Output is correct
15 Correct 20 ms 33144 KB Output is correct
16 Correct 18 ms 33168 KB Output is correct
17 Correct 18 ms 33224 KB Output is correct
18 Correct 18 ms 33156 KB Output is correct
19 Correct 18 ms 33264 KB Output is correct
20 Correct 20 ms 33264 KB Output is correct
21 Correct 18 ms 33228 KB Output is correct
22 Correct 18 ms 33176 KB Output is correct
23 Correct 18 ms 33156 KB Output is correct
24 Correct 18 ms 33236 KB Output is correct
25 Correct 21 ms 33228 KB Output is correct
26 Correct 18 ms 33196 KB Output is correct
27 Correct 18 ms 33476 KB Output is correct
28 Correct 18 ms 33352 KB Output is correct
29 Correct 20 ms 33356 KB Output is correct
30 Correct 19 ms 33288 KB Output is correct
31 Correct 19 ms 33356 KB Output is correct
32 Correct 19 ms 33312 KB Output is correct
33 Correct 18 ms 33356 KB Output is correct
34 Correct 19 ms 33324 KB Output is correct
35 Correct 20 ms 33300 KB Output is correct
36 Correct 22 ms 33336 KB Output is correct
37 Correct 21 ms 33360 KB Output is correct
38 Correct 18 ms 33356 KB Output is correct
39 Correct 18 ms 33332 KB Output is correct
40 Correct 18 ms 33404 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 33248 KB Output is correct
2 Correct 18 ms 33208 KB Output is correct
3 Correct 18 ms 33252 KB Output is correct
4 Correct 21 ms 33260 KB Output is correct
5 Correct 20 ms 33204 KB Output is correct
6 Correct 18 ms 33264 KB Output is correct
7 Correct 19 ms 33228 KB Output is correct
8 Correct 18 ms 33148 KB Output is correct
9 Correct 18 ms 33228 KB Output is correct
10 Correct 18 ms 33144 KB Output is correct
11 Correct 19 ms 33216 KB Output is correct
12 Correct 22 ms 33160 KB Output is correct
13 Correct 18 ms 33196 KB Output is correct
14 Correct 18 ms 33228 KB Output is correct
15 Correct 20 ms 33144 KB Output is correct
16 Correct 18 ms 33168 KB Output is correct
17 Correct 18 ms 33224 KB Output is correct
18 Correct 18 ms 33156 KB Output is correct
19 Correct 18 ms 33264 KB Output is correct
20 Correct 20 ms 33264 KB Output is correct
21 Correct 18 ms 33228 KB Output is correct
22 Correct 18 ms 33176 KB Output is correct
23 Correct 18 ms 33156 KB Output is correct
24 Correct 18 ms 33236 KB Output is correct
25 Correct 21 ms 33228 KB Output is correct
26 Correct 18 ms 33196 KB Output is correct
27 Correct 18 ms 33476 KB Output is correct
28 Correct 18 ms 33352 KB Output is correct
29 Correct 20 ms 33356 KB Output is correct
30 Correct 19 ms 33288 KB Output is correct
31 Correct 19 ms 33356 KB Output is correct
32 Correct 19 ms 33312 KB Output is correct
33 Correct 18 ms 33356 KB Output is correct
34 Correct 19 ms 33324 KB Output is correct
35 Correct 20 ms 33300 KB Output is correct
36 Correct 22 ms 33336 KB Output is correct
37 Correct 21 ms 33360 KB Output is correct
38 Correct 18 ms 33356 KB Output is correct
39 Correct 18 ms 33332 KB Output is correct
40 Correct 18 ms 33404 KB Output is correct
41 Correct 34 ms 36044 KB Output is correct
42 Correct 31 ms 36036 KB Output is correct
43 Correct 38 ms 36048 KB Output is correct
44 Correct 35 ms 35628 KB Output is correct
45 Correct 36 ms 35868 KB Output is correct
46 Correct 30 ms 35920 KB Output is correct
47 Correct 31 ms 35912 KB Output is correct
48 Correct 36 ms 36004 KB Output is correct
49 Correct 41 ms 36052 KB Output is correct
50 Correct 36 ms 35956 KB Output is correct
51 Correct 34 ms 35976 KB Output is correct
52 Correct 30 ms 36012 KB Output is correct
53 Correct 34 ms 35956 KB Output is correct
54 Correct 32 ms 36044 KB Output is correct
55 Correct 38 ms 36080 KB Output is correct
56 Correct 39 ms 36044 KB Output is correct
57 Correct 38 ms 36068 KB Output is correct
58 Correct 28 ms 35944 KB Output is correct
59 Correct 27 ms 35968 KB Output is correct
60 Correct 34 ms 35916 KB Output is correct
61 Correct 36 ms 36036 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1174 ms 180228 KB Output is correct
2 Correct 919 ms 180272 KB Output is correct
3 Correct 923 ms 180292 KB Output is correct
4 Correct 952 ms 180268 KB Output is correct
5 Correct 862 ms 180216 KB Output is correct
6 Correct 941 ms 180208 KB Output is correct
7 Correct 774 ms 179316 KB Output is correct
8 Correct 1127 ms 179756 KB Output is correct
9 Correct 797 ms 180168 KB Output is correct
10 Correct 980 ms 180152 KB Output is correct
11 Correct 858 ms 180272 KB Output is correct
12 Correct 899 ms 180220 KB Output is correct
13 Correct 902 ms 180180 KB Output is correct
14 Correct 971 ms 180220 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 633 ms 176728 KB Output is correct
2 Correct 1206 ms 176640 KB Output is correct
3 Correct 1393 ms 176824 KB Output is correct
4 Correct 1372 ms 176628 KB Output is correct
5 Correct 1149 ms 176724 KB Output is correct
6 Correct 1351 ms 176720 KB Output is correct
7 Correct 747 ms 176732 KB Output is correct
8 Correct 645 ms 176684 KB Output is correct
9 Correct 705 ms 175660 KB Output is correct
10 Correct 1004 ms 176388 KB Output is correct
11 Correct 1317 ms 176888 KB Output is correct
12 Correct 1044 ms 176684 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 33248 KB Output is correct
2 Correct 18 ms 33208 KB Output is correct
3 Correct 18 ms 33252 KB Output is correct
4 Correct 21 ms 33260 KB Output is correct
5 Correct 20 ms 33204 KB Output is correct
6 Correct 18 ms 33264 KB Output is correct
7 Correct 19 ms 33228 KB Output is correct
8 Correct 18 ms 33148 KB Output is correct
9 Correct 18 ms 33228 KB Output is correct
10 Correct 18 ms 33144 KB Output is correct
11 Correct 19 ms 33216 KB Output is correct
12 Correct 22 ms 33160 KB Output is correct
13 Correct 18 ms 33196 KB Output is correct
14 Correct 18 ms 33228 KB Output is correct
15 Correct 20 ms 33144 KB Output is correct
16 Correct 18 ms 33168 KB Output is correct
17 Correct 18 ms 33224 KB Output is correct
18 Correct 18 ms 33156 KB Output is correct
19 Correct 18 ms 33264 KB Output is correct
20 Correct 20 ms 33264 KB Output is correct
21 Correct 18 ms 33228 KB Output is correct
22 Correct 18 ms 33176 KB Output is correct
23 Correct 18 ms 33156 KB Output is correct
24 Correct 18 ms 33236 KB Output is correct
25 Correct 21 ms 33228 KB Output is correct
26 Correct 18 ms 33196 KB Output is correct
27 Correct 18 ms 33476 KB Output is correct
28 Correct 18 ms 33352 KB Output is correct
29 Correct 20 ms 33356 KB Output is correct
30 Correct 19 ms 33288 KB Output is correct
31 Correct 19 ms 33356 KB Output is correct
32 Correct 19 ms 33312 KB Output is correct
33 Correct 18 ms 33356 KB Output is correct
34 Correct 19 ms 33324 KB Output is correct
35 Correct 20 ms 33300 KB Output is correct
36 Correct 22 ms 33336 KB Output is correct
37 Correct 21 ms 33360 KB Output is correct
38 Correct 18 ms 33356 KB Output is correct
39 Correct 18 ms 33332 KB Output is correct
40 Correct 18 ms 33404 KB Output is correct
41 Correct 34 ms 36044 KB Output is correct
42 Correct 31 ms 36036 KB Output is correct
43 Correct 38 ms 36048 KB Output is correct
44 Correct 35 ms 35628 KB Output is correct
45 Correct 36 ms 35868 KB Output is correct
46 Correct 30 ms 35920 KB Output is correct
47 Correct 31 ms 35912 KB Output is correct
48 Correct 36 ms 36004 KB Output is correct
49 Correct 41 ms 36052 KB Output is correct
50 Correct 36 ms 35956 KB Output is correct
51 Correct 34 ms 35976 KB Output is correct
52 Correct 30 ms 36012 KB Output is correct
53 Correct 34 ms 35956 KB Output is correct
54 Correct 32 ms 36044 KB Output is correct
55 Correct 38 ms 36080 KB Output is correct
56 Correct 39 ms 36044 KB Output is correct
57 Correct 38 ms 36068 KB Output is correct
58 Correct 28 ms 35944 KB Output is correct
59 Correct 27 ms 35968 KB Output is correct
60 Correct 34 ms 35916 KB Output is correct
61 Correct 36 ms 36036 KB Output is correct
62 Correct 1174 ms 180228 KB Output is correct
63 Correct 919 ms 180272 KB Output is correct
64 Correct 923 ms 180292 KB Output is correct
65 Correct 952 ms 180268 KB Output is correct
66 Correct 862 ms 180216 KB Output is correct
67 Correct 941 ms 180208 KB Output is correct
68 Correct 774 ms 179316 KB Output is correct
69 Correct 1127 ms 179756 KB Output is correct
70 Correct 797 ms 180168 KB Output is correct
71 Correct 980 ms 180152 KB Output is correct
72 Correct 858 ms 180272 KB Output is correct
73 Correct 899 ms 180220 KB Output is correct
74 Correct 902 ms 180180 KB Output is correct
75 Correct 971 ms 180220 KB Output is correct
76 Correct 633 ms 176728 KB Output is correct
77 Correct 1206 ms 176640 KB Output is correct
78 Correct 1393 ms 176824 KB Output is correct
79 Correct 1372 ms 176628 KB Output is correct
80 Correct 1149 ms 176724 KB Output is correct
81 Correct 1351 ms 176720 KB Output is correct
82 Correct 747 ms 176732 KB Output is correct
83 Correct 645 ms 176684 KB Output is correct
84 Correct 705 ms 175660 KB Output is correct
85 Correct 1004 ms 176388 KB Output is correct
86 Correct 1317 ms 176888 KB Output is correct
87 Correct 1044 ms 176684 KB Output is correct
88 Correct 1024 ms 180144 KB Output is correct
89 Correct 1084 ms 180300 KB Output is correct
90 Correct 1474 ms 180168 KB Output is correct
91 Correct 1967 ms 180216 KB Output is correct
92 Correct 1672 ms 180300 KB Output is correct
93 Correct 1850 ms 180088 KB Output is correct
94 Correct 1464 ms 177680 KB Output is correct
95 Correct 998 ms 180128 KB Output is correct
96 Correct 1499 ms 180164 KB Output is correct
97 Correct 1743 ms 180396 KB Output is correct
98 Correct 1894 ms 180276 KB Output is correct
99 Correct 1906 ms 180308 KB Output is correct
100 Correct 1909 ms 180384 KB Output is correct
101 Correct 834 ms 180272 KB Output is correct
102 Correct 940 ms 180264 KB Output is correct
103 Correct 1140 ms 180284 KB Output is correct
104 Correct 1360 ms 180132 KB Output is correct
105 Correct 1602 ms 179968 KB Output is correct
106 Correct 1302 ms 180252 KB Output is correct
107 Correct 1458 ms 180496 KB Output is correct
108 Correct 1722 ms 180192 KB Output is correct
109 Correct 926 ms 180156 KB Output is correct
110 Correct 1636 ms 180316 KB Output is correct
111 Correct 1847 ms 180376 KB Output is correct
112 Correct 1466 ms 180168 KB Output is correct
113 Correct 1929 ms 180284 KB Output is correct
114 Correct 1863 ms 180140 KB Output is correct
115 Correct 640 ms 176816 KB Output is correct
116 Correct 632 ms 176796 KB Output is correct
117 Correct 897 ms 178460 KB Output is correct
118 Correct 882 ms 178504 KB Output is correct
119 Correct 1512 ms 179988 KB Output is correct
120 Correct 1634 ms 180056 KB Output is correct