oj.uz

Submission #763244

# Submission time Handle Problem Language Result Execution time Memory
763244 2023-06-22T07:08:52 Z huutuan Financial Report (JOI21_financial) C++14
100 / 100
 344 ms 31656 KB 
#include<bits/stdc++.h>

using namespace std;

#define int long long
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)x.size())
#define sumof(x) accumulate(all(x), 0ll)

struct LZST_node{
    int x, lz;
    LZST_node (int a=0, int b=-1): x(a), lz(b){}
    friend LZST_node sus(const LZST_node& a, const LZST_node& b){
        return LZST_node(max(a.x, b.x));
    }
};

struct LazySegmentTree{
    int n; vector<LZST_node> t;

    void init(int _n){
        n=_n;
        t.assign(4*n+1, LZST_node());
    }

    void down(int k, int l, int r){
        int cc=t[k].lz;
        if (cc==-1) return;
        t[k<<1].x=cc;
        t[k<<1|1].x=cc;
        t[k<<1].lz=cc;
        t[k<<1|1].lz=cc;
        t[k].lz=-1;
    }

    void build(int k, int l, int r, int* a){
        if (l==r){
            t[k]=LZST_node(a[l]);
            return;
        }
        int mid=(l+r)>>1;
        build(k<<1, l, mid, a);
        build(k<<1|1, mid+1, r, a);
        t[k]=sus(t[k<<1], t[k<<1|1]);
    }

    void init(int _n, int* a){
        init(_n);
        build(1, 1, n, a);
    }

    void update(int k, int l, int r, int L, int R, int val){
        if (r<L || R<l) return;
        if (L<=l && r<=R){
            t[k].x=val;
            t[k].lz=val;
            return;
        }
        down(k, l, r);
        int mid=(l+r)>>1;
        update(k<<1, l, mid, L, R, val);
        update(k<<1|1, mid+1, r, L, R, val);
        t[k]=sus(t[k<<1], t[k<<1|1]);
    }

    LZST_node get(int k, int l, int r, int L, int R){
        if (r<L || R<l) return t[0];
        if (L<=l && r<=R) return t[k];
        down(k, l, r);
        int mid=(l+r)>>1;
        return sus(get(k<<1, l, mid, L, R), get(k<<1|1, mid+1, r, L, R));
    }

    void update(int L, int R, int val){
        update(1, 1, n, L, R, val);
    }

    int get(int l, int r){
        return get(1, 1, n, l, r).x;
    }
} st;

const int N=3e5+1;
int n, d, a[N], f[N], min_d[N];

void solve(int tc){
    // cout << "Case #" << tc << ": ";
    cin >> n >> d;
    vector<int> v;
    for (int i=1; i<=n; ++i) cin >> a[i], v.push_back(a[i]);
    sort(all(v)); v.resize(unique(all(v))-v.begin());
    for (int i=1; i<=n; ++i) a[i]=lower_bound(all(v), a[i])-v.begin()+1;
    deque<int> dq;
    for (int i=1; i<=n; ++i){
        while (dq.size() && a[i]<=a[dq.back()]) dq.pop_back();
        while (dq.size() && i-dq.front()>=d) dq.pop_front();
        dq.push_back(i);
        if (i>=d) min_d[i]=a[dq.front()];
    }
    st.init(N);
    for (int i=1; i<=n; ++i){
        f[i]=1;
        f[i]=max(f[i], st.get(1, a[i]-1)+1);
        st.update(a[i], a[i], max(st.get(a[i], a[i]), f[i]));
        f[i]=max(f[i], st.get(a[i], N));
        if (i>=d) st.update(1, min_d[i]-1, 0);
    }
    cout << f[n];
}

int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int ntests=1;
    // cin >> ntests;
    for (int i=1; i<=ntests; ++i) solve(i);
    return 0;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 19028 KB Output is correct
