#include<bits/stdc++.h>
using namespace std;
vector<int> mp;
void initialize(vector<int> t, vector<int> h) {
mp.resize(h.size()+1, 0);
sort(t.begin(), t.end());
for (int i = 1; i <= h.size(); i++) {
if (h[i-1] >= t.back())
mp[i] = 1;
mp[i] += mp[i-1];
}
}
bool can_reach(int l, int r, int s, int d) {
return !(mp[d+1]-mp[s]);
}
| # | 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... |