답안 #422650

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
422650	2021-06-10T09:34:34 Z	KalasLavas	Global Warming (CEOI18_glo)	C++14	100 / 100	75 ms	5828 KB

//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma,sse,sse2")
#include <bits/stdc++.h>
using namespace std;

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//#undef LOCALKL
#define IO \
ios_base::sync_with_stdio(0);(cin).tie(0);(cout).tie(0)
#define y1 y1_
#define prev prev_
#define all(a) (a).begin(),(a).end()
#define pb push_back
#define eb emplace_back
#define F first
#define S second
#ifdef LOCALKL
// #define cerr cerr<<"\33[1;32m"
// #define cout cout<<"\33[0m"
#else
#ifndef OO
#define endl '\n'
#define cerr if(1){}else cerr
#endif
#endif
#define OK cout<<"OK\n"<<endl;
#define setpre(k) fixed<<setprecision(k)
#define mmset(k,y) memset(k,y,sizeof(k))
#define sz(x) ((int)(x).size())
using pii = pair<int,int>;
using pll = pair<long long,long long>;
using ull = unsigned long long;
using intt = long long;
using ll = long long;
using ld = long double;

const ll m9 = 998244353;
const ll m7 = 1000000007;
const ll m18 = 1000000000000000000;
const ll i127 = 2139062143;
const ll l127 = 9187201950435737471;

int n, d, a[200002], lis[200002], lds[200002], ans, x;
int l, r, mid;
stack<pii>h;
int main()
{
    IO;
    memset(lis, 127, sizeof(lis));
    lis[0]=0;
    lds[0]=i127;
    cin>>n>>d;
    for(int i=1;i<=n;i++) cin>>a[i];

   	for(int i=1;i<=n;i++)
   	{
   		l=0; r=n;
   		while(l<r)
   		{
   			mid=(l+r)>>1;
   			if(lis[mid]<a[i]) l=mid+1;
   			else r=mid;
   		}
   		h.emplace(l, lis[l]);
   		lis[l]=a[i];
   		ans=max(ans, l);
   		// cerr<<l<<' '<<h.top().F<<' '<<h.top().S<<endl;
   	}
   	for(int i=n;i>=1;i--)
   	{
   		lis[h.top().F] = h.top().S;
   		h.pop();
   		l=0; r=n;
   		a[i]+=d;
   		while(l<r)
   		{
   			mid=(l+r)>>1;
   			if(a[i]<lds[mid]) l=mid+1;
   			else r=mid;
   		}
   		lds[l] = a[i];
   		x = l;
   		l=0; r=n;
   		while(l<r)
   		{
   			mid=(l+r)>>1;
   			if(lis[mid]<a[i]) l=mid+1;
   			else r=mid;
   		}
   		l--;
   		ans=max(ans, x+l);
   		// cerr<<i<<' '<<a[i]<<" : "<<l<<' '<<lis[l]<<" -> "<<x<<' '<<lds[x]<<endl;

   	}
   	cout<<ans<<endl;
    return 0;
}

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	1100 KB	Output is correct
2	Correct	1 ms	1112 KB	Output is correct
3	Correct	1 ms	1100 KB	Output is correct
4	Correct	1 ms	1100 KB	Output is correct
5	Correct	1 ms	1100 KB	Output is correct
6	Correct	1 ms	1100 KB	Output is correct
7	Correct	1 ms	1100 KB	Output is correct
8	Correct	1 ms	1100 KB	Output is correct
9	Correct	1 ms	1100 KB	Output is correct
10	Correct	1 ms	1100 KB	Output is correct
11	Correct	1 ms	1100 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	1100 KB	Output is correct
2	Correct	1 ms	1112 KB	Output is correct
3	Correct	1 ms	1100 KB	Output is correct
4	Correct	1 ms	1100 KB	Output is correct
5	Correct	1 ms	1100 KB	Output is correct
6	Correct	1 ms	1100 KB	Output is correct
7	Correct	1 ms	1100 KB	Output is correct
8	Correct	1 ms	1100 KB	Output is correct
9	Correct	1 ms	1100 KB	Output is correct
10	Correct	1 ms	1100 KB	Output is correct
11	Correct	1 ms	1100 KB	Output is correct
12	Correct	1 ms	1100 KB	Output is correct
13	Correct	1 ms	1100 KB	Output is correct
14	Correct	1 ms	1100 KB	Output is correct
15	Correct	1 ms	1100 KB	Output is correct
16	Correct	1 ms	1100 KB	Output is correct
17	Correct	1 ms	1100 KB	Output is correct
18	Correct	1 ms	1100 KB	Output is correct

Subtask #3
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	1100 KB	Output is correct
2	Correct	1 ms	1112 KB	Output is correct
3	Correct	1 ms	1100 KB	Output is correct
4	Correct	1 ms	1100 KB	Output is correct
5	Correct	1 ms	1100 KB	Output is correct
6	Correct	1 ms	1100 KB	Output is correct
7	Correct	1 ms	1100 KB	Output is correct
8	Correct	1 ms	1100 KB	Output is correct
9	Correct	1 ms	1100 KB	Output is correct
10	Correct	1 ms	1100 KB	Output is correct
11	Correct	1 ms	1100 KB	Output is correct
12	Correct	1 ms	1100 KB	Output is correct
13	Correct	1 ms	1100 KB	Output is correct
14	Correct	1 ms	1100 KB	Output is correct
15	Correct	1 ms	1100 KB	Output is correct
16	Correct	1 ms	1100 KB	Output is correct
17	Correct	1 ms	1100 KB	Output is correct
18	Correct	1 ms	1100 KB	Output is correct
19	Correct	1 ms	1100 KB	Output is correct
20	Correct	1 ms	1100 KB	Output is correct
21	Correct	1 ms	1228 KB	Output is correct
22	Correct	2 ms	1120 KB	Output is correct
23	Correct	1 ms	1100 KB	Output is correct
24	Correct	1 ms	1120 KB	Output is correct
25	Correct	1 ms	1100 KB	Output is correct
26	Correct	1 ms	1100 KB	Output is correct

Subtask #4
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	69 ms	3524 KB	Output is correct
2	Correct	75 ms	3524 KB	Output is correct
3	Correct	69 ms	3532 KB	Output is correct
4	Correct	75 ms	3420 KB	Output is correct
5	Correct	52 ms	3828 KB	Output is correct

Subtask #5
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	16 ms	1612 KB	Output is correct
2	Correct	17 ms	1612 KB	Output is correct
3	Correct	22 ms	1612 KB	Output is correct
4	Correct	17 ms	1792 KB	Output is correct
5	Correct	1 ms	1116 KB	Output is correct
6	Correct	17 ms	1996 KB	Output is correct
7	Correct	14 ms	2124 KB	Output is correct

Subtask #6
17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	28 ms	2244 KB	Output is correct
2	Correct	28 ms	2252 KB	Output is correct
3	Correct	58 ms	3468 KB	Output is correct
4	Correct	54 ms	3996 KB	Output is correct
5	Correct	26 ms	2412 KB	Output is correct
6	Correct	43 ms	3676 KB	Output is correct
7	Correct	47 ms	3780 KB	Output is correct
8	Correct	25 ms	2332 KB	Output is correct

Subtask #7
25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	1100 KB	Output is correct
2	Correct	1 ms	1112 KB	Output is correct
3	Correct	1 ms	1100 KB	Output is correct
4	Correct	1 ms	1100 KB	Output is correct
5	Correct	1 ms	1100 KB	Output is correct
6	Correct	1 ms	1100 KB	Output is correct
7	Correct	1 ms	1100 KB	Output is correct
8	Correct	1 ms	1100 KB	Output is correct
9	Correct	1 ms	1100 KB	Output is correct
10	Correct	1 ms	1100 KB	Output is correct
11	Correct	1 ms	1100 KB	Output is correct
12	Correct	1 ms	1100 KB	Output is correct
13	Correct	1 ms	1100 KB	Output is correct
14	Correct	1 ms	1100 KB	Output is correct
15	Correct	1 ms	1100 KB	Output is correct
16	Correct	1 ms	1100 KB	Output is correct
17	Correct	1 ms	1100 KB	Output is correct
18	Correct	1 ms	1100 KB	Output is correct
19	Correct	1 ms	1100 KB	Output is correct
20	Correct	1 ms	1100 KB	Output is correct
21	Correct	1 ms	1228 KB	Output is correct
22	Correct	2 ms	1120 KB	Output is correct
23	Correct	1 ms	1100 KB	Output is correct
24	Correct	1 ms	1120 KB	Output is correct
25	Correct	1 ms	1100 KB	Output is correct
26	Correct	1 ms	1100 KB	Output is correct
27	Correct	69 ms	3524 KB	Output is correct
28	Correct	75 ms	3524 KB	Output is correct
29	Correct	69 ms	3532 KB	Output is correct
30	Correct	75 ms	3420 KB	Output is correct
31	Correct	52 ms	3828 KB	Output is correct
32	Correct	16 ms	1612 KB	Output is correct
33	Correct	17 ms	1612 KB	Output is correct
34	Correct	22 ms	1612 KB	Output is correct
35	Correct	17 ms	1792 KB	Output is correct
36	Correct	1 ms	1116 KB	Output is correct
37	Correct	17 ms	1996 KB	Output is correct
38	Correct	14 ms	2124 KB	Output is correct
39	Correct	28 ms	2244 KB	Output is correct
40	Correct	28 ms	2252 KB	Output is correct
41	Correct	58 ms	3468 KB	Output is correct
42	Correct	54 ms	3996 KB	Output is correct
43	Correct	26 ms	2412 KB	Output is correct
44	Correct	43 ms	3676 KB	Output is correct
45	Correct	47 ms	3780 KB	Output is correct
46	Correct	25 ms	2332 KB	Output is correct
47	Correct	35 ms	3276 KB	Output is correct
48	Correct	35 ms	3272 KB	Output is correct
49	Correct	69 ms	5400 KB	Output is correct
50	Correct	51 ms	5060 KB	Output is correct
51	Correct	44 ms	4160 KB	Output is correct
52	Correct	52 ms	5136 KB	Output is correct
53	Correct	57 ms	5140 KB	Output is correct
54	Correct	58 ms	5828 KB	Output is correct
55	Correct	71 ms	5488 KB	Output is correct

답안 #422650

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