oj.uz

답안 #754417

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
754417 2023-06-07T17:49:33 Z A_D 벽 (IOI14_wall) C++14
24 / 100
 567 ms 13872 KB 
#include "wall.h"
#include <bits/stdc++.h>
#define ii pair<int,int>
#define F first
#define S second
using namespace std;
const int N=2e6+100;
int mn[4*N];
int mx[4*N];
int seg[4*N];
  
ii com(ii a, ii b,int&u,int h)
{
  if(a.S<b.F){
    u=a.S;
    return {a.S,a.S};
  }
  if(b.S<a.F){
    u=a.F;
    return {a.F,a.F};
  }
  if(a.F<=b.F&&b.S<=a.S){
    return b;
  }
  if(b.F<=a.F&&a.S<=b.S){
    u=h;
    return a;
  }
  return make_pair(max(a.F,b.F),min(a.S,b.S));
}
  
void update(int p,int s,int e,int a,int b,int h,int t,ii v,int par)
{
  ii r;
  r.F=mn[p];
  r.S=mx[p];
  v=com(v,r,seg[p],par);
  mn[p]=v.F;
  mx[p]=v.S;
  if(a<=s&&e<=b){
    if(t==1){
      mn[p]=max(mn[p],h);
      if(mn[p]>mx[p]){
        mn[p]=h;
      }
    }
    else{
      mx[p]=min(mx[p],h);
      if(mx[p]<mn[p]){
        mn[p]=h;
      }
    }
    return;
  }
  if(a>e || b<s){
    return;
  }
  mn[p]=0;
  mx[p]=1e5;
  int mid=(s+e)/2;
  update(p*2,s,mid,a,b,h,t,v,seg[p]);
  update(p*2+1,mid+1,e,a,b,h,t,v,seg[p]);
}
int get(int p,int s,int e,int i,ii v,int par)
{
  v=com(v,{mn[p],mx[p]},seg[p],par);
  if(s==e){
    return v.F;
  }
  int mid=(s+e)/2;
  if(i<=mid){
    return get(p*2,s,mid,i,v,seg[p]);
  }
  else{
    return get(p*2+1,mid+1,e,i,v,seg[p]);
  }
}
  
void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[])
{
    for(int i=0;i<4*n;i++){
      mn[i]=0;
      mx[i]=1e5;
      seg[i]=0;
    }
    for(int i=0;i<k;i++){
      assert(height[i]>=0 && height[i]<=(int)1e5);
      update(1,0,n-1,left[i],right[i],height[i],op[i],make_pair(0,1e5),0);
    }
    for(int i=0;i<n;i++){
      finalHeight[i]=get(1,0,n-1,i,{0,1e5},0);
    }
    //cout<<"\n";
}

Subtask #1
0 / 8.0

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

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 124 ms 8128 KB Output is correct
3 Correct 208 ms 4536 KB Output is correct
4 Correct 567 ms 13476 KB Output is correct
5 Correct 312 ms 13868 KB Output is correct
6 Correct 296 ms 13872 KB Output is correct

Subtask #3
0 / 29.0

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

Subtask #4
0 / 39.0

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