| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 585534 | SeDunion | 벽 (IOI14_wall) | C++17 | 3088 ms | 11224 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<iostream>
using namespace std;
const int N = 2e6 + 123;
int n;
int a[N];
void buildWall(int n_, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
n = n_;
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];
}
}
| # | 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... | ||||