2 Correct 7 ms 19028 KB Output is correct
3 Correct 8 ms 19028 KB Output is correct
4 Correct 8 ms 19028 KB Output is correct
5 Correct 8 ms 19028 KB Output is correct
6 Correct 8 ms 19028 KB Output is correct
7 Correct 8 ms 19120 KB Output is correct
8 Correct 7 ms 19028 KB Output is correct
9 Correct 8 ms 19068 KB Output is correct
10 Correct 8 ms 19128 KB Output is correct
11 Correct 8 ms 19028 KB Output is correct
12 Correct 7 ms 19028 KB Output is correct
13 Correct 8 ms 19028 KB Output is correct
14 Correct 8 ms 19120 KB Output is correct
15 Correct 8 ms 19028 KB Output is correct
16 Correct 7 ms 19040 KB Output is correct
17 Correct 8 ms 19124 KB Output is correct
18 Correct 8 ms 19028 KB Output is correct
19 Correct 10 ms 19132 KB Output is correct
20 Correct 8 ms 19028 KB Output is correct
21 Correct 8 ms 19028 KB Output is correct
22 Correct 8 ms 19028 KB Output is correct
23 Correct 8 ms 19108 KB Output is correct
24 Correct 8 ms 19028 KB Output is correct
25 Correct 8 ms 19016 KB Output is correct
26 Correct 8 ms 19028 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 19028 KB Output is correct
2 Correct 7 ms 19028 KB Output is correct
3 Correct 8 ms 19028 KB Output is correct
4 Correct 8 ms 19028 KB Output is correct
5 Correct 8 ms 19028 KB Output is correct
6 Correct 8 ms 19028 KB Output is correct
7 Correct 8 ms 19120 KB Output is correct
8 Correct 7 ms 19028 KB Output is correct
9 Correct 8 ms 19068 KB Output is correct
10 Correct 8 ms 19128 KB Output is correct
11 Correct 8 ms 19028 KB Output is correct
12 Correct 7 ms 19028 KB Output is correct
13 Correct 8 ms 19028 KB Output is correct
14 Correct 8 ms 19120 KB Output is correct
15 Correct 8 ms 19028 KB Output is correct
16 Correct 7 ms 19040 KB Output is correct
17 Correct 8 ms 19124 KB Output is correct
18 Correct 8 ms 19028 KB Output is correct
19 Correct 10 ms 19132 KB Output is correct
20 Correct 8 ms 19028 KB Output is correct
21 Correct 8 ms 19028 KB Output is correct
22 Correct 8 ms 19028 KB Output is correct
23 Correct 8 ms 19108 KB Output is correct
24 Correct 8 ms 19028 KB Output is correct
25 Correct 8 ms 19016 KB Output is correct
26 Correct 8 ms 19028 KB Output is correct
27 Correct 8 ms 19156 KB Output is correct
28 Correct 8 ms 19156 KB Output is correct
29 Correct 8 ms 19156 KB Output is correct
30 Correct 9 ms 19108 KB Output is correct
31 Correct 8 ms 19156 KB Output is correct
32 Correct 8 ms 19156 KB Output is correct
33 Correct 9 ms 19156 KB Output is correct
34 Correct 8 ms 19148 KB Output is correct
35 Correct 8 ms 19156 KB Output is correct
36 Correct 8 ms 19156 KB Output is correct
37 Correct 8 ms 19156 KB Output is correct
38 Correct 10 ms 19156 KB Output is correct
39 Correct 8 ms 19080 KB Output is correct
40 Correct 8 ms 19140 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 19028 KB Output is correct
2 Correct 7 ms 19028 KB Output is correct
3 Correct 8 ms 19028 KB Output is correct
4 Correct 8 ms 19028 KB Output is correct
5 Correct 8 ms 19028 KB Output is correct
6 Correct 8 ms 19028 KB Output is correct
7 Correct 8 ms 19120 KB Output is correct
8 Correct 7 ms 19028 KB Output is correct
9 Correct 8 ms 19068 KB Output is correct
10 Correct 8 ms 19128 KB Output is correct
11 Correct 8 ms 19028 KB Output is correct
12 Correct 7 ms 19028 KB Output is correct
13 Correct 8 ms 19028 KB Output is correct
14 Correct 8 ms 19120 KB Output is correct
15 Correct 8 ms 19028 KB Output is correct
16 Correct 7 ms 19040 KB Output is correct
17 Correct 8 ms 19124 KB Output is correct
18 Correct 8 ms 19028 KB Output is correct
19 Correct 10 ms 19132 KB Output is correct
20 Correct 8 ms 19028 KB Output is correct
21 Correct 8 ms 19028 KB Output is correct
22 Correct 8 ms 19028 KB Output is correct
23 Correct 8 ms 19108 KB Output is correct
24 Correct 8 ms 19028 KB Output is correct
25 Correct 8 ms 19016 KB Output is correct
26 Correct 8 ms 19028 KB Output is correct
27 Correct 8 ms 19156 KB Output is correct
28 Correct 8 ms 19156 KB Output is correct
29 Correct 8 ms 19156 KB Output is correct
30 Correct 9 ms 19108 KB Output is correct
31 Correct 8 ms 19156 KB Output is correct
32 Correct 8 ms 19156 KB Output is correct
33 Correct 9 ms 19156 KB Output is correct
34 Correct 8 ms 19148 KB Output is correct
35 Correct 8 ms 19156 KB Output is correct
36 Correct 8 ms 19156 KB Output is correct
37 Correct 8 ms 19156 KB Output is correct
38 Correct 10 ms 19156 KB Output is correct
39 Correct 8 ms 19080 KB Output is correct
40 Correct 8 ms 19140 KB Output is correct
41 Correct 13 ms 19448 KB Output is correct
42 Correct 14 ms 19460 KB Output is correct
43 Correct 11 ms 19352 KB Output is correct
44 Correct 13 ms 19416 KB Output is correct
45 Correct 14 ms 19464 KB Output is correct
46 Correct 13 ms 19412 KB Output is correct
47 Correct 13 ms 19412 KB Output is correct
48 Correct 14 ms 19412 KB Output is correct
49 Correct 14 ms 19368 KB Output is correct
50 Correct 14 ms 19436 KB Output is correct
51 Correct 13 ms 19412 KB Output is correct
52 Correct 16 ms 19416 KB Output is correct
53 Correct 13 ms 19448 KB Output is correct
54 Correct 13 ms 19400 KB Output is correct
55 Correct 14 ms 19564 KB Output is correct
56 Correct 14 ms 19372 KB Output is correct
57 Correct 13 ms 19412 KB Output is correct
58 Correct 12 ms 19412 KB Output is correct
59 Correct 12 ms 19412 KB Output is correct
60 Correct 13 ms 19412 KB Output is correct
61 Correct 14 ms 19408 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 28540 KB Output is correct
2 Correct 170 ms 28628 KB Output is correct
3 Correct 214 ms 28592 KB Output is correct
4 Correct 344 ms 30276 KB Output is correct
5 Correct 302 ms 30284 KB Output is correct
6 Correct 340 ms 30208 KB Output is correct
7 Correct 221 ms 30148 KB Output is correct
8 Correct 210 ms 30220 KB Output is correct
9 Correct 216 ms 30232 KB Output is correct
10 Correct 227 ms 30392 KB Output is correct
11 Correct 300 ms 30252 KB Output is correct
12 Correct 312 ms 30244 KB Output is correct
13 Correct 300 ms 30264 KB Output is correct
14 Correct 331 ms 30240 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 26276 KB Output is correct
2 Correct 167 ms 26276 KB Output is correct
3 Correct 225 ms 27036 KB Output is correct
4 Correct 291 ms 26984 KB Output is correct
5 Correct 259 ms 27036 KB Output is correct
6 Correct 300 ms 27024 KB Output is correct
7 Correct 174 ms 29288 KB Output is correct
8 Correct 180 ms 26996 KB Output is correct
9 Correct 194 ms 27260 KB Output is correct
10 Correct 248 ms 27064 KB Output is correct
11 Correct 284 ms 27092 KB Output is correct
12 Correct 248 ms 26936 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 19028 KB Output is correct
2 Correct 7 ms 19028 KB Output is correct
3 Correct 8 ms 19028 KB Output is correct
4 Correct 8 ms 19028 KB Output is correct
5 Correct 8 ms 19028 KB Output is correct
6 Correct 8 ms 19028 KB Output is correct
7 Correct 8 ms 19120 KB Output is correct
8 Correct 7 ms 19028 KB Output is correct
9 Correct 8 ms 19068 KB Output is correct
10 Correct 8 ms 19128 KB Output is correct
11 Correct 8 ms 19028 KB Output is correct
12 Correct 7 ms 19028 KB Output is correct
13 Correct 8 ms 19028 KB Output is correct
14 Correct 8 ms 19120 KB Output is correct
15 Correct 8 ms 19028 KB Output is correct
16 Correct 7 ms 19040 KB Output is correct
17 Correct 8 ms 19124 KB Output is correct
18 Correct 8 ms 19028 KB Output is correct
19 Correct 10 ms 19132 KB Output is correct
20 Correct 8 ms 19028 KB Output is correct
21 Correct 8 ms 19028 KB Output is correct
22 Correct 8 ms 19028 KB Output is correct
23 Correct 8 ms 19108 KB Output is correct
24 Correct 8 ms 19028 KB Output is correct
25 Correct 8 ms 19016 KB Output is correct
26 Correct 8 ms 19028 KB Output is correct
27 Correct 8 ms 19156 KB Output is correct
28 Correct 8 ms 19156 KB Output is correct
29 Correct 8 ms 19156 KB Output is correct
30 Correct 9 ms 19108 KB Output is correct
31 Correct 8 ms 19156 KB Output is correct
32 Correct 8 ms 19156 KB Output is correct
33 Correct 9 ms 19156 KB Output is correct
34 Correct 8 ms 19148 KB Output is correct
35 Correct 8 ms 19156 KB Output is correct
36 Correct 8 ms 19156 KB Output is correct
37 Correct 8 ms 19156 KB Output is correct
38 Correct 10 ms 19156 KB Output is correct
39 Correct 8 ms 19080 KB Output is correct
40 Correct 8 ms 19140 KB Output is correct
41 Correct 13 ms 19448 KB Output is correct
42 Correct 14 ms 19460 KB Output is correct
43 Correct 11 ms 19352 KB Output is correct
44 Correct 13 ms 19416 KB Output is correct
45 Correct 14 ms 19464 KB Output is correct
46 Correct 13 ms 19412 KB Output is correct
47 Correct 13 ms 19412 KB Output is correct
48 Correct 14 ms 19412 KB Output is correct
49 Correct 14 ms 19368 KB Output is correct
50 Correct 14 ms 19436 KB Output is correct
51 Correct 13 ms 19412 KB Output is correct
52 Correct 16 ms 19416 KB Output is correct
53 Correct 13 ms 19448 KB Output is correct
54 Correct 13 ms 19400 KB Output is correct
55 Correct 14 ms 19564 KB Output is correct
56 Correct 14 ms 19372 KB Output is correct
57 Correct 13 ms 19412 KB Output is correct
58 Correct 12 ms 19412 KB Output is correct
59 Correct 12 ms 19412 KB Output is correct
60 Correct 13 ms 19412 KB Output is correct
61 Correct 14 ms 19408 KB Output is correct
62 Correct 92 ms 28540 KB Output is correct
63 Correct 170 ms 28628 KB Output is correct
64 Correct 214 ms 28592 KB Output is correct
65 Correct 344 ms 30276 KB Output is correct
66 Correct 302 ms 30284 KB Output is correct
67 Correct 340 ms 30208 KB Output is correct
68 Correct 221 ms 30148 KB Output is correct
69 Correct 210 ms 30220 KB Output is correct
70 Correct 216 ms 30232 KB Output is correct
71 Correct 227 ms 30392 KB Output is correct
72 Correct 300 ms 30252 KB Output is correct
73 Correct 312 ms 30244 KB Output is correct
74 Correct 300 ms 30264 KB Output is correct
75 Correct 331 ms 30240 KB Output is correct
76 Correct 89 ms 26276 KB Output is correct
77 Correct 167 ms 26276 KB Output is correct
78 Correct 225 ms 27036 KB Output is correct
79 Correct 291 ms 26984 KB Output is correct
80 Correct 259 ms 27036 KB Output is correct
81 Correct 300 ms 27024 KB Output is correct
82 Correct 174 ms 29288 KB Output is correct
83 Correct 180 ms 26996 KB Output is correct
84 Correct 194 ms 27260 KB Output is correct
85 Correct 248 ms 27064 KB Output is correct
86 Correct 284 ms 27092 KB Output is correct
87 Correct 248 ms 26936 KB Output is correct
88 Correct 263 ms 30272 KB Output is correct
89 Correct 342 ms 30264 KB Output is correct
90 Correct 299 ms 30244 KB Output is correct
91 Correct 329 ms 31408 KB Output is correct
92 Correct 159 ms 31416 KB Output is correct
93 Correct 233 ms 31416 KB Output is correct
94 Correct 281 ms 29816 KB Output is correct
95 Correct 308 ms 31476 KB Output is correct
96 Correct 315 ms 31484 KB Output is correct
97 Correct 321 ms 31460 KB Output is correct
98 Correct 324 ms 31424 KB Output is correct
99 Correct 314 ms 31460 KB Output is correct
100 Correct 321 ms 31524 KB Output is correct
101 Correct 219 ms 31500 KB Output is correct
102 Correct 224 ms 31500 KB Output is correct
103 Correct 244 ms 31432 KB Output is correct
104 Correct 259 ms 31432 KB Output is correct
105 Correct 282 ms 31264 KB Output is correct
106 Correct 258 ms 31500 KB Output is correct
107 Correct 277 ms 31476 KB Output is correct
108 Correct 311 ms 31484 KB Output is correct
109 Correct 271 ms 31476 KB Output is correct
110 Correct 309 ms 31432 KB Output is correct
111 Correct 310 ms 31464 KB Output is correct
112 Correct 253 ms 31476 KB Output is correct
113 Correct 321 ms 31452 KB Output is correct
114 Correct 305 ms 31480 KB Output is correct
115 Correct 175 ms 29100 KB Output is correct
116 Correct 178 ms 29160 KB Output is correct
117 Correct 218 ms 30304 KB Output is correct
118 Correct 219 ms 30360 KB Output is correct
119 Correct 294 ms 31656 KB Output is correct
120 Correct 290 ms 31472 KB Output is correct