# |
제출 시각 |
아이디 |
문제 |
언어 |
결과 |
실행 시간 |
메모리 |
934463 |
2024-02-27T10:56:05 Z |
zhasyn |
벽 (IOI14_wall) |
C++14 |
|
3000 ms |
18224 KB |
#include <bits/stdc++.h>
#include <wall.h>
using namespace std;
void buildWall(int n, int k, int op[], int left[], int right[],
int h[], int ans[]){
for(int i = 0; i < n; i++){
ans[i] = 0;
}
for(int i = 0; i < k; i++){
for(int j = left[i]; j <= right[i]; j++){
if(op[i] == 1) ans[j] = max(h[i], ans[j]);
else ans[j] = min(ans[j], h[i]);
}
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
2 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
448 KB |
Output is correct |
4 |
Correct |
15 ms |
636 KB |
Output is correct |
5 |
Correct |
15 ms |
604 KB |
Output is correct |
6 |
Correct |
16 ms |
636 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
112 ms |
14208 KB |
Output is correct |
3 |
Correct |
1075 ms |
6276 KB |
Output is correct |
4 |
Execution timed out |
3047 ms |
18004 KB |
Time limit exceeded |
5 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
2 ms |
344 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
16 ms |
604 KB |
Output is correct |
5 |
Correct |
18 ms |
604 KB |
Output is correct |
6 |
Correct |
16 ms |
604 KB |
Output is correct |
7 |
Correct |
0 ms |
600 KB |
Output is correct |
8 |
Correct |
111 ms |
13908 KB |
Output is correct |
9 |
Correct |
1063 ms |
7524 KB |
Output is correct |
10 |
Execution timed out |
3091 ms |
18224 KB |
Time limit exceeded |
11 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
556 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
16 ms |
604 KB |
Output is correct |
5 |
Correct |
15 ms |
632 KB |
Output is correct |
6 |
Correct |
16 ms |
636 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
111 ms |
13908 KB |
Output is correct |
9 |
Correct |
1065 ms |
7532 KB |
Output is correct |
10 |
Execution timed out |
3005 ms |
18000 KB |
Time limit exceeded |
11 |
Halted |
0 ms |
0 KB |
- |