oj.uz

답안 #1017556

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1017556 2024-07-09T08:48:59 Z dosts 벽 (IOI14_wall) C++17
0 / 100
 87 ms 13892 KB 
#include "wall.h"
#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define pii pair<int,int>
#define vi vector<int>
#define ff first
#define ss second
#define sp << " " <<
#define all(xx) xx.begin(),xx.end()



struct ST {
  vector<pii> lazy;
  vector<pii> t;

  ST(int nn) {
    lazy.assign(4*nn+1,pii{-1,-1});
    t.assign(4*nn+1,pii{-1,-1});
  }
  pii propmini(pii state,int minimise) {
    if (state.ss != -1) {
      //bişeyle maximise edilmiş
      if (state.ss <= minimise) return state;
      return {minimise,minimise};
    }
    else {
      if (state.ff <= minimise) return state;
      return {minimise,-1};
    }
  }

  pii propmaxi(pii state,int maximise) {
    if (state.ss != -1) {
      if (state.ss >= maximise) return state;
    }
    return {state.ff,maximise};
  }

  void push(int node,bool leaf) {
    if (lazy[node].ff != -1) t[node] = propmini(t[node],lazy[node].ff);
    if (lazy[node].ss != -1) t[node] = propmaxi(t[node],lazy[node].ss);
    if (leaf) {
      lazy[2*node] = propmini(lazy[2*node],lazy[node].ff);
      lazy[2*node] = propmaxi(lazy[2*node],lazy[node].ss);
      lazy[2*node+1] = propmini(lazy[2*node+1],lazy[node].ff);
      lazy[2*node+1] = propmaxi(lazy[2*node+1],lazy[node].ss);
    }
    lazy[node]={-1,-1};
  }

  void mini(int node,int l,int r,int L,int R,int v) {
    push(node,l==r);
    if (l > R || r < L) return;
    if (l >= L && r <= R) {
      lazy[node] = propmini(lazy[node],v);
      push(node,l==r);
      return;
    }
    int m = (l+r) >> 1;
    mini(2*node,l,m,L,R,v);
    mini(2*node+1,m+1,r,L,R,v);
  }
  void maxi(int node,int l,int r,int L,int R,int v) {
    push(node,l==r);
    if (l > R || r < L) return;
    if (l >= L && r <= R) {
      lazy[node] = propmaxi(lazy[node],v);
      push(node,l==r);
      return;
    }
    int m = (l+r) >> 1;
    maxi(2*node,l,m,L,R,v);
    maxi(2*node+1,m+1,r,L,R,v);
  }
  pii query(int node,int l,int r,int p) {
    push(node,l==r);
    if (l == r) return t[node];
    int m = (l+r) >> 1;
    if (p<=m) return query(2*node,l,m,p);
    return query(2*node+1,m+1,r,p);
  }
};


void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
  ST st(n);
  for (int i=0;i<k;i++){
    if (op[i] == 1) {
      //ADD
      st.maxi(1,1,n,left[i]+1,right[i]+1,height[i]);
    }
    else {
      //REM
      st.mini(1,1,n,left[i]+1,right[i]+1,height[i]);
    }
  }
  for (int i=0;i<n;i++) finalHeight[i] = st.query(1,1,n,i+1).second;
  return;
}

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 87 ms 13892 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -