oj.uz

Submission #493771

# Submission time Handle Problem Language Result Execution time Memory
493771 2021-12-13T00:19:57 Z Deepesson Global Warming (CEOI18_glo) C++17
0 / 100
 770 ms 197148 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[15000000];
int cursor= 2;
int novonode(void){
    return cursor++;
}
int update(int t,int k,Node* v){
    int la=v->l,ra=v->r;
    if(t<la||ra<t)return 0;
    if(la==ra){
        v->val=std::max(v->val,k);
        return k;
    }
    int m = (la+ra)/2;
    if(!v->left){
        int k = novonode();
        v->left=k;
        mem[k].l=la;
        mem[k].r=m;
    }
    if(!v->right){
        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((&mem[v->left])->val,(&mem[v->right])->val);
    return v->val;
}
int query(int l,int r,Node* v){
    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;
    if(!v->left){
        int k = novonode();
        v->left=k;
        mem[k].l=la;
        mem[k].r=m;
    }
    if(!v->right){
        int k = novonode();
        v->right=k;
        mem[k].l=m+1;
        mem[k].r=ra;
    }
    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()
{
    std::cout<<sizeof(Node)<<"\n";
    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 update(int, int, Node*)':
glo.cpp:37:9: warning: unused variable 'a' [-Wunused-variable]
   37 |     int a = update(t,k,&mem[v->left]);
      |         ^
glo.cpp:38:9: warning: unused variable 'b' [-Wunused-variable]
   38 |     int b = update(t,k,&mem[v->right]);
      |         ^

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 770 ms 197148 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 171 ms 61288 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 364 ms 105668 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -