Submission #440811

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
440811	2021-07-03T08:49:19 Z	den_tar	Global Warming (CEOI18_glo)	C++14	100 / 100	190 ms	10124 KB

#include <bits/stdc++.h>

using namespace std;

#define fast ios_base::sync_with_stdio();cin.tie();cout.tie();
#define en cout<<endl;
#define ops cout<<"ops"<<endl;
#define line cout<<"---------------------------"<<endl;
#define fi first
#define se second

typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pllll;
typedef string str;

const ll DIM = 2e5 + 7;
const ll DIMM = 5e4 + 7;
const ll DDIM = 7;
const ll INF = 1e18 + 7;
const ll X = 1e5 + 7;
const ll BS = 2e5 + 7;
const ll AS = 26 + 7;
const ll MODULO = 1e9 + 7;

ll nt,n,m,k,q;

ll a[DIM];

ll d1[DIM],d2[DIM],pos[DIM],pr[DIM];

ll l,r,mid;

ll l1;

ll res;

int main()
{
    fast;
    //ll x1,y1,x2,y2;

    cin>>n>>m;

    for(int i=1;i<=n;i++)cin>>a[i];





    d1[0]=(-INF);
    d2[0]=INF;

    for(int i=1;i<=n;i++){
     d1[i]=INF;
     d2[i]=(-INF);
    }






    for(int i=1;i<=n;i++){

     l=0;r=i-1;

     while(l<r){
      mid=(l+r+1)/2;
      if(d1[mid]<a[i])l=mid;
      else r=mid-1;
     }

     pos[i]=l+1;
     pr[i]=d1[l+1];

     d1[l+1]=a[i];

    }




    res=(-INF);

    for(ll i=1;i<=n;i++)
     if(d1[i]!=INF)res=max(res,i);







    if(m==0){
     cout<<res<<endl;
     return 0;
    }





    for(int i=n;i>=1;i--){

     d1[pos[i]]=pr[i];

     a[i]+=m;

     l=0;r=n-i;

     while(l<r){
      mid=(l+r+1)/2;
      if(d2[mid]>a[i])l=mid;
      else r=mid-1;
     }

     if(d2[l]>a[i] && a[i]>d2[l+1])d2[l+1]=a[i];

     l1=l+1;

     l=0;r=i-1;

     while(l<r){
      mid=(l+r+1)/2;
      if(d1[mid]<a[i])l=mid;
      else r=mid-1;
     }

     res=max(res,(l1+l));
    }

    cout<<res<<endl;

    return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

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

Subtask #4
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	126 ms	9924 KB	Output is correct
2	Correct	112 ms	9988 KB	Output is correct
3	Correct	113 ms	10020 KB	Output is correct
4	Correct	112 ms	10124 KB	Output is correct
5	Correct	71 ms	9204 KB	Output is correct

Subtask #5
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	44 ms	2728 KB	Output is correct
2	Correct	48 ms	2720 KB	Output is correct
3	Correct	36 ms	2660 KB	Output is correct
4	Correct	30 ms	2496 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	23 ms	2468 KB	Output is correct
7	Correct	49 ms	2748 KB	Output is correct

Subtask #6
17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	71 ms	5072 KB	Output is correct
2	Correct	68 ms	5180 KB	Output is correct
3	Correct	190 ms	9960 KB	Output is correct
4	Correct	98 ms	9248 KB	Output is correct
5	Correct	59 ms	4788 KB	Output is correct
6	Correct	114 ms	8904 KB	Output is correct
7	Correct	115 ms	9568 KB	Output is correct
8	Correct	57 ms	5192 KB	Output is correct

Subtask #7
25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	352 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	304 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	332 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	1 ms	332 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	2 ms	332 KB	Output is correct
26	Correct	1 ms	332 KB	Output is correct
27	Correct	126 ms	9924 KB	Output is correct
28	Correct	112 ms	9988 KB	Output is correct
29	Correct	113 ms	10020 KB	Output is correct
30	Correct	112 ms	10124 KB	Output is correct
31	Correct	71 ms	9204 KB	Output is correct
32	Correct	44 ms	2728 KB	Output is correct
33	Correct	48 ms	2720 KB	Output is correct
34	Correct	36 ms	2660 KB	Output is correct
35	Correct	30 ms	2496 KB	Output is correct
36	Correct	1 ms	332 KB	Output is correct
37	Correct	23 ms	2468 KB	Output is correct
38	Correct	49 ms	2748 KB	Output is correct
39	Correct	71 ms	5072 KB	Output is correct
40	Correct	68 ms	5180 KB	Output is correct
41	Correct	190 ms	9960 KB	Output is correct
42	Correct	98 ms	9248 KB	Output is correct
43	Correct	59 ms	4788 KB	Output is correct
44	Correct	114 ms	8904 KB	Output is correct
45	Correct	115 ms	9568 KB	Output is correct
46	Correct	57 ms	5192 KB	Output is correct
47	Correct	71 ms	5104 KB	Output is correct
48	Correct	78 ms	5176 KB	Output is correct
49	Correct	182 ms	9976 KB	Output is correct
50	Correct	89 ms	9260 KB	Output is correct
51	Correct	73 ms	7024 KB	Output is correct
52	Correct	86 ms	9340 KB	Output is correct
53	Correct	93 ms	9356 KB	Output is correct
54	Correct	119 ms	9956 KB	Output is correct
55	Correct	127 ms	10024 KB	Output is correct

Submission #440811

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 25.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
25.0 / 25.0