#include <bits/stdc++.h>
#include "obstacles.h"
using namespace std;
#define ll long long
int n,m,cnt[200005];
void initialize(vector<int> t,vector<int> h){
n=t.size();
m=h.size();
for(int i=0;i<m;i++){
if(t[0]>h[i]){
if(i==0){
cnt[i]=0;
}
cnt[i]=cnt[i-1];
}
else{
if(i==0){
cnt[i]=1;
}
cnt[i]=cnt[i-1]+1;
}
}
}
bool can_reach(int l,int r,int s,int d){
if(cnt[s]==cnt[d]){
return true;
}
return false;
}
# | 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... |