#include <bits/stdc++.h>
using namespace std;
int N, Q;
void buildWall(int n, int q, int t[], int l[], int r[], int x[], int O[])
{
N = n;
Q = q;
for(int i = 0; i < N; i++) O[i] = 0;
for(int i = 0; i < Q; i++)
{
if(t[i] == 1) for(int j = l[i]; j <= r[i]; j++) O[j] = max(x[i], O[j]);
if(t[i] == 2) for(int j = l[i]; j <= r[i]; j++) O[j] = min(x[i], O[j]);
}
return;
}
# | 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... |