제출 #1043338

#제출 시각아이디문제언어결과실행 시간메모리
1043338MalixWall (IOI14_wall)C++14
8 / 100
3073 ms18068 KiB
#include "wall.h"
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> tii;
typedef vector<ll> li;
typedef vector<li> lii;
 
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define LSOne(s) ((s)&(-s))
 
ll INF=1e18+10;
int inf=1e9+10;
ll M=1e9+7;

void buildWall(int n, int k, int t[], int l[], int r[], int h[], int finalHeight[]){
  vi ans(n,0);
  REP(i,0,k){
    if(t[i]==1){
      REP(j,l[i],r[i]+1)ans[j]=max(ans[j],h[i]);
    }
    else{
      REP(j,l[i],r[i]+1)ans[j]=min(ans[j],h[i]);
    }
  }
  REP(i,0,n)finalHeight[i]=ans[i];
  return;
}

#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...