#include <bits/stdc++.h>
#include "obstacles.h"
using namespace std;
vector<int> locked;
void initialize(vector<int> T, vector<int> H) {
for (int i = 0; i < H.size(); i++)
if (T.back() <= H[i])
locked.push_back(i);
}
bool can_reach(int L, int R, int S, int D) {
auto nxt1 = upper_bound(locked.begin(), locked.end(), S);
auto nxt2 = upper_bound(locked.begin(), locked.end(), D);
return nxt1 == nxt2;
}
# | 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... |