oj.uz

Submission #126521

# Submission time Handle Problem Language Result Execution time Memory
126521 2019-07-08T03:03:29 Z StevenH Wall (IOI14_wall) C++14
0 / 100
 242 ms 8136 KB 
#include "wall.h"
#include <iostream>
using namespace std;
int nn;
const int maxn = 2000005;
struct Wall{
	int max,min,val;
}wall[maxn*4];
int fh[maxn];
void add(int p,int x,int y,int tx,int ty,int h) 
{
	int mid=(x+y)/2;
	if(y<tx || ty<x)return ;
	if(tx<=x && y<=ty)	// xy在txty中 
	{
		if(h>=wall[p].max)	// 高度大於區間最高值 全部改 
		{
			wall[p].max=h; 
			wall[p].min=h;
			wall[p].val=h;
			return ;
		}
		else if(h<wall[p].min)return ;//高度小於區間最小 
	}
	if(wall[p].max == wall[p].min)
	{
		wall[p*2].max=wall[p*2+1].max=wall[p].val;
		wall[p*2].min=wall[p*2+1].min=wall[p].val;
		wall[p*2].val=wall[p*2+1].val=wall[p].val;
		wall[p].val=0;
	}
	add(p*2,x,mid,tx,ty,h);
	add(p*2+1,mid+1,y,tx,ty,h);
	wall[p].max=max(wall[p*2].max,wall[p*2+1].max);
	wall[p].min=min(wall[p*2].min,wall[p*2+1].min);
	return ;
}
void rmv(int p,int x,int y,int tx,int ty,int h)
{
	int mid=(x+y)/2;
	if(y<tx || ty<x)return ;
	if(tx<=x && y<=ty)	// xy在txty中 
	{
		if(h<=wall[p].min)	// 高度小於區間最低值 全部改 
		{
			wall[p].max=h; 
			wall[p].min=h;
			wall[p].val=h;
			return ;
		}
		else if(h>wall[p].max)return ;//高度大於區間最大 捨去 
	}
	if(wall[p].max == wall[p].min)
	{
		wall[p*2].max=wall[p*2+1].max=wall[p].val;
		wall[p*2].min=wall[p*2+1].min=wall[p].val;
		wall[p*2].val=wall[p*2+1].val=wall[p].val;
		wall[p].val=0;
	}
	rmv(p*2,x,mid,tx,ty,h);
	rmv(p*2+1,mid+1,y,tx,ty,h);	
	wall[p].max=max(wall[p*2].max,wall[p*2+1].max);
	wall[p].min=min(wall[p*2].min,wall[p*2+1].min);
	return ;
}
void find(int p,int x,int y)
{
	if(wall[p].max==wall[p].min)
	{
		for(int i=x;i<=y;i++)fh[i]=wall[p].min;
		return ;
	}
	int mid=(x+y)/2;
	find(p*2,x,mid);
	find(p*2+1,mid+1,y);
	return ;
}
void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
  	
	for(int i=0;i<k;i++)
	{
		if(op[i]==1)add(1,0,n-1,left[i],right[i],height[i]);	
		if(op[i]==2)rmv(1,0,n-1,left[i],right[i],height[i]);	
		//find(1,0,n-1);
		//for (int j=0;j<n;j++)printf("%d ", fh[j]);
		//cout<<endl;
	}
  	find(1,0,n-1);
  	for(int i=0;i<n;i++)finalHeight[i]=fh[i];
  	return;
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 4 ms 376 KB Output is correct
3 Incorrect 3 ms 248 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 171 ms 8136 KB Output is correct
3 Incorrect 242 ms 4472 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 4 ms 376 KB Output is correct
3 Incorrect 4 ms 376 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 252 KB Output is correct
2 Correct 4 ms 376 KB Output is correct
3 Incorrect 3 ms 376 KB Output isn't correct
4 Halted 0 ms 0 KB -