#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, c;
set < pii > 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;
if (n <= 10000 && k <= 5000) {
for (int i = 0; i < k; i++) {
for (int j = left[i]; j <= right[i]; j++) {
if (op[i] == 1) {
a[j] = max(a[j], height[i]);
} else {
a[j] = min(a[j], height[i]);
}
}
}
for (int i = 0; i < n; i++) {
finalHeight[i] = a[i];
}
return ;
}
for (int i = 0; i < k; i++) {
if (op[i] == 2) break;
in[left[i]].insert(mk(height[i], c++));
er[right[i] + 1].insert(mk(height[i], c++));
}
set < pii > 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() -> fr;
}
cur.clear();
for (int i = 0; i < k; i++) {
if (op[i] == 1) continue;
in[left[i]].insert(mk(height[i], c++));
er[right[i] + 1].insert(mk(height[i], c++));
}
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.begin() -> fr, a[i]);
}
for (int i = 0; i < n; i++) {
finalHeight[i] = a[i];
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
160 ms |
188328 KB |
Output is correct |
2 |
Correct |
155 ms |
188376 KB |
Output is correct |
3 |
Correct |
157 ms |
188464 KB |
Output is correct |
4 |
Correct |
180 ms |
188484 KB |
Output is correct |
5 |
Correct |
178 ms |
188544 KB |
Output is correct |
6 |
Correct |
176 ms |
188560 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
156 ms |
188560 KB |
Output is correct |
2 |
Correct |
1742 ms |
250104 KB |
Output is correct |
3 |
Incorrect |
1078 ms |
250104 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
171 ms |
250104 KB |
Output is correct |
2 |
Correct |
167 ms |
250104 KB |
Output is correct |
3 |
Correct |
172 ms |
250104 KB |
Output is correct |
4 |
Correct |
198 ms |
250104 KB |
Output is correct |
5 |
Correct |
217 ms |
250104 KB |
Output is correct |
6 |
Correct |
203 ms |
250104 KB |
Output is correct |
7 |
Correct |
162 ms |
250104 KB |
Output is correct |
8 |
Correct |
1611 ms |
250412 KB |
Output is correct |
9 |
Incorrect |
953 ms |
250412 KB |
Output isn't correct |
10 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
156 ms |
250412 KB |
Output is correct |
2 |
Correct |
172 ms |
250412 KB |
Output is correct |
3 |
Correct |
162 ms |
250412 KB |
Output is correct |
4 |
Correct |
226 ms |
250412 KB |
Output is correct |
5 |
Correct |
174 ms |
250412 KB |
Output is correct |
6 |
Correct |
180 ms |
250412 KB |
Output is correct |
7 |
Correct |
173 ms |
250412 KB |
Output is correct |
8 |
Correct |
1775 ms |
250412 KB |
Output is correct |
9 |
Incorrect |
999 ms |
250412 KB |
Output isn't correct |
10 |
Halted |
0 ms |
0 KB |
- |