| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1203521 | Quentolosse | 벽 (IOI14_wall) | C++20 | 3094 ms | 9028 KiB |
#include "wall.h"
#include <bits/stdc++.h>
#define int long long
using namespace std;
void buildWall(signed n, signed k, signed op[], signed left[], signed right[], signed height[], signed finalHeight[]){
vector<int> mur(n, 0);
for (int i = 0; i < k; i++)
{
for (int j = left[i]; j < right[i]+1; j++)
{
if (op[i] == 1) {
mur[j] = max(mur[j], (int)height[i]);
}
else {
mur[j] = min(mur[j], (int)height[i]);
}
}
}
for (int i = 0; i < n; i++)
{
finalHeight[i] = mur[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... | ||||
