| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1354630 | cpismayilmmdv985 | 벽 (IOI14_wall) | C++20 | 3094 ms | 8572 KiB |
#include "wall.h"
#include "bits/stdc++.h"
using namespace std;
void buildWall(int N, int K, int op[], int left[], int right[], int height[], int finalHeight[]){
for (int i = 0; i < K; i++) {
int L = left[i], R = right[i], H = height[i];
if (op[i] == 1) {
// adding
for (int j = L; j <= R; j++) finalHeight[j] = max(finalHeight[j], H);
} else {
// remoing
for (int j = L; j <= R; j++) finalHeight[j] = min(finalHeight[j], H);
}
}
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... | ||||
