제출 #297686

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
297686		kevlee	벽 (IOI14_wall)	C++17	100 / 100	1020 ms	85496 KiB

wall

#include "wall.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mod 1000000007
#define h1 7897897897897897
#define h2 7897466719774591
#define b1 98762051
#define b2 98765431
#define inf 1000000000
#define pi 3.1415926535897932384626
#define LMAX 9223372036854775807
#define ll long long
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define vp vector<pii>
#define SET(a, b) memset(a, b, sizeof(a))
#define all(x) (x).begin(), (x).end()
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
//max, min, current mode
struct node {
  int max, min;
} lazy[8000005], upd;
int seg[8000005];
int ans[2000005];
void merge(node b, node& a) { //update a with b
  a.max = min(max(a.max, b.max), b.min);
  a.min = min(max(a.min, b.max), b.min);
}
void pushdown(int id, int l, int r) {
  seg[id] = max(seg[id], lazy[id].max);
  seg[id] = min(seg[id], lazy[id].min);
  if (l != r) {
    merge(lazy[id], lazy[id * 2]);
    merge(lazy[id], lazy[id * 2 + 1]);
  }
  lazy[id].max = 0;
  lazy[id].min = inf;
}
void update(int id, int l, int r, int ql, int qr) {
  pushdown(id, l, r);
  if (ql > r || qr < l) return;
  if (ql <= l && r <= qr) {
    merge(upd, lazy[id]);
    pushdown(id, l, r);
    return;
  }
  int mid = (l + r) >> 1;
  update(id * 2, l, mid, ql, qr);
  update(id * 2 + 1, mid + 1, r, ql, qr);
}
void query(int id, int l, int r) {
  pushdown(id, l, r);
  if (l == r) {
    ans[l] = seg[id];
    return;
  }
  int mid = (l + r) >> 1;
  query(id * 2, l, mid);
  query(id * 2 + 1, mid + 1, r);
}
void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
  FOR(i, 0, k-1) {
    left[i]++;
    right[i]++;
    if (op[i] == 1) {
      upd = {height[i], inf};
      update(1, 1, n, left[i], right[i]);
    } else {
      upd = {0, height[i]};
      update(1, 1, n, left[i], right[i]);
    }
  }
  query(1, 1, n);
  FOR(i, 0, n-1) finalHeight[i] = ans[i+1];
  return;
}

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