| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 204570 | 2020-02-26T10:35:29 Z | awlintqaa | 벽 (IOI14_wall) | C++14 | 0 ms | 0 KB |
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 200
#define mid (l+r)/2
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
typedef long long ll;
typedef short int si;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const ll mod=1e9+7;
const ll inf= 4e18;
const ld pai=acos(-1);
#include "wall.h"
int n,q;
void buildWall(int N, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
n=N,q=K;
for(int i=0;i<n;i++)finalHeight[i]=0;
for(int i=0;i<q;i++){
int t=op[i];
int l=left[i];
int r=right[i];
int h=height[i];
for(int j=l;j<=r;j++){
if(t==1){
finalHeight[j]=max(finalHeight[j],h);
}
if(t==2){
finalHeight[j]=min(finalHeight[j],h);
}
}
}
return;
}