# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
291135 |
2020-09-04T18:19:09 Z |
ivan24 |
Wall (IOI14_wall) |
C++14 |
|
3000 ms |
11128 KB |
#include "wall.h"
#include <bits/stdc++.h>
using namespace std;
using ll = int;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef pair<ll,ll> ii;
typedef vector<ii> vii;
typedef vector<vii> vvii;
#define F first
#define S second
const ll INF = 1e9;
void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
for (ll i = 0; k > i; i++){
for (ll j = left[i]; right[i] >= j; j++){
if (op[i] == 1){
finalHeight[j] = max(height[i],finalHeight[j]);
}else{
finalHeight[j] = min(height[i],finalHeight[j]);
}
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
256 KB |
Output is correct |
2 |
Correct |
2 ms |
384 KB |
Output is correct |
3 |
Correct |
2 ms |
384 KB |
Output is correct |
4 |
Correct |
22 ms |
640 KB |
Output is correct |
5 |
Correct |
25 ms |
632 KB |
Output is correct |
6 |
Correct |
22 ms |
512 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
256 KB |
Output is correct |
2 |
Correct |
169 ms |
8184 KB |
Output is correct |
3 |
Correct |
1544 ms |
5240 KB |
Output is correct |
4 |
Execution timed out |
3043 ms |
11000 KB |
Time limit exceeded |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
256 KB |
Output is correct |
2 |
Correct |
3 ms |
384 KB |
Output is correct |
3 |
Correct |
2 ms |
384 KB |
Output is correct |
4 |
Correct |
23 ms |
512 KB |
Output is correct |
5 |
Correct |
22 ms |
640 KB |
Output is correct |
6 |
Correct |
22 ms |
512 KB |
Output is correct |
7 |
Correct |
0 ms |
256 KB |
Output is correct |
8 |
Correct |
174 ms |
10544 KB |
Output is correct |
9 |
Correct |
1530 ms |
4856 KB |
Output is correct |
10 |
Execution timed out |
3069 ms |
11128 KB |
Time limit exceeded |
11 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
256 KB |
Output is correct |
2 |
Correct |
2 ms |
384 KB |
Output is correct |
3 |
Correct |
2 ms |
384 KB |
Output is correct |
4 |
Correct |
22 ms |
640 KB |
Output is correct |
5 |
Correct |
25 ms |
512 KB |
Output is correct |
6 |
Correct |
22 ms |
512 KB |
Output is correct |
7 |
Correct |
1 ms |
256 KB |
Output is correct |
8 |
Correct |
169 ms |
10512 KB |
Output is correct |
9 |
Correct |
1528 ms |
4988 KB |
Output is correct |
10 |
Execution timed out |
3023 ms |
11000 KB |
Time limit exceeded |
11 |
Halted |
0 ms |
0 KB |
- |