Submission #560609

#	Time	Username	Problem	Language	Result	Execution time	Memory
560609		CSQ31	Wall (IOI14_wall)	C++17	100 / 100	1190 ms	232472 KiB

wall

#include "wall.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) a.size()
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(1e9+7)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
const int INF = 2e9;
struct node{
	int mx1 = 0,mx2 = -INF,mxc = 1;
	int mn1 = 0,mn2 = INF,mnc = 1;
	node(){}	
};
node merge(node a,node b){
	node c;
	if(a.mx1 == b.mx1){
		c.mx1 = a.mx1;
		c.mxc = a.mxc + b.mxc;
		c.mx2 = max(a.mx2,b.mx2);
	}else{
		if(a.mx1 < b.mx1)swap(a,b);
		c.mx1 = a.mx1;
		c.mxc = a.mxc;
		c.mx2 = max(a.mx2,b.mx1);
	}
	if(a.mn1 == b.mn1){
		c.mn1 = a.mn1;
		c.mnc = a.mnc + b.mnc;
		c.mn2 =  min(a.mn2,b.mn2);
	}else{
		if(a.mn1 > b.mn1)swap(a,b);
		c.mn1 = a.mn1;
		c.mnc = a.mnc;
		c.mn2 = min(a.mn2,b.mn1);
	}
	return c;
}
node t[8000000];
int ans[2000001];
void mxtag(int v,int x){
	if(x >= t[v].mx1)return;
	if(t[v].mx1 == t[v].mn1)t[v].mn1 = x;
	else if(t[v].mn2 == t[v].mx1)t[v].mn2 = x;
	t[v].mx1 = x;
}
void mntag(int v,int x){
	if(x <= t[v].mn1)return;
	if(t[v].mx1 == t[v].mn1)t[v].mx1 = x;
	else if(t[v].mx2 == t[v].mn1)t[v].mx2 = x; //mn,mx only two values
	t[v].mn1 = x;
}
void pushdown(int v){
	mxtag(2*v,t[v].mx1);
	mxtag(2*v+1,t[v].mx1);
	mntag(2*v,t[v].mn1);
	mntag(2*v+1,t[v].mn1);
	
}
void chmin(int v,int l,int r,int tl,int tr,int x){
	if(l > tr || r < tl || x >= t[v].mx1)return;
	if(l<=tl && tr<=r && x > t[v].mx2){
		mxtag(v,x);
		return;
	}
	int tm = (tl+tr)/2;
	pushdown(v);
	chmin(2*v,l,min(tm,r),tl,tm,x);
	chmin(2*v+1,max(tm+1,l),r,tm+1,tr,x);
	t[v] = merge(t[2*v],t[2*v+1]);
}
void chmax(int v,int l,int r,int tl,int tr,int x){
	if(l > tr || r < tl || x <= t[v].mn1)return;
	if(l<=tl && tr<=r && x < t[v].mn2){
		//cout<<l<<" "<<r<<" "<<tl<<" "<<tr<<'\n';
		mntag(v,x);
		return;
	}
	int tm = (tl+tr)/2;
	pushdown(v);
	chmax(2*v,l,min(tm,r),tl,tm,x);
	chmax(2*v+1,max(tm+1,l),r,tm+1,tr,x);
	t[v] = merge(t[2*v],t[2*v+1]);
}
void query(int v,int l,int r){
	if(l==r){
		ans[l] = t[v].mx1;
		return;
	}
	int tm = (l+r)/2;
	pushdown(v);
	query(2*v,l,tm);
	query(2*v+1,tm+1,r);
}
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)chmax(1,left[i],right[i],0,n-1,height[i]);
		else chmin(1,left[i],right[i],0,n-1,height[i]);
	}
	query(1,0,n-1);
	for(int i=0;i<n;i++)finalHeight[i] = ans[i];
}

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