oj.uz

답안 #164153

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
164153 2019-11-17T18:31:25 Z kostia244 벽 (IOI14_wall) C++17
8 / 100
 3000 ms 18288 KB 
#include "wall.h"

void buildWall(int n, int k, int op[], int l[], int r[], int h[], int fh[]){
//	if(n <= 5000) {}
	for(int i = 0; i < k; i++) {
		if(op[i]==1) {
			for(int p = l[i]; p <= r[i]; p++)
				if(fh[p]<h[i]) fh[p] = h[i];
		} else {
			for(int p = l[i]; p <= r[i]; p++)
				if(fh[p]>h[i]) fh[p] = h[i];
		}
	}
	return;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 4 ms 504 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 19 ms 632 KB Output is correct
5 Correct 18 ms 632 KB Output is correct
6 Correct 18 ms 504 KB Output is correct

Subtask #2
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 164 ms 13944 KB Output is correct
3 Correct 1206 ms 7492 KB Output is correct
4 Execution timed out 3040 ms 18168 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 4 ms 380 KB Output is correct
3 Correct 0 ms 376 KB Output is correct
4 Correct 19 ms 504 KB Output is correct
5 Correct 18 ms 504 KB Output is correct
6 Correct 19 ms 584 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 179 ms 14072 KB Output is correct
9 Correct 1231 ms 7544 KB Output is correct
10 Execution timed out 3027 ms 18224 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #4
0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 4 ms 532 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 19 ms 508 KB Output is correct
5 Correct 19 ms 632 KB Output is correct
6 Correct 18 ms 504 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 165 ms 14040 KB Output is correct
9 Correct 1265 ms 7556 KB Output is correct
10 Execution timed out 3021 ms 18288 KB Time limit exceeded
11 Halted 0 ms 0 KB -