oj.uz

Submission #493782

# Submission time Handle Problem Language Result Execution time Memory
493782 2021-12-13T00:32:08 Z Deepesson Global Warming (CEOI18_glo) C++17
100 / 100
 628 ms 107988 KB 
#include <bits/stdc++.h>
const int inf = 1e9+900;
struct Node {
    int left,right;
    int val;
    int l,r;
    void inicializa(){
        l=0;
        r=+1e9+10000;
    }
};
Node mem[12000000];
int cursor= 2;
int novonode(void){
    if(cursor==12000000){
        assert(0);
    }
    return cursor++;
}
int update(int t,int k,Node* v){
    if(v==&mem[0])return 0;
    int la=v->l,ra=v->r;
    if(t<la||ra<t)return v->val;
    if(la==ra){
        v->val=std::max(v->val,k);
        return k;
    }
    int m = (la+ra)/2;
    if(!v->left&&(t>=la&&m>=t)){
        int k = novonode();
        v->left=k;
        mem[k].l=la;
        mem[k].r=m;
    }
    if(!v->right&&(t>=m+1&&ra>=t)){
        int k = novonode();
        v->right=k;
        mem[k].l=m+1;
        mem[k].r=ra;
    }
    int a = update(t,k,&mem[v->left]);
    int b = update(t,k,&mem[v->right]);
    v->val=std::max(a,b);
    return v->val;
}
int query(int l,int r,Node* v){
    if(v==&mem[0])return 0;
    int la=v->l,ra=v->r;
    if(r<la||ra<l)return 0;
    if(la>=l&&ra<=r){
        return v->val;
    }
    int m = (la+ra)/2;
    int a = query(l,r,&mem[v->left]);
    int b = query(l,r,&mem[v->right]);
    return std::max(a,b);
}
const int val = 1e8;
Node sega,segb;
int main()
{
    int N,T;
    std::cin>>N>>T;
    int array[N];for(auto&x:array)std::cin>>x;
    int resp=0;
    ///Caso d=0
    {
        std::vector<int> vec;
        for(int i=0;i!=N;++i){
            int x=array[i];
            auto it = std::lower_bound(vec.begin(),vec.end(),x);
            if(it==vec.end()){
                vec.push_back(x);
            }else *it=x;
        }
        resp=vec.size();
    }
    ///Caso d=T
    {
        sega.inicializa();
        segb.inicializa();
        for(int i=0;i!=N;++i){
            int base = array[i];
            int verdade = base - 1;
            ///Atualiza caso ele tenha adicionado
            {
                int futuro = verdade+T;
                int val1 = query(0,verdade,&segb);
                int val2 = query(0,futuro,&sega);
                update(base,std::max(val1,val2)+1,&segb);
            }
            ///Atualiza caso nao tenha adicionado
            update(base,query(0,verdade,&sega)+1,&sega);
        }
        resp=std::max(resp,std::max(query(0,inf,&sega),query(0,inf,&segb)));
    }
    std::cout<<(resp)<<"\n";
}

Compilation message

glo.cpp: In function 'int query(int, int, Node*)':
glo.cpp:53:9: warning: unused variable 'm' [-Wunused-variable]
   53 |     int m = (la+ra)/2;
      |         ^

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 602 ms 106000 KB Output is correct
2 Correct 618 ms 106032 KB Output is correct
3 Correct 556 ms 106040 KB Output is correct
4 Correct 573 ms 105904 KB Output is correct
5 Correct 320 ms 57528 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 149 ms 30620 KB Output is correct
2 Correct 124 ms 30532 KB Output is correct
3 Correct 129 ms 30612 KB Output is correct
4 Correct 99 ms 16560 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 79 ms 3536 KB Output is correct
7 Correct 105 ms 21828 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 273 ms 56980 KB Output is correct
2 Correct 240 ms 56992 KB Output is correct
3 Correct 520 ms 105972 KB Output is correct
4 Correct 334 ms 57604 KB Output is correct
5 Correct 157 ms 8608 KB Output is correct
6 Correct 269 ms 15980 KB Output is correct
7 Correct 290 ms 15948 KB Output is correct
8 Correct 205 ms 40900 KB Output is correct

Subtask #7
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 3 ms 1100 KB Output is correct
20 Correct 3 ms 1100 KB Output is correct
21 Correct 3 ms 1100 KB Output is correct
22 Correct 3 ms 1104 KB Output is correct
23 Correct 2 ms 716 KB Output is correct
24 Correct 3 ms 716 KB Output is correct
25 Correct 3 ms 460 KB Output is correct
26 Correct 2 ms 332 KB Output is correct
27 Correct 602 ms 106000 KB Output is correct
28 Correct 618 ms 106032 KB Output is correct
29 Correct 556 ms 106040 KB Output is correct
30 Correct 573 ms 105904 KB Output is correct
31 Correct 320 ms 57528 KB Output is correct
32 Correct 149 ms 30620 KB Output is correct
33 Correct 124 ms 30532 KB Output is correct
34 Correct 129 ms 30612 KB Output is correct
35 Correct 99 ms 16560 KB Output is correct
36 Correct 0 ms 204 KB Output is correct
37 Correct 79 ms 3536 KB Output is correct
38 Correct 105 ms 21828 KB Output is correct
39 Correct 273 ms 56980 KB Output is correct
40 Correct 240 ms 56992 KB Output is correct
41 Correct 520 ms 105972 KB Output is correct
42 Correct 334 ms 57604 KB Output is correct
43 Correct 157 ms 8608 KB Output is correct
44 Correct 269 ms 15980 KB Output is correct
45 Correct 290 ms 15948 KB Output is correct
46 Correct 205 ms 40900 KB Output is correct
47 Correct 279 ms 56988 KB Output is correct
48 Correct 278 ms 57068 KB Output is correct
49 Correct 628 ms 107988 KB Output is correct
50 Correct 331 ms 58756 KB Output is correct
51 Correct 231 ms 9636 KB Output is correct
52 Correct 332 ms 18068 KB Output is correct
53 Correct 272 ms 18036 KB Output is correct
54 Correct 355 ms 18768 KB Output is correct
55 Correct 488 ms 78344 KB Output is correct