# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
960826 |
2024-04-11T05:43:34 Z |
IUA_Hasin |
Wall (IOI14_wall) |
C++17 |
|
3000 ms |
18088 KB |
#include "wall.h"
#include <bits/stdc++.h>
#define endl "\n"
#define yeap cout<<"YES"<<endl
#define nope cout<<"NO"<<endl
#define ll long long
using namespace std;
void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
for(int i=0; i<k; i++){
ll a = op[i];
ll b = left[i];
ll c = right[i];
ll d = height[i];
if(a==1){
for(int j=b; j<=c; j++){
if(finalHeight[j]<d){
finalHeight[j] = d;
}
}
} else {
for(int j=b; j<=c; j++){
if(finalHeight[j]>d){
finalHeight[j] = d;
}
}
}
}
return;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
2 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
12 ms |
604 KB |
Output is correct |
5 |
Correct |
10 ms |
604 KB |
Output is correct |
6 |
Correct |
9 ms |
604 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
117 ms |
13972 KB |
Output is correct |
3 |
Correct |
849 ms |
6280 KB |
Output is correct |
4 |
Execution timed out |
3036 ms |
18004 KB |
Time limit exceeded |
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 |
Correct |
12 ms |
636 KB |
Output is correct |
5 |
Correct |
10 ms |
604 KB |
Output is correct |
6 |
Correct |
9 ms |
604 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
120 ms |
14064 KB |
Output is correct |
9 |
Correct |
896 ms |
7528 KB |
Output is correct |
10 |
Execution timed out |
3034 ms |
18080 KB |
Time limit exceeded |
11 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 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 |
Correct |
13 ms |
652 KB |
Output is correct |
5 |
Correct |
9 ms |
604 KB |
Output is correct |
6 |
Correct |
9 ms |
604 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
116 ms |
14056 KB |
Output is correct |
9 |
Correct |
842 ms |
7748 KB |
Output is correct |
10 |
Execution timed out |
3038 ms |
18088 KB |
Time limit exceeded |
11 |
Halted |
0 ms |
0 KB |
- |