#include <bits/stdc++.h>
#include "wall.h"
#define pb push_back
#define eb emplace_back
#define ll long long
#define pii pair < int, int >
#define fr first
#define sc second
#define mk make_pair
#define sz(s) (int)s.size()
#define all(s) s.begin(), s.end()
#define ok puts("ok");
#define whatis(x) cerr << #x << " = " << x << endl;
#define pause system("pause");
#define random (rand() ^ (rand() << 15))
using namespace std;
const int N = (int)2e6 + 7;
int n;
set < int > in[N], er[N];
int a[N];
void buildWall(int nn, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
n = nn;
for (int i = 0; i < k; i++) {
if (op[i] == 2) break;
in[left[i]].insert(height[i]);
er[right[i] + 1].insert(height[i]);
}
set < int > cur;
for (int i = 0; i < n; i++) {
for (auto to : er[i])
cur.erase(to);
for (auto to : in[i])
cur.insert(to);
in[i].clear();
er[i].clear();
if (cur.empty()) continue;
a[i] = *cur.rbegin();
}
cur.clear();
for (int i = 0; i < k; i++) {
if (op[i] == 1) continue;
in[left[i]].insert(height[i]);
er[right[i] + 1].insert(height[i]);
}
for (int i = 0; i < n; i++) {
for (auto to : er[i])
cur.erase(to);
for (auto to : in[i])
cur.insert(to);
in[i].clear();
er[i].clear();
if (cur.empty()) continue;
a[i] = min(*cur.rbegin(), a[i]);
}
for (int i = 0; i < n; i++) {
finalHeight[i] = a[i];
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
152 ms |
188280 KB |
Output is correct |
2 |
Incorrect |
155 ms |
188796 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
150 ms |
188796 KB |
Output is correct |
2 |
Incorrect |
965 ms |
210020 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
153 ms |
210020 KB |
Output is correct |
2 |
Incorrect |
161 ms |
210020 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
155 ms |
210020 KB |
Output is correct |
2 |
Incorrect |
159 ms |
210020 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |