답안 #1043325

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1043325 2024-08-04T08:17:56 Z deera 벽 (IOI14_wall) C++14
8 / 100
80 ms 14044 KB
// ioi 2014
// Day 2: Wall
#include <bits/stdc++.h>
#include "wall.h"
using namespace std;

void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
    // subtask 1
    if (n <= 10000 && k <= 5000) {
        for (int i = 0; i < k; i++) {
            if (op[i] == 1) {
                for (int j = left[i]; j <= right[i]; j++)
                    finalHeight[j] = max(finalHeight[j], height[i]);
            } else {
                for (int j = left[i]; j <= right[i]; j++)
                    finalHeight[j] = min(finalHeight[j], height[i]);
            }
        }
        return;
    }
}

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 11 ms 636 KB Output is correct
5 Correct 11 ms 604 KB Output is correct
6 Correct 11 ms 604 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 70 ms 14044 KB Output isn't correct
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 11 ms 632 KB Output is correct
5 Correct 11 ms 604 KB Output is correct
6 Correct 11 ms 632 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Incorrect 67 ms 13884 KB Output isn't correct
9 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 11 ms 604 KB Output is correct
5 Correct 12 ms 640 KB Output is correct
6 Correct 14 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Incorrect 80 ms 13904 KB Output isn't correct
9 Halted 0 ms 0 KB -