Submission #287081

#	Time	Username	Problem	Language	Result	Execution time	Memory
287081		Atill83	벽 (IOI14_wall)	C++14	8 / 100	3103 ms	83036 KiB

wall

#include "wall.h"
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
const int MAXN = (int) 2e6 + 5;
typedef pair<int, int> pii;
vector<int> yer[MAXN];
set<int> st;

void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
    for(int i = 0; i < n; i++)
        finalHeight[i] = 0;

    for(int i = 0; i < k; i++){
        yer[left[i]].push_back(i + 1);
        yer[right[i] + 1].push_back(-(i + 1));
    }

    for(int i = 0; i < n; i++){
        if(yer[i].size() == 0){
            if(i == 0) 
                finalHeight[i] = 0;
            else
                finalHeight[i] = finalHeight[i - 1];
            continue;
        }
        for(int j: yer[i]){
            if(j < 0) st.erase(-(j + 1));
            else st.insert(j - 1);
        }
        int cur = 0;
        for(int j: st){
            if(op[j] == 1)
                cur = max(cur, height[j]);
            else
                cur = min(cur, height[j]);
        }
        finalHeight[i] = cur;
    }

    return;
}

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