| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1347565 | ElayV13 | 벽 (IOI14_wall) | C++20 | 3096 ms | 8508 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++)
{
for(int j=left[i];j<=right[i];j++)
{
if(op[i]==1) finalHeight[j]=max(finalHeight[j],height[i]);
if(op[i]==2) finalHeight[j]=min(finalHeight[j],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... | ||||
