Submission #1211871

#	Time	Username	Problem	Language	Result	Execution time	Memory
1211871		LIA	벽 (IOI14_wall)	C++17	0 / 100	0 ms	328 KiB

wall

#include "wall.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef tuple<ll, ll, ll> plll;
typedef vector<plll> vplll;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<pll> vpll;
typedef vector<vector<pll>> vvpll;
typedef vector<vector<ll>> vvll;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
#define loop(i, s, e) for (ll i = (s); i < (e); ++i)
#define loopr(i, e, s) for (ll i = (e)-1; i >= (s); --i)
#define all(a) a.begin(), a.end()
const ll inf = 1e9 + 7;
vll h;

void t1(ll l ,ll r, ll hi) {
  loop(i,l,r+1) {
    h[i] = max(h[i], hi);
  }
}


void t2(ll l ,ll r, ll hi) {
  loop(i,l,r+1) {
    h[i] = min(h[i], hi);
  }
}

void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]) {
  h.resize(n,inf);
  loop(i,0,k) {
    ll l = left[i], r = right[i],hi= height[i];
    if (op[i]==1) {
      continue;
      t1(l,r,hi);
    }
    else t2(l,r,hi);
  }

  loop(i,0,n) {
    finalHeight[i] = h[i];
  }
}

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