제출 #880290

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
880290		Mr_Husanboy	벽 (IOI14_wall)	C++17	24 / 100	499 ms	40516 KiB

wall

#include "wall.h"
#include <bits/stdc++.h>

using namespace std;
const int inf = 1e9;

void buildWall(int n, int k, int op[], int left[], int right[], int height[], int ans[]){
    vector<vector<int>> rig(n + 1), lef(n + 1);
    for(int i = 0; i < k; i ++){
      if(op[i] == 1) rig[right[i]].push_back(height[i]), lef[left[i]].push_back(height[i]);
    }
    multiset<int> st;

    for(int i = 0; i < n; i ++){
      for(auto h : lef[i]){
        st.insert(h);
      }
      ans[i] = (st.empty() ? 0 : *st.rbegin());
      for(auto h : rig[i]) st.erase(st.find(h));//, cout << h << endl;; 
    }


    rig.clear(); lef.clear();
    rig.resize(n); lef.resize(n);
    for(int i = 0; i < k; i ++){
      if(op[i] == 2) rig[right[i]].push_back(height[i]), lef[left[i]].push_back(height[i]);
    }

    for(int i = 0; i < n; i ++){
      for(auto h : lef[i]){
        st.insert(h);
      }
      ans[i] = min(ans[i], (st.empty() ? inf : *st.begin()));
      for(auto h : rig[i]) st.erase(st.find(h)); 
    }
}

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