답안 #57993

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
57993	2018-07-16T15:23:41 Z	zetapi	벽 (IOI14_wall)	C++14	0 / 100	261 ms	14236 KB

wall

#include "wall.h"
#include "bits/stdc++.h"
using namespace std;

#define pb  push_back
#define mp  make_pair
#define ll  long long
#define itr ::iterator 

typedef pair<int,int>  pii;

const int MAX=1e5;

struct data
{
	int Min=0;
	int Max=MAX;
}   Seg[MAX];

void Update(int low,int high,int node,int qlow,int qhigh,pii delta,int CurMin,int CurMax)
{
	if(low>high or qlow>qhigh or qhigh<low or qlow>high)
		return ;
	if(Seg[node].Min<=CurMax)
	{
		CurMin=max(CurMin,Seg[node].Min);
		CurMax=min(CurMax,Seg[node].Max);
	}
	Seg[node].Min=CurMin;
	Seg[node].Max=CurMax;
	if(low>=qlow and high<=qhigh)
	{
		if(delta.second==1)
		{
			if(Seg[node].Min>delta.first)
				return ;
			Seg[node].Min=delta.first;
			Seg[node].Max=max(Seg[node].Max,Seg[node].Min);
		}
		else
		{
			if(Seg[node].Max<delta.first)
				return ;
			Seg[node].Max=delta.first;
			Seg[node].Min=min(Seg[node].Min,Seg[node].Max);
		}
		return ;
	}
	int mid=(low+high)/2;
	Update(low,mid,2*node,qlow,qhigh,delta,CurMin,CurMax);
	Update(mid+1,high,2*node+1,qlow,qhigh,delta,CurMin,CurMax);
	return ;
}


int query(int low,int high,int node,int X,int CurMin,int CurMax)
{
	if(Seg[node].Min<=CurMax)
	{
		CurMin=max(CurMin,Seg[node].Min);
		CurMax=min(CurMax,Seg[node].Max);
	}
	if(low==high)
		return CurMin;
	int mid=(low+high)/2;
	if(X>=low and X<=mid)
		return query(low,mid,2*node,X,CurMin,CurMax);
	else
		return query(mid+1,high,2*node+1,X,CurMin,CurMax);
}

void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[])
{
	int N=n,K=k;
	for(int A=0;A<K;A++)
		Update(1,N,1,left[A]+1,right[A]+1,mp(height[A],op[A]),0,MAX);
	for(int A=0;A<N;A++)
		finalHeight[A]=query(1,N,1,A+1,0,MAX);
  	return;
}

/*signed main()
{
	ios_base::sync_with_stdio(false);

	
	return 0;
}*/

Subtask #1

0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	248 KB	Output is correct
2	Correct	4 ms	488 KB	Output is correct
3	Incorrect	4 ms	496 KB	Output isn't correct
4	Halted	0 ms	0 KB	-

Subtask #2

0 / 24.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	564 KB	Output is correct
2	Correct	218 ms	14236 KB	Output is correct
3	Incorrect	261 ms	14236 KB	Output isn't correct
4	Halted	0 ms	0 KB	-

Subtask #3

0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	14236 KB	Output is correct
2	Correct	5 ms	14236 KB	Output is correct
3	Incorrect	5 ms	14236 KB	Output isn't correct
4	Halted	0 ms	0 KB	-

Subtask #4

0 / 39.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	14236 KB	Output is correct
2	Correct	5 ms	14236 KB	Output is correct
3	Incorrect	5 ms	14236 KB	Output isn't correct
4	Halted	0 ms	0 KB	-