oj.uz

답안 #889021

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
889021 2023-12-18T15:31:36 Z BBart888 벽 (IOI14_wall) C++14
100 / 100
 788 ms 92096 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAXN= 2e6+11;


int tmx[4*MAXN];
int tmn[4*MAXN];
pair<int,int> lazy[4*MAXN];

#define ff first
#define ss second


void pull_add(int x, int k){
    tmn[x] = max(tmn[x], k);
    tmx[x] = max(tmx[x], k);
    lazy[x].ff = max(lazy[x].ff, k);
    lazy[x].ss = max(lazy[x].ss, k);
}

void pull_dec(int x, int k){
    tmn[x] = min(tmn[x], k);
    tmx[x] = min(tmx[x], k);
    lazy[x].ff = min(lazy[x].ff, k);
    lazy[x].ss = min(lazy[x].ss, k);
}

void push(int x){
	
	if(lazy[x].ss != 1e9){
        pull_dec(x << 1, lazy[x].ss);
        pull_dec(x << 1 | 1, lazy[x].ss);
    }
	
    if(lazy[x].ff != -1e9){
        pull_add(x << 1, lazy[x].ff);
        pull_add(x << 1 | 1, lazy[x].ff);
    }
    
    lazy[x] = {-1e9, 1e9};
}



void upd(int v,int tl,int  tr,int l,int r,int type,int val)
{
	if(l > r)
		return;
	if(l == tl && tr ==r)
	{
			if(type == 1)
				pull_add(v,val);
			else
				pull_dec(v,val);
			return;
	}
	int tm =(tl+tr)/2;
	push(v);
	upd(2*v,tl,tm,l,min(r,tm),type,val);
	upd(2*v+1,tm+1,tr,max(l,tm+1),r,type,val);
	tmx[v] = max(tmx[2*v],tmx[2*v+1]);
	tmn[v] = min(tmn[2*v],tmn[2*v+1]);
}


int get(int v,int tl,int tr,int pos)
{
	if(tl == tr)
		return tmx[v];
	int tm =(tl+tr)/2;
	push(v);
	if(pos <= tm)
		return get(2*v,tl,tm,pos);
	else
		return get(2*v+1,tm+1,tr,pos);
}



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)
				upd(1,0,MAXN,left[i],right[i],1,height[i]);
			else
				upd(1,0,MAXN,left[i],right[i],0,height[i]);
		}

	for(int i =0;i<n;i++)
		finalHeight[i] = get(1,0,MAXN,i);
		
	

}
/*

int main()
{
	cin.tie(0);
	cout.tie(0);
	
	
	
	
	upd(1,0,MAXN,1,5,1,6);
	upd(1,0,MAXN,4,5,0,3);
	
	
	
	for(int i =0;i<=10;i++)
		cout<<get(1,0,MAXN,i)<<" ";
			

	
	
	
	
	
	return 0;
}

*/

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 3 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 8 ms 1116 KB Output is correct
5 Correct 5 ms 1068 KB Output is correct
6 Correct 5 ms 1112 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 222 ms 8472 KB Output is correct
3 Correct 171 ms 4564 KB Output is correct
4 Correct 468 ms 12288 KB Output is correct
5 Correct 256 ms 12804 KB Output is correct
6 Correct 251 ms 12704 KB Output is correct

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 3 ms 600 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 7 ms 1112 KB Output is correct
5 Correct 5 ms 1072 KB Output is correct
6 Correct 5 ms 1116 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 214 ms 8472 KB Output is correct
9 Correct 171 ms 4436 KB Output is correct
10 Correct 521 ms 12372 KB Output is correct
11 Correct 266 ms 12692 KB Output is correct
12 Correct 314 ms 12884 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 213 ms 8340 KB Output is correct
15 Correct 32 ms 1624 KB Output is correct
16 Correct 559 ms 12544 KB Output is correct
17 Correct 257 ms 12504 KB Output is correct
18 Correct 264 ms 12392 KB Output is correct

Subtask #4
39.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 3 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 8 ms 1116 KB Output is correct
5 Correct 5 ms 1116 KB Output is correct
6 Correct 5 ms 1116 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 209 ms 8596 KB Output is correct
9 Correct 168 ms 4568 KB Output is correct
10 Correct 467 ms 12288 KB Output is correct
11 Correct 260 ms 12624 KB Output is correct
12 Correct 253 ms 12624 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 252 ms 8440 KB Output is correct
15 Correct 32 ms 1628 KB Output is correct
16 Correct 550 ms 12624 KB Output is correct
17 Correct 259 ms 12368 KB Output is correct
18 Correct 277 ms 12628 KB Output is correct
19 Correct 744 ms 91876 KB Output is correct
20 Correct 725 ms 89684 KB Output is correct
21 Correct 723 ms 92076 KB Output is correct
22 Correct 731 ms 89540 KB Output is correct
23 Correct 735 ms 89472 KB Output is correct
24 Correct 788 ms 89456 KB Output is correct
25 Correct 711 ms 89356 KB Output is correct
26 Correct 723 ms 92096 KB Output is correct
27 Correct 722 ms 91988 KB Output is correct
28 Correct 735 ms 89628 KB Output is correct
29 Correct 719 ms 89564 KB Output is correct
30 Correct 712 ms 89568 KB Output is correct