제출 #878421

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
878421		Husayn	벽 (IOI14_wall)	C++14	0 / 100	2 ms	604 KiB

wall

#include "wall.h"
#include <algorithm>
#define ADD 1
#define REMOVE 2
using namespace std;
int const maxn = 2e6 + 9;
int N;
pair<int, int> t[maxn << 2];
void push(int v){
    t[v << 1].first = min(max(t[v << 1].first, t[v].first), t[v].second);
    t[v << 1 | 1].first = min(max(t[v << 1 | 1].first, t[v].first), t[v].second);
    t[v << 1].second = min(max(t[v << 1].second, t[v].first), t[v].second);
	t[v << 1 | 1].second = min(max(t[v << 1 | 1].second, t[v].first), t[v].second);
}
void update(int v, int tl, int tr, int l, int r, int h, int upd){
	if(l <= tl && tr <= r) {
	    if (upd == ADD){
	        t[v].first = max(t[v].first, h);
	        t[v].second = max(t[v].second, h);
		} else{
	        t[v].first = min(t[v].first, h);
	        t[v].second = min(t[v].second, h);
		}
	}
	push(v);
	int tm = tl + tr >> 1;
	update(v << 1, tl, tm, l, r, h, upd);
	update(v << 1 | 1, tm + 1, tr, l, r, h, upd);
    t[v].first = min(t[v << 1].first, t[v << 1 | 1].first);
    t[v].second = min(t[v << 1].second, t[v << 1 | 1].second);
}
 
void rebuild(int v, int tl, int tr, int finalHeight[]){
	if (tl >= N)
	    return;
	if (tl == tr){
		finalHeight[tl] = t[v].first;
		return;
	}
	push(v);
	int tm = tl + tr >> 1;
	rebuild(v << 1, tl, tm, finalHeight);
	rebuild(v << 1 | 1, tm + 1, tr, finalHeight);
}
 
void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
	N = n;
	for (int i = 0; i < k; i++){
	    update(1, 0, maxn - 1, left[i], right[i], height[i], op[i]);
	}
	rebuild(1, 0, maxn - 1, finalHeight);
}

컴파일 시 표준 에러 (stderr) 메시지

wall.cpp: In function 'void update(int, int, int, int, int, int, int)':
wall.cpp:26:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   26 |  int tm = tl + tr >> 1;
      |           ~~~^~~~
wall.cpp: In function 'void rebuild(int, int, int, int*)':
wall.cpp:41:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   41 |  int tm = tl + tr >> 1;
      |           ~~~^~~~

• Subtask 1: 0 / 8
• Subtask 2: 0 / 24
• Subtask 3: 0 / 29
• Subtask 4: 0 / 39