Submission #554377

#	Time	Username	Problem	Language	Result	Execution time	Memory
554377		Koosha_mv	Wall (IOI14_wall)	C++14	8 / 100	3056 ms	143376 KiB

wall

#include <bits/stdc++.h>
using namespace std;
#define dbgv(v) cout<<#v<<" = "; f(i,0,v.size()) cout<<v[i]<<" "; cout<<endl
#define dbga(a,x,y) cout<<#a<<" = "; f(i,x,y) cout<<a[i]<<" "; cout<<endl
#define erorp(x) cout<<#x<<"={"<<x.F<<" , "<<x.S<<"}"<<endl
#define eror(x) cout<<#x<<'='<<(x)<<endl
#define f_(i,a,b) for(int i=a;i>=b;i--)
#define f(i,a,b) for(int i=a;i<b;i++)
#define nb(x) __builtin_popcount(x)
#define all(v) v.begin(),v.end()
#define bit(n,k) (((n)>>(k))&1)
#define Add(x,y) x=(x+y)%mod
#define maxm(a,b) a=max(a,b)
#define minm(a,b) a=min(a,b)
#define lst(x) x[x.size()-1]
#define sz(x) int(x.size())
#define mp make_pair
#define ll long long
#define pb push_back
#define S second
#define F first
#include "wall.h"

const int N=2e6+99;

int n,m,q,seg0[N],seg1[N];
priority_queue<int> q0[N],q1[N];

void buildWall(int _n, int _k, int op[], int left[], int right[], int height[], int finalHeight[]){
	n=_n;
	q=_k;
	f(i,0,q){
		right[i]++;
		if(op[i]==1){
			f(j,left[i],right[i]) maxm(finalHeight[j],height[i]);
		}
		else{
			f(j,left[i],right[i]) minm(finalHeight[j],height[i]);
		}
	}
}

/*
int32_t main(){
	ios:: sync_with_stdio(0), cin.tie(0), cout.tie(0);

}*/

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