#include "obstacles.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> t, h, nv;
void initialize(vector<int> _t, vector<int> _h) {
int n = _t.size(), m = _h.size();
t.clear();
h.clear();
for (int i = 0; i < n; i++) t.push_back(_t[i]);
for (int i = 0; i < m; i++) h.push_back(_h[i]);
nv.assign(m, 0);
for (int i = 0; i < m; i++) {
if (t[n - 1] > h[i]) nv[i] = 1;
}
for (int i = 1; i < m; i++) nv[i] += nv[i - 1];
}
bool can_reach(int l, int r, int s, int d) {
int sum = nv[d] - (s == 0 ? 0 : nv[s - 1]);
return (sum == d - s + 1);
}
# | 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... |