oj.uz

Submission #661717

# Submission time Handle Problem Language Result Execution time Memory
661717 2022-11-26T04:14:50 Z victor_gao Financial Report (JOI21_financial) C++17
100 / 100
 529 ms 20480 KB 
#pragma GCC optimize("Ofast,unroll-loops,O3")
#include<bits/stdc++.h>
//#include<bits/extc++.h>
//#pragma pack(1)
#define fast ios::sync_with_stdio(0); cin.tie(0);
#define pii pair<int,int>
#define x first
#define y second
#define N 300015
using namespace std;
//using namespace __gnu_pbds;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//typedef tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update> order_multiset;
//typedef tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> order_set;
struct lisan{
    vector<int>vt;
    void in(int x){ vt.push_back(x); }
    void build(){
        sort(vt.begin(),vt.end());
        vt.resize(unique(vt.begin(),vt.end())-vt.begin());
    }
    int idx(int x){ return upper_bound(vt.begin(),vt.end(),x)-vt.begin(); }
}uni;
vector<int>no;
struct not_bigest_segtree{
    int mn[4*N],tag[4*N];
    bool surv[4*N];
    void push(int i){
        if (tag[i]){
            if (surv[2*i]){
                tag[2*i]=tag[i];
                mn[2*i]=tag[i];
            }
            if (surv[2*i+1]){
                tag[2*i+1]=tag[i];
                mn[2*i+1]=tag[i];
            }
            tag[i]=0;
        }
    }
    void dfs(int l,int r,int i,int p,int d){
        if (!surv[i]||mn[i]>=p-d) return;
        if (l==r){
            no.push_back(l);
            surv[i]=0; mn[i]=1e9; tag[i]=0;
            return;
        }
        int mid=(l+r)>>1;
        push(i);
        if (mn[2*i]<p-d&&surv[2*i]) dfs(l,mid,2*i,p,d);
        if (mn[2*i+1]<p-d&&surv[2*i+1]) dfs(mid+1,r,2*i+1,p,d);
        mn[i]=min(mn[2*i],mn[2*i+1]);
        surv[i]=(surv[2*i]|surv[2*i+1]);
        if (!surv[i]){
            tag[i]=0;
            mn[i]=1e9;
        } 
    }
    void add(int l,int r,int i,int p){
        if (l==r){
            surv[i]=1;
            return;
        }
        int mid=(l+r)>>1;
        push(i);
        if (p<=mid) add(l,mid,2*i,p);
        else add(mid+1,r,2*i+1,p);
        surv[i]=(surv[2*i]|surv[2*i+1]);
    }
    void modify(int l,int r,int i,int ll,int rr,int val){
        if (ll>rr) return;
        if (!surv[i]) return;
        if (ll<=l&&rr>=r){
            if (surv[i]){
                tag[i]=val; mn[i]=val;
            }
            return;
        }
        int mid=(l+r)>>1;
        push(i);
        if (rr<=mid) modify(l,mid,2*i,ll,rr,val);
        else if (ll>mid) modify(mid+1,r,2*i+1,ll,rr,val);
        else {
            modify(l,mid,2*i,ll,rr,val);
            modify(mid+1,r,2*i+1,ll,rr,val);
        }
        mn[i]=min(mn[2*i],mn[2*i+1]);
    }
}surv;
struct is_bigest_segtree{
    int mx[4*N];
    void modify(int l,int r,int i,int p,int val,bool flag){
        if (l==r){
            if (flag) mx[i]=val;
            else mx[i]=max(val,mx[i]);
            return;
        }
        int mid=(l+r)>>1;
        if (p<=mid) modify(l,mid,2*i,p,val,flag);
        else modify(mid+1,r,2*i+1,p,val,flag);
        mx[i]=max(mx[2*i],mx[2*i+1]);
    }
    int query(int l,int r,int i,int ll,int rr){
        if (ll>rr) return 0;
        if (ll<=l&&rr>=r) return mx[i];
        int mid=(l+r)>>1;
        if (rr<=mid) return query(l,mid,2*i,ll,rr);
        else if (ll>mid) return query(mid+1,r,2*i+1,ll,rr);
        else return max(query(l,mid,2*i,ll,rr),query(mid+1,r,2*i+1,ll,rr));
    }
}seg;
int dp[N],n,d,a[N];
signed main(){
    fast
   // freopen("in.txt","r",stdin);
    cin>>n>>d;
    for (int i=1;i<=n;i++){
        cin>>a[i];
        uni.in(a[i]);
    }
    uni.build();
    for (int i=1;i<=n;i++)
        a[i]=uni.idx(a[i]);
    for (int i=1;i<=4*n+5;i++)
        surv.mn[i]=1e9;
    int cnt=0;
    for (int i=1;i<=n;i++){
        surv.dfs(1,n,1,i,d);
        for (auto j:no){
            cnt++;
            seg.modify(1,n,1,j,0,1);
        }
        assert(cnt<=n);
        no.clear();
        dp[i]=seg.query(1,n,1,1,a[i]-1)+1;
        surv.add(1,n,1,a[i]);
        surv.modify(1,n,1,a[i],n,i);
        seg.modify(1,n,1,a[i],dp[i],0);
    }
    int ans=1;
    for (int i=1;i<=n;i++)
        ans=max(ans,dp[i]);
    cout<<ans<<'\n';
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 328 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 1 ms 352 KB Output is correct
26 Correct 1 ms 340 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 328 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 1 ms 352 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 336 KB Output is correct
38 Correct 1 ms 336 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 328 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 1 ms 352 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 336 KB Output is correct
38 Correct 1 ms 336 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 7 ms 724 KB Output is correct
42 Correct 7 ms 732 KB Output is correct
43 Correct 4 ms 596 KB Output is correct
44 Correct 5 ms 668 KB Output is correct
45 Correct 5 ms 724 KB Output is correct
46 Correct 5 ms 808 KB Output is correct
47 Correct 6 ms 852 KB Output is correct
48 Correct 6 ms 732 KB Output is correct
49 Correct 6 ms 724 KB Output is correct
50 Correct 6 ms 796 KB Output is correct
51 Correct 6 ms 724 KB Output is correct
52 Correct 7 ms 724 KB Output is correct
53 Correct 5 ms 724 KB Output is correct
54 Correct 5 ms 724 KB Output is correct
55 Correct 6 ms 724 KB Output is correct
56 Correct 5 ms 724 KB Output is correct
57 Correct 5 ms 724 KB Output is correct
58 Correct 4 ms 724 KB Output is correct
59 Correct 4 ms 724 KB Output is correct
60 Correct 6 ms 724 KB Output is correct
61 Correct 6 ms 724 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 109 ms 8972 KB Output is correct
2 Correct 189 ms 9296 KB Output is correct
3 Correct 238 ms 9040 KB Output is correct
4 Correct 438 ms 16884 KB Output is correct
5 Correct 361 ms 18240 KB Output is correct
6 Correct 451 ms 18172 KB Output is correct
7 Correct 245 ms 18092 KB Output is correct
8 Correct 165 ms 18064 KB Output is correct
9 Correct 248 ms 18112 KB Output is correct
10 Correct 207 ms 18088 KB Output is correct
11 Correct 354 ms 18184 KB Output is correct
12 Correct 386 ms 18064 KB Output is correct
13 Correct 373 ms 18180 KB Output is correct
14 Correct 445 ms 18100 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 9108 KB Output is correct
2 Correct 178 ms 8968 KB Output is correct
3 Correct 209 ms 9164 KB Output is correct
4 Correct 342 ms 18172 KB Output is correct
5 Correct 306 ms 18128 KB Output is correct
6 Correct 321 ms 18132 KB Output is correct
7 Correct 179 ms 18108 KB Output is correct
8 Correct 164 ms 18120 KB Output is correct
9 Correct 184 ms 18120 KB Output is correct
10 Correct 245 ms 18236 KB Output is correct
11 Correct 332 ms 18192 KB Output is correct
12 Correct 304 ms 18216 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 328 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 1 ms 352 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 336 KB Output is correct
38 Correct 1 ms 336 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 7 ms 724 KB Output is correct
42 Correct 7 ms 732 KB Output is correct
43 Correct 4 ms 596 KB Output is correct
44 Correct 5 ms 668 KB Output is correct
45 Correct 5 ms 724 KB Output is correct
46 Correct 5 ms 808 KB Output is correct
47 Correct 6 ms 852 KB Output is correct
48 Correct 6 ms 732 KB Output is correct
49 Correct 6 ms 724 KB Output is correct
50 Correct 6 ms 796 KB Output is correct
51 Correct 6 ms 724 KB Output is correct
52 Correct 7 ms 724 KB Output is correct
53 Correct 5 ms 724 KB Output is correct
54 Correct 5 ms 724 KB Output is correct
55 Correct 6 ms 724 KB Output is correct
56 Correct 5 ms 724 KB Output is correct
57 Correct 5 ms 724 KB Output is correct
58 Correct 4 ms 724 KB Output is correct
59 Correct 4 ms 724 KB Output is correct
60 Correct 6 ms 724 KB Output is correct
61 Correct 6 ms 724 KB Output is correct
62 Correct 109 ms 8972 KB Output is correct
63 Correct 189 ms 9296 KB Output is correct
64 Correct 238 ms 9040 KB Output is correct
65 Correct 438 ms 16884 KB Output is correct
66 Correct 361 ms 18240 KB Output is correct
67 Correct 451 ms 18172 KB Output is correct
68 Correct 245 ms 18092 KB Output is correct
69 Correct 165 ms 18064 KB Output is correct
70 Correct 248 ms 18112 KB Output is correct
71 Correct 207 ms 18088 KB Output is correct
72 Correct 354 ms 18184 KB Output is correct
73 Correct 386 ms 18064 KB Output is correct
74 Correct 373 ms 18180 KB Output is correct
75 Correct 445 ms 18100 KB Output is correct
76 Correct 91 ms 9108 KB Output is correct
77 Correct 178 ms 8968 KB Output is correct
78 Correct 209 ms 9164 KB Output is correct
79 Correct 342 ms 18172 KB Output is correct
80 Correct 306 ms 18128 KB Output is correct
81 Correct 321 ms 18132 KB Output is correct
82 Correct 179 ms 18108 KB Output is correct
83 Correct 164 ms 18120 KB Output is correct
84 Correct 184 ms 18120 KB Output is correct
85 Correct 245 ms 18236 KB Output is correct
86 Correct 332 ms 18192 KB Output is correct
87 Correct 304 ms 18216 KB Output is correct
88 Correct 279 ms 9036 KB Output is correct
89 Correct 529 ms 17916 KB Output is correct
90 Correct 328 ms 10384 KB Output is correct
91 Correct 350 ms 18148 KB Output is correct
92 Correct 154 ms 8952 KB Output is correct
93 Correct 221 ms 9216 KB Output is correct
94 Correct 358 ms 15464 KB Output is correct
95 Correct 407 ms 18144 KB Output is correct
96 Correct 398 ms 18172 KB Output is correct
97 Correct 377 ms 18332 KB Output is correct
98 Correct 355 ms 18140 KB Output is correct
99 Correct 345 ms 18112 KB Output is correct
100 Correct 371 ms 18236 KB Output is correct
101 Correct 228 ms 18156 KB Output is correct
102 Correct 222 ms 18172 KB Output is correct
103 Correct 243 ms 18152 KB Output is correct
104 Correct 258 ms 18188 KB Output is correct
105 Correct 287 ms 18204 KB Output is correct
106 Correct 245 ms 18228 KB Output is correct
107 Correct 250 ms 18088 KB Output is correct
108 Correct 317 ms 18164 KB Output is correct
109 Correct 358 ms 18184 KB Output is correct
110 Correct 389 ms 18200 KB Output is correct
111 Correct 343 ms 18072 KB Output is correct
112 Correct 271 ms 18132 KB Output is correct
113 Correct 327 ms 20376 KB Output is correct
114 Correct 337 ms 20376 KB Output is correct
115 Correct 164 ms 20460 KB Output is correct
116 Correct 169 ms 20412 KB Output is correct
117 Correct 240 ms 20392 KB Output is correct
118 Correct 204 ms 20384 KB Output is correct
119 Correct 267 ms 20480 KB Output is correct
120 Correct 266 ms 20480 KB Output is correct