| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 585675 | LastRonin | 벽 (IOI14_wall) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "wall.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
const int N = 3e6;
vector<int> g[N];
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;
int per = 0;
for(int i = 0; i < k; i++) {
if(op[i] == 2)break;
per = i;
}
for(int j = 0; j <= n; j++)g[j].clear();
q.clear();
for(int i = 0; i <= per; i++) {
assert(op[i] == 1);
g[left[i]].pb(height[i]);
g[right[i] + 1].pb(-height[i]);
}
multiset<int> q;
for(int j = 0; j < n; j++) {
for(auto u : g[j]) {
if(u < 0)
q.erase(q.find(-u));
else
q.insert(u);
}
finalHeight[j] = *q.rbegin();
}
for(int j = 0; j <= n; j++)g[j].clear();
q.clear();
for(int i = per + 1; i < k; i++) {
assert(op[i] == 2);
g[left[i]].pb(height[i]);
g[right[i] + 1].pb(-height[i]);
}
for(int j = 0; j < n; j++) {
for(auto u : g[j]) {
if(u < 0)
q.erase(q.find(-u));
else
q.insert(u);
}
finalHeight[j] = min(finalHeight[j], *q.begin());
}
return;
}