| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|
| 112663 | | socho | 벽 (IOI14_wall) | C++14 | | 3099 ms | 16248 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 <bits/stdc++.h>
using namespace std;
#include "wall.h"
void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
int fin[n];
memset(fin, 0, sizeof fin);
for (int i=0; i<k; i++) {
if (op[i] == 1) {
// adding
for (int j=left[i]; j<=right[i]; j++) {
fin[j] = max(height[i], fin[j]);
}
}
else {
// removing
for (int j=left[i]; j<=right[i]; j++) {
fin[j] = min(height[i], fin[j]);
}
}
}
for (int i=0; i<n; i++) {
finalHeight[i] = fin[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... |