oj.uz

Submission #920098

# Submission time Handle Problem Language Result Execution time Memory
920098 2024-02-02T04:05:18 Z Sir_Ahmed_Imran Global Warming (CEOI18_glo) C++17
100 / 100
 1139 ms 94028 KB 
                              ///~~~LOTA~~~///
#include <bits/stdc++.h>
using namespace std;
#define nl '\n'
#define ff first
#define ss second
#define ll long long 
#define append push_back
#define all(x) (x).begin(),(x).end()
#define pii pair<int,int>
#define N 200001
#define M 1000000001
int a[N];
int Q[N];
struct Node{ 
    int val; 
    Node *L,*R; 
};
Node* getnode(){ 
    Node* temp=new Node; 
    temp->val=0; 
    temp->L=NULL; 
    temp->R=NULL; 
    return temp; 
}
class ST{
public:
    Node* root=getnode();
    void update(int i,int x,Node* v,int s=0,int e=M){
        if(e-s==1){
            v->val=x;
            return;
        }
        int mid=(s+e)/2;
        if(v->L==NULL) v->L=getnode();
        if(v->R==NULL) v->R=getnode();
        if(i<mid) update(i,x,v->L,s,mid);
        else update(i,x,v->R,mid,e);
        v->val=max(v->L->val,v->R->val);
        if(v->L->val==0){
            delete v->L;
            v->L=NULL;
        }
        if(v->R->val==0){
            delete v->R;
            v->R=NULL;
        }
    }
    int get(int l,int r,Node* v,int s=0,int e=M){
        if(r<=s || e<=l || l>=r || v->val==0) return 0;
        if(l<=s && e<=r) return v->val;
        int mid=(s+e)/2;
        if(v->L==NULL) v->L=getnode();
        if(v->R==NULL) v->R=getnode();
        int o=max(get(l,r,v->L,s,mid),get(l,r,v->R,mid,e));
        if(v->L->val==0){
            delete v->L;
            v->L=NULL;
        }
        if(v->R->val==0){
            delete v->R;
            v->R=NULL;
        }
        return o;
    }
};
void solve(){
    int n,m,o,p,q,r;
    cin>>n>>m;
    ST x,y;
    for(int i=o=1;i<=n;i++)
        cin>>a[i];
    for(int i=n;i>0;i--){
        Q[i]=y.get(a[i],a[i]+1,y.root);
        y.update(a[i],y.get(a[i]+1,M,y.root)+1,y.root);
    }
    for(int i=1;i<=n;i++){
        p=x.get(0,a[i],x.root)+1;
        y.update(a[i],Q[i],y.root);
        x.update(a[i],p,x.root);
        o=max(o,p+y.get(max(a[i]-m+1,0),M,y.root));
    }
    cout<<o;
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    solve();
    return 0;
}

Compilation message

glo.cpp: In function 'void solve()':
glo.cpp:68:17: warning: unused variable 'q' [-Wunused-variable]
   68 |     int n,m,o,p,q,r;
      |                 ^
glo.cpp:68:19: warning: unused variable 'r' [-Wunused-variable]
   68 |     int n,m,o,p,q,r;
      |                   ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct

Subtask #3
13.0 / 13.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1117 ms 92240 KB Output is correct
2 Correct 1085 ms 92404 KB Output is correct
3 Correct 1108 ms 92240 KB Output is correct
4 Correct 1082 ms 92236 KB Output is correct
5 Correct 696 ms 47124 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 215 ms 26324 KB Output is correct
2 Correct 199 ms 26364 KB Output is correct
3 Correct 215 ms 26272 KB Output is correct
4 Correct 159 ms 13812 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 181 ms 3196 KB Output is correct
7 Correct 190 ms 18584 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 483 ms 49584 KB Output is correct
2 Correct 456 ms 49236 KB Output is correct
3 Correct 1084 ms 92292 KB Output is correct
4 Correct 621 ms 47120 KB Output is correct
5 Correct 306 ms 7276 KB Output is correct
6 Correct 573 ms 13924 KB Output is correct
7 Correct 582 ms 13820 KB Output is correct
8 Correct 342 ms 34640 KB Output is correct

Subtask #7
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 4 ms 1112 KB Output is correct
20 Correct 4 ms 1112 KB Output is correct
21 Correct 4 ms 1112 KB Output is correct
22 Correct 4 ms 1116 KB Output is correct
23 Correct 4 ms 600 KB Output is correct
24 Correct 4 ms 604 KB Output is correct
25 Correct 3 ms 344 KB Output is correct
26 Correct 4 ms 348 KB Output is correct
27 Correct 1117 ms 92240 KB Output is correct
28 Correct 1085 ms 92404 KB Output is correct
29 Correct 1108 ms 92240 KB Output is correct
30 Correct 1082 ms 92236 KB Output is correct
31 Correct 696 ms 47124 KB Output is correct
32 Correct 215 ms 26324 KB Output is correct
33 Correct 199 ms 26364 KB Output is correct
34 Correct 215 ms 26272 KB Output is correct
35 Correct 159 ms 13812 KB Output is correct
36 Correct 0 ms 344 KB Output is correct
37 Correct 181 ms 3196 KB Output is correct
38 Correct 190 ms 18584 KB Output is correct
39 Correct 483 ms 49584 KB Output is correct
40 Correct 456 ms 49236 KB Output is correct
41 Correct 1084 ms 92292 KB Output is correct
42 Correct 621 ms 47120 KB Output is correct
43 Correct 306 ms 7276 KB Output is correct
44 Correct 573 ms 13924 KB Output is correct
45 Correct 582 ms 13820 KB Output is correct
46 Correct 342 ms 34640 KB Output is correct
47 Correct 481 ms 50512 KB Output is correct
48 Correct 476 ms 50256 KB Output is correct
49 Correct 1139 ms 94028 KB Output is correct
50 Correct 651 ms 48308 KB Output is correct
51 Correct 423 ms 12108 KB Output is correct
52 Correct 676 ms 15956 KB Output is correct
53 Correct 592 ms 15828 KB Output is correct
54 Correct 611 ms 16692 KB Output is correct
55 Correct 836 ms 66264 KB Output is correct