제출 #1160809

#제출 시각아이디문제언어결과실행 시간메모리
1160809JahonaliX벽 (IOI14_wall)C++17
61 / 100
3092 ms15944 KiB
#pragma GCC optimize("Ofast,O3,unroll-loops")
#pragma GCC target("avx,avx2")

#include <bits/stdc++.h>

using namespace std;

void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]) {
    int a[n] = {0};
    for (int i = 0; i < k; ++i) {
        if (op[i] == 1) for (int j = left[i]; j <= right[i]; ++j) a[j] = max(a[j], height[i]);
        else for (int j = left[i]; j <= right[i]; ++j) a[j] = min(a[j], height[i]);
    }
    for (int i = 0; i < n; ++i) finalHeight[i] = a[i];
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...