oj.uz

답안 #223931

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
223931 2020-04-16T21:34:19 Z a_player 벽 (IOI14_wall) C++14
0 / 100
 3000 ms 18552 KB 
#include <bits/stdc++.h>

using namespace std;
#define fh finalHeight

const int nax=2e6+6;
const int inf=2e9;

int m[nax][2];
void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
    for(int i=0;i<n;i++)m[i][0]=inf,m[i][1]=-inf;
        for(int i=0;i<k;i++){
            if(op[i]==1)
            for(int j=left[i];j<=right[i];j++)m[j][1]=max(m[j][1],height[i]);

            else for(int j=left[i];j<=right[i];j++)m[j][1]=min(m[j][1],height[i]),min(m[j][0],height[i]);
        }
        for(int i=0;i<n;i++)fh[i]=m[i][1];
}

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 6 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Incorrect 24 ms 640 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 167 ms 8184 KB Output is correct
3 Correct 1320 ms 7672 KB Output is correct
4 Execution timed out 3079 ms 18552 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 6 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Incorrect 24 ms 640 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 6 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Incorrect 24 ms 640 KB Output isn't correct
5 Halted 0 ms 0 KB -