제출 #520717

#제출 시각아이디문제언어결과실행 시간메모리
520717peti1234벽 (IOI14_wall)C++17
8 / 100
3058 ms18076 KiB
#include <bits/stdc++.h>
#include "wall.h"
using namespace std;

void buildWall(int n, int k, int op[], int bal[], int jobb[], int ert[], int valasz[]) {
    // 1
    for (int i=0; i<k; i++) {
        for (int j=bal[i]; j<=jobb[i]; j++) {
            if (op[i]==1) valasz[j]=max(valasz[j], ert[i]);
            if (op[i]==2) valasz[j]=min(valasz[j], ert[i]);
        }
    }
    return;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...