#include "obstacles.h"
#include <bits/stdc++.h>
using namespace std;
set<int> walls;
void initialize(std::vector<int> T, std::vector<int> H) {
int maxT = 0;
for (int i = 0; i < T.size(); ++i) {
maxT = max(maxT, T[i]);
}
for (int i = 0; i < H.size(); ++i) {
if (H[i] >= maxT) {
walls.insert(i);
}
}
}
bool can_reach(int L, int R, int S, int D) {
return walls.lower_bound(S) == walls.upper_bound(D);
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |