답안 #1094103

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1094103	2024-09-28T12:21:23 Z	alexander707070	Global Warming (CEOI18_glo)	C++14	58 / 100	925 ms	179284 KB

#include<bits/stdc++.h>
#define MAXN 200007
using namespace std;
 
const long long inf=1e9;
 
struct ST{
	struct node{
		int l,r,val;
	};
 
	node tree[100*MAXN];
	int num;
	
	void init(){
		num=1;
		tree[num]={0,0,0};
	}
 
	void addnode(){
		num++;
		tree[num]={0,0,0};
	}
 
	void check(int v){
		if(tree[v].l==0){
			addnode(); tree[v].l=num;
		}
 
		if(tree[v].r==0){
			addnode(); tree[v].r=num;
		}
	}
 
	void update(int v,long long l,long long r,long long pos,int val){
		if(l==r){
			tree[v].val=max(tree[v].val,val);
		}else{
			long long tt=(l+r)/2;
			check(v);
 
			if(pos<=tt)update(tree[v].l,l,tt,pos,val);
			else update(tree[v].r,tt+1,r,pos,val);
 
			tree[v].val=max(tree[tree[v].l].val,tree[tree[v].r].val);
		}
	}
 
	int getmax(int v,long long l,long long r,long long ll,long long rr){
		if(ll>rr or v==0)return 0;
		if(l==ll and r==rr){
			return tree[v].val;
		}else{
			long long tt=(l+r)/2;
			return max( getmax(tree[v].l,l,tt,ll,min(tt,rr)) , getmax(tree[v].r,tt+1,r,max(tt+1,ll),rr) );
		}
	}
}seg[3];
 
int n,a[MAXN],ans,x;
int dp[MAXN][3];
 
int solve(int d){
	seg[0].init();
	seg[1].init();
	seg[2].init();
 
	int res=0;
 
	for(int i=1;i<=n;i++){
		dp[i][0]=seg[0].getmax(1,0,3*inf,0,a[i]-1)+1;
		dp[i][1]=max(seg[1].getmax(1,0,3*inf,0,a[i]-1)+1 , seg[0].getmax(1,0,3*inf,0,a[i]+d-1)+1);
		dp[i][2]=max(seg[2].getmax(1,0,3*inf,0,a[i]-1)+1 , seg[1].getmax(1,0,3*inf,0,a[i]-d-1)+1);
 
		seg[0].update(1,0,3*inf,a[i],dp[i][0]);
		seg[1].update(1,0,3*inf,a[i],dp[i][1]);
		seg[2].update(1,0,3*inf,a[i],dp[i][2]);
 
		res=max(res,max(dp[i][0],max(dp[i][1],dp[i][2])));
	}
 
	return res;
}
 
int main(){
 
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
 
	cin>>n>>x;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		a[i]+=inf;
	}
 
	cout<<max(solve(-x),solve(x))<<"\n";
 
    return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

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

Subtask #4
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	905 ms	178964 KB	Output is correct
2	Correct	920 ms	179116 KB	Output is correct
3	Correct	889 ms	179004 KB	Output is correct
4	Correct	925 ms	179028 KB	Output is correct
5	Correct	496 ms	98304 KB	Output is correct

Subtask #5
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	189 ms	52044 KB	Output is correct
2	Correct	187 ms	52048 KB	Output is correct
3	Correct	186 ms	52052 KB	Output is correct
4	Correct	126 ms	28276 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	119 ms	4564 KB	Output is correct
7	Correct	149 ms	36432 KB	Output is correct

Subtask #6
0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	367 ms	96704 KB	Output is correct
2	Correct	367 ms	96848 KB	Output is correct
3	Correct	808 ms	179284 KB	Output is correct
4	Correct	411 ms	98384 KB	Output is correct
5	Correct	191 ms	9040 KB	Output is correct
6	Correct	355 ms	16632 KB	Output is correct
7	Incorrect	359 ms	16768 KB	Output isn't correct
8	Halted	0 ms	0 KB	-

Subtask #7
0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	3 ms	1880 KB	Output is correct
20	Correct	3 ms	1884 KB	Output is correct
21	Correct	3 ms	1884 KB	Output is correct
22	Correct	4 ms	1884 KB	Output is correct
23	Correct	3 ms	1116 KB	Output is correct
24	Correct	3 ms	1252 KB	Output is correct
25	Correct	2 ms	348 KB	Output is correct
26	Correct	3 ms	348 KB	Output is correct
27	Correct	905 ms	178964 KB	Output is correct
28	Correct	920 ms	179116 KB	Output is correct
29	Correct	889 ms	179004 KB	Output is correct
30	Correct	925 ms	179028 KB	Output is correct
31	Correct	496 ms	98304 KB	Output is correct
32	Correct	189 ms	52044 KB	Output is correct
33	Correct	187 ms	52048 KB	Output is correct
34	Correct	186 ms	52052 KB	Output is correct
35	Correct	126 ms	28276 KB	Output is correct
36	Correct	0 ms	344 KB	Output is correct
37	Correct	119 ms	4564 KB	Output is correct
38	Correct	149 ms	36432 KB	Output is correct
39	Correct	367 ms	96704 KB	Output is correct
40	Correct	367 ms	96848 KB	Output is correct
41	Correct	808 ms	179284 KB	Output is correct
42	Correct	411 ms	98384 KB	Output is correct
43	Correct	191 ms	9040 KB	Output is correct
44	Correct	355 ms	16632 KB	Output is correct
45	Incorrect	359 ms	16768 KB	Output isn't correct
46	Halted	0 ms	0 KB	-

답안 #1094103

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 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
0 / 17.0

Subtask #7
0 / 25.0