# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
223930 |
2020-04-16T21:33:50 Z |
a_player |
Wall (IOI14_wall) |
C++14 |
|
167 ms |
8184 KB |
#include <bits/stdc++.h>
using namespace std;
#define fh finalHeight
const int nax=2e6+6;
const int inf=2e9;
int m[nax][2];
void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
for(int i=0;i<n;i++)m[i][0]=inf,m[i][1]=-inf;
for(int i=0;i<k;i++){
if(op[i]==1)
for(int j=left[i];j<=right[i];j++)m[j][1]=max(m[j][1],height[i]);
else for(int j=left[i];j<=right[i];j++)m[j][1]=min(m[j][1],height[j]),min(m[j][0],height[i]);
}
for(int i=0;i<n;i++)fh[i]=m[i][1];
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
256 KB |
Output is correct |
2 |
Incorrect |
7 ms |
512 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Incorrect |
167 ms |
8184 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Incorrect |
7 ms |
384 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
256 KB |
Output is correct |
2 |
Incorrect |
6 ms |
384 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |