제출 #349425

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
349425		David_M	벽 (IOI14_wall)	C++14	24 / 100	788 ms	59884 KiB

wall

#include "wall.h"
#include <bits/stdc++.h>
#define pb push_back
using namespace std;
const int INF=1e9+2021;
struct uwu{int type, height, time; uwu (int x, int y, int z){time=x;type=y;height=z;} };
vector<uwu> v[1<<20];
int T[2][1<<22], M[2], K;
 
void build (int x=1, int l=0, int r=K){
	if(l==r){ T[1][x]=(!!l)*INF; return; }
	build(x<<1, l, l+r>>1);
	build(x<<1|1, l+r+2>>1, r);
	T[1][x]=min(T[1][x<<1], T[1][x<<1|1]);
}
 
void upd(uwu a, int x=1, int l=0, int r=K){
	if(l==r){ T[a.type][x]=a.height; return; }
	int mid=l+r>>1;
	if(a.time<mid) upd(a, x<<1, l, mid);
	else upd(a, x<<1|1, mid+1, r);
	
	T[0][x]=max(T[0][x<<1], T[0][x<<1|1]);
	T[1][x]=min(T[1][x<<1], T[1][x<<1|1]);
}
 
int get(int x=1, int l=0, int r=K){
	if(l==r){
		M[0]=max(M[0], T[0][x]), 
		M[1]=min(M[1], T[1][x]);
//		return (T[0][x]==M[0])?M[1]:M[0];
		if(T[0][x]==M[0])return M[1];
		if(T[1][x]==M[1])return M[0];
		assert(0);
	}
	int m[]={max(M[0], T[0][x<<1|1]), min(M[1], T[1][x<<1|1])}, mid=l+r>>1;
	if(m[1]>m[0]){ M[0]=m[0]; M[1]=m[1]; return get(x<<1, l, mid); }
	else return get(x<<1|1, mid+1, r);
}
 
void buildWall(int n,int k,int op[],int left[],int right[],int height[],int finalHeight[]){
	K=k; build();

	for(int i=0; i<k; i++){
		op[i]--;
		v[left[i]].pb({i+1, op[i], height[i]});
		v[right[i]+1].pb({i+1, op[i], op[i]*INF});
	}
	for (int i=0; i<n; i++){
		for (int j=0; j<v[i].size(); j++) upd(v[i][j]);
		M[0]=0; M[1]=INF; finalHeight[i]=get();
	}
}

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

wall.cpp: In function 'void build(int, int, int)':
wall.cpp:12:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   12 |  build(x<<1, l, l+r>>1);
      |                 ~^~
wall.cpp:13:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   13 |  build(x<<1|1, l+r+2>>1, r);
      |                ~~~^~
wall.cpp: In function 'void upd(uwu, int, int, int)':
wall.cpp:19:11: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   19 |  int mid=l+r>>1;
      |          ~^~
wall.cpp: In function 'int get(int, int, int)':
wall.cpp:36:67: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   36 |  int m[]={max(M[0], T[0][x<<1|1]), min(M[1], T[1][x<<1|1])}, mid=l+r>>1;
      |                                                                  ~^~
wall.cpp: In function 'void buildWall(int, int, int*, int*, int*, int*, int*)':
wall.cpp:50:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<uwu>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |   for (int j=0; j<v[i].size(); j++) upd(v[i][j]);
      |                 ~^~~~~~~~~~~~

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