# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|
260667 | | A02 | 벽 (IOI14_wall) | C++14 | | 3081 ms | 18296 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>
#include <vector>
#include <algorithm>
#include <utility>
#include <set>
using namespace std;
void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
for (int i = 0; i < n; i++){
finalHeight[i] = 0;
}
for (int i = 0; i < k; i++){
for (int x = left[i]; x <= right[i]; x++){
if (op[i] == 1){
finalHeight[x] = max(finalHeight[x], height[i]);
} else {
finalHeight[x] = min(finalHeight[x], height[i]);
}
}
}
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... |