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