#include "obstacles.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> v, v1;
int n;
void initialize(vector<int> T, vector<int> H)
{
n = T.size();
for (int i = 0; i < H.size(); i++)
{
if (T[0] <= H[i]) v.push_back(i);
}
for (int i = 0; i < H.size(); i++)
{
if (T[n - 1] <= H[i]) v1.push_back(i);
}
return;
}
bool can_reach(int L, int R, int S, int D)
{
if (n == 1)
{
auto it = lower_bound(v.begin(), v.end(), min(S, D));
if (it != v.end() && *it < max(S, D))
{
return false;
}
return true;
}
else
{
auto it = lower_bound(v1.begin(), v1.end(), min(S, D));
if (it != v1.end() && *it < max(S, D))
{
return false;
}
return true;
}
}
| # | 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... |