| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1362995 | nicolo_010 | Wall (IOI14_wall) | C++20 | 3096 ms | 8540 KiB |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#include "wall.h"
void buildWall(int n, int k, int op[], int left[], int right[], int height[], int f[]){
for (int i=0; i<n; i++) {
f[i] = 0;
}
for (int i=0; i<k; i++) {
int t = op[i];
for (int j=left[i]; j<=right[i]; j++) {
if (t==1) {
f[j] = max(f[j], height[i]);
}
else {
f[j] = min(f[j], height[i]);
}
}
}
return;
}
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
