#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
void buildWall(int n, int k, int op[], int l_[], int r_[], int h_[], int res[]) {
for (int idx = 0; idx<k; ++idx) {
int q = op[idx];
int l = l_[idx], r = r_[idx], h = h_[idx];
for (int i = l; i<=r; ++i) {
if (q == 1 && res[i] < h) {
res[i] = h;
} else if (q == 2 && res[i] > h) {
res[i] = h;
}
}
}
// for (int i = 0; i<n; ++i) {
// cout << res[i] << ' ';
// }
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |