# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1016609 |
2024-07-08T09:05:59 Z |
bozho |
Wall (IOI14_wall) |
C++14 |
|
67 ms |
16448 KB |
#include<wall.h>
#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
void buildWall(int n, int k, int op[], int l[], int r[], int h[], int fh[])
{
for(int i=0;i<n;i++)
fh[i]=0;
for(int i=0;i<k;i++)
{
for(int j=l[i];j<=r[i];j++)
{
if(op[i]==1)
fh[i]=max(fh[i],h[i]);
else
fh[i]=min(fh[i],h[i]);
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Runtime error |
67 ms |
16448 KB |
Execution killed with signal 11 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |