#include "obstacles.h" #include <bits/stdc++.h> using namespace std; vector<int>T, H; int n, m; bool is_free(int i, int j) { return T[i] > H[j]; } void initialize(std::vector<int> T, std::vector<int> H) { n = T.size(); m = H.size(); (::T).resize(n); (::H).resize(m); for (int i = 0; i < n; i++)(::T)[i] = T[i]; for (int i = 0; i < m; i++)(::H)[i] = H[i]; } bool can_reach(int L, int R, int S, int D) { assert(n == 1); if (S > D) swap(S, D); if (n == 1) { for (int i = S; i <= D; i++) { if (!is_free(0, i)) { return false; } } return true; } else { return true; } }