Submission #349326

#	Time	Username	Problem	Language	Result	Execution time	Memory
349326		David_M	Wall (IOI14_wall)	C++14	0 / 100	35 ms	49516 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=z,type=x,height=y;} };
vector<uwu> v[1<<21];
int T[2][1<<21], M[2], K;

void build (int x=1, int l=0, int r=K){
	if(l==r){ T[1][x]=(!!l)*INF; return; }
	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) return (T[0][x]==M[0])?M[1]:M[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], get(x<<1, l, mid);
	else get(x<<1|1, mid+1, r);
}

void buildWall(int n, int k, int op[], int left[], int right[],int height[], int finalHeight[]){
	
	build(); K=k;
	
	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]==1?0: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();
	}
	*/
}

Compilation message (stderr)

wall.cpp: In function 'void upd(uwu, int, int, int)':
wall.cpp:17:11: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   17 |  int mid=l+r>>1;
      |          ~^~
wall.cpp: In function 'int get(int, int, int)':
wall.cpp:27:67: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   27 |  int m[]={max(M[0], T[0][x<<1|1]), min(M[1], T[1][x<<1|1])}, mid=l+r>>1;
      |                                                                  ~^~
wall.cpp:30:1: warning: control reaches end of non-void function [-Wreturn-type]
   30 | }
      | ^

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