oj.uz

답안 #880281

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
880281 2023-11-29T05:59:16 Z Mr_Husanboy 벽 (IOI14_wall) C++17
0 / 100
 351 ms 35156 KB 
#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;; 
    }

    return;
    rig.clear(); lef.clear();
    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.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 2 ms 604 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 351 ms 35156 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 2 ms 604 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 39.0

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