oj.uz

답안 #784596

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
784596 2023-07-16T10:35:48 Z FatihSolak 벽 (IOI14_wall) C++17
100 / 100
 806 ms 141276 KB 
#include "wall.h"
#include <bits/stdc++.h>
using namespace std;
const int INF = 2e9;
struct SegTree{
	struct node{
		int mini1,mini2;
		int maxi1,maxi2;
		node():mini1(0),mini2(INF),maxi1(0),maxi2(-INF){}
		void setmax(int x){
			if(x <= mini1)
				return;
			mini1 = x;
			if(maxi1 <= x){
				maxi1 = x;
			}
			else if(maxi2 < x){
				maxi2 = x;
			}
		}
		void setmin(int x){
			if(x >= maxi1)
				return;
			maxi1 = x;
			if(mini1 >= x){
				mini1 = x;
			}
			else if(mini2 > x){
				mini2 = x;
			}
		}		
	};
	node merge(node a,node b){
		if(a.maxi1 == b.maxi1){
			a.maxi2 = max(a.maxi2,b.maxi2);
		}
		else{
			if(a.maxi1 > b.maxi1){
				a.maxi2 = max(a.maxi2,b.maxi1);
			}
			else{
				a.maxi2 = max(a.maxi1,b.maxi2);
				a.maxi1 = b.maxi1;
			}
		}

		if(a.mini1 == b.mini1){
			a.mini2 = min(a.mini2,b.mini2);
		}
		else{
			if(a.mini1 < b.mini1){
				a.mini2 = min(a.mini2,b.mini1);
			}
			else{
				a.mini2 = min(a.mini1,b.mini2);
				a.mini1 = b.mini1;
			}
		}
		return a;
	}
	vector<node> t;
	int n;
	SegTree(int sz){
		n = sz;
		t.assign(4*n,node());
	}
	void push(int v){
		t[v*2].setmax(t[v].mini1);
		t[v*2].setmin(t[v].maxi1);
		t[v*2 + 1].setmax(t[v].mini1);
		t[v*2 + 1].setmin(t[v].maxi1);
	}
	void upd(int v,int tl,int tr,int l,int r,int val,int op){
		if(tr < l || r < tl || (op == 1 && t[v].mini1 >= val) || (op == 2 && t[v].maxi1 <= val)){
			return;
		}
		if(l <= tl && tr <= r && ((op == 1 && t[v].mini2 > val) || (op == 2 && t[v].maxi2 < val))){
			if(op == 1){
				t[v].setmax(val);
			}
			else t[v].setmin(val);
			return;
		}
		push(v);
		int tm = (tl + tr)/2;
		upd(v*2,tl,tm,l,r,val,op);
		upd(v*2 + 1,tm+1,tr,l,r,val,op);
		t[v] = merge(t[v*2],t[v*2+1]);
	}
	int get(int v,int tl,int tr,int pos){
		if(tl == tr){
			return t[v].maxi1;
		}
		push(v);
		int tm = (tl + tr)/2;
		if(pos <= tm){
			return get(v*2,tl,tm,pos);
		}
		return get(v*2+1,tm+1,tr,pos);
	}
	void upd(int l,int r,int val,int op){
		upd(1,0,n-1,l,r,val,op);
	}
	int get(int pos){
		return get(1,0,n-1,pos);
	}
};
void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
	SegTree t(n);
	for(int i = 0;i<k;i++){
		t.upd(left[i],right[i],height[i],op[i]);
	}
	for(int i = 0;i<n;i++){
		finalHeight[i] = t.get(i);
	}
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 6 ms 980 KB Output is correct
5 Correct 7 ms 980 KB Output is correct
6 Correct 7 ms 980 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 131 ms 8116 KB Output is correct
3 Correct 56 ms 4684 KB Output is correct
4 Correct 180 ms 14696 KB Output is correct
5 Correct 165 ms 14728 KB Output is correct
6 Correct 175 ms 14776 KB Output is correct

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 6 ms 980 KB Output is correct
5 Correct 5 ms 980 KB Output is correct
6 Correct 5 ms 980 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 136 ms 8064 KB Output is correct
9 Correct 57 ms 4676 KB Output is correct
10 Correct 142 ms 14684 KB Output is correct
11 Correct 148 ms 14752 KB Output is correct
12 Correct 168 ms 14776 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 114 ms 8120 KB Output is correct
15 Correct 28 ms 1884 KB Output is correct
16 Correct 461 ms 14780 KB Output is correct
17 Correct 252 ms 14780 KB Output is correct
18 Correct 247 ms 14704 KB Output is correct

Subtask #4
39.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 9 ms 980 KB Output is correct
5 Correct 7 ms 980 KB Output is correct
6 Correct 5 ms 980 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 108 ms 8104 KB Output is correct
9 Correct 56 ms 4656 KB Output is correct
10 Correct 143 ms 14700 KB Output is correct
11 Correct 150 ms 14784 KB Output is correct
12 Correct 209 ms 14784 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 110 ms 8020 KB Output is correct
15 Correct 30 ms 1880 KB Output is correct
16 Correct 465 ms 14704 KB Output is correct
17 Correct 249 ms 14688 KB Output is correct
18 Correct 246 ms 14688 KB Output is correct
19 Correct 711 ms 141132 KB Output is correct
20 Correct 711 ms 141192 KB Output is correct
21 Correct 723 ms 141276 KB Output is correct
22 Correct 750 ms 141116 KB Output is correct
23 Correct 768 ms 141188 KB Output is correct
24 Correct 718 ms 141188 KB Output is correct
25 Correct 718 ms 141224 KB Output is correct
26 Correct 806 ms 141152 KB Output is correct
27 Correct 723 ms 141164 KB Output is correct
28 Correct 739 ms 141164 KB Output is correct
29 Correct 761 ms 141188 KB Output is correct
30 Correct 711 ms 141192 KB Output is correct