# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1006275 |
2024-06-23T16:00:58 Z |
jer033 |
Wall (IOI14_wall) |
C++17 |
|
3000 ms |
8532 KB |
#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[])
{
for (int i=0; i<n; i++)
finalHeight[i] = height[i];
for (int oper = 0; oper<k; oper++)
{
int typ = op[oper];
int l = left[oper];
int r = right[oper];
int h = height[oper];
for (int i=l; i<=r; i++)
{
if (typ==1)
finalHeight[i] = max(finalHeight[i], h);
else
finalHeight[i] = min(finalHeight[i], h);
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
344 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Incorrect |
10 ms |
560 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
77 ms |
8416 KB |
Output is correct |
3 |
Correct |
674 ms |
3664 KB |
Output is correct |
4 |
Execution timed out |
3072 ms |
8532 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 |
Incorrect |
10 ms |
548 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Incorrect |
11 ms |
544 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |