# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
989948 |
2024-05-29T07:15:17 Z |
stdfloat |
Wall (IOI14_wall) |
C++17 |
|
3000 ms |
18004 KB |
#include <bits/stdc++.h>
#include "wall.h"
using namespace std;
void buildWall(int n, int k, int op[], int l[], int r[], int h[], int fh[]) {
for (int i = 0; i < k; i++) {
for (int j = l[i]; j <= r[i]; j++) {
if (op[i] == 1) fh[j] = max(fh[j], h[i]);
else fh[j] = min(fh[j], h[i]);
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
344 KB |
Output is correct |
4 |
Correct |
13 ms |
604 KB |
Output is correct |
5 |
Correct |
14 ms |
640 KB |
Output is correct |
6 |
Correct |
14 ms |
604 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
75 ms |
8016 KB |
Output is correct |
3 |
Correct |
980 ms |
3668 KB |
Output is correct |
4 |
Execution timed out |
3009 ms |
8528 KB |
Time limit exceeded |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
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 |
13 ms |
544 KB |
Output is correct |
5 |
Correct |
14 ms |
652 KB |
Output is correct |
6 |
Correct |
14 ms |
632 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
78 ms |
13904 KB |
Output is correct |
9 |
Correct |
944 ms |
7508 KB |
Output is correct |
10 |
Execution timed out |
3030 ms |
18000 KB |
Time limit exceeded |
11 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
344 KB |
Output is correct |
4 |
Correct |
13 ms |
552 KB |
Output is correct |
5 |
Correct |
14 ms |
688 KB |
Output is correct |
6 |
Correct |
14 ms |
600 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
78 ms |
14016 KB |
Output is correct |
9 |
Correct |
974 ms |
7508 KB |
Output is correct |
10 |
Execution timed out |
3065 ms |
18004 KB |
Time limit exceeded |
11 |
Halted |
0 ms |
0 KB |
- |