Submission #493781

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
493781	2021-12-13T00:31:00 Z	Deepesson	Global Warming (CEOI18_glo)	C++17	75 / 100	980 ms	262144 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){
    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()
{
    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";
}

Subtask #1
5.0 / 5.0

#	Verdict	Memory	Grader output
1	Correct	204 KB	Output is correct
2	Correct	204 KB	Output is correct
3	Correct	204 KB	Output is correct
4	Correct	204 KB	Output is correct
5	Correct	204 KB	Output is correct
6	Correct	204 KB	Output is correct
7	Correct	204 KB	Output is correct
8	Correct	204 KB	Output is correct
9	Correct	204 KB	Output is correct
10	Correct	204 KB	Output is correct
11	Correct	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	0 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	0 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	0 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	0 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 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	0 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	0 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	0 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	0 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	6 ms	2380 KB	Output is correct
20	Correct	4 ms	2252 KB	Output is correct
21	Correct	3 ms	2124 KB	Output is correct
22	Correct	3 ms	1776 KB	Output is correct
23	Correct	3 ms	1228 KB	Output is correct
24	Correct	3 ms	1268 KB	Output is correct
25	Correct	2 ms	332 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	709 ms	187472 KB	Output is correct
2	Correct	677 ms	187548 KB	Output is correct
3	Correct	713 ms	187356 KB	Output is correct
4	Correct	697 ms	187464 KB	Output is correct
5	Correct	450 ms	102284 KB	Output is correct

Subtask #5
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	171 ms	59508 KB	Output is correct
2	Correct	171 ms	59488 KB	Output is correct
3	Correct	172 ms	59580 KB	Output is correct
4	Correct	107 ms	31996 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	98 ms	4280 KB	Output is correct
7	Correct	153 ms	41312 KB	Output is correct

Subtask #6
17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	305 ms	101792 KB	Output is correct
2	Correct	304 ms	101700 KB	Output is correct
3	Correct	649 ms	187476 KB	Output is correct
4	Correct	360 ms	102216 KB	Output is correct
5	Correct	147 ms	9008 KB	Output is correct
6	Correct	298 ms	16396 KB	Output is correct
7	Correct	292 ms	16060 KB	Output is correct
8	Correct	227 ms	70692 KB	Output is correct

Subtask #7
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	0 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	0 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	0 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	0 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	6 ms	2380 KB	Output is correct
20	Correct	4 ms	2252 KB	Output is correct
21	Correct	3 ms	2124 KB	Output is correct
22	Correct	3 ms	1776 KB	Output is correct
23	Correct	3 ms	1228 KB	Output is correct
24	Correct	3 ms	1268 KB	Output is correct
25	Correct	2 ms	332 KB	Output is correct
26	Correct	2 ms	332 KB	Output is correct
27	Correct	709 ms	187472 KB	Output is correct
28	Correct	677 ms	187548 KB	Output is correct
29	Correct	713 ms	187356 KB	Output is correct
30	Correct	697 ms	187464 KB	Output is correct
31	Correct	450 ms	102284 KB	Output is correct
32	Correct	171 ms	59508 KB	Output is correct
33	Correct	171 ms	59488 KB	Output is correct
34	Correct	172 ms	59580 KB	Output is correct
35	Correct	107 ms	31996 KB	Output is correct
36	Correct	1 ms	204 KB	Output is correct
37	Correct	98 ms	4280 KB	Output is correct
38	Correct	153 ms	41312 KB	Output is correct
39	Correct	305 ms	101792 KB	Output is correct
40	Correct	304 ms	101700 KB	Output is correct
41	Correct	649 ms	187476 KB	Output is correct
42	Correct	360 ms	102216 KB	Output is correct
43	Correct	147 ms	9008 KB	Output is correct
44	Correct	298 ms	16396 KB	Output is correct
45	Correct	292 ms	16060 KB	Output is correct
46	Correct	227 ms	70692 KB	Output is correct
47	Correct	340 ms	127176 KB	Output is correct
48	Correct	387 ms	138088 KB	Output is correct
49	Runtime error	980 ms	262144 KB	Execution killed with signal 6
50	Halted	0 ms	0 KB	-

Submission #493781

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 10.0 / 10.0

Subtask #3 13.0 / 13.0

Subtask #4 10.0 / 10.0

Subtask #5 20.0 / 20.0

Subtask #6 17.0 / 17.0

Subtask #7 0 / 25.0

Subtask #1
5.0 / 5.0

Subtask #2
10.0 / 10.0

Subtask #3
13.0 / 13.0

Subtask #4
10.0 / 10.0

Subtask #5
20.0 / 20.0

Subtask #6
17.0 / 17.0

Subtask #7
0 / 25.0