| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1301327 | tamir1 | Obstacles for a Llama (IOI25_obstacles) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#include "obstacles.h"
using namespace std;
static int N, M;
static vector<int> Tval, Hval;
static vector<int> c;
static vector<int> b;
void initialize(vector<int> T, vector<int> H) {
Tval = T;
Hval = H;
N = Tval.size();
M = Hval.size();
for(int i=1; i<M; i++) {
b[i]=-1;
}
int d = Tval[0];
for(int i=0; i<M; i++) {
if(d>=Hval[i]) {
c[i]=1;
}
else {
c[i]=0;
}
}
int last = M-1;
for(i=M-1; i>=0; i--){
if(c[i]==0) {
b[i]=last-1;
}
else {
last=i;
}
}
}
bool can_reach(int L, int R, int S, int D) {
return b[min(S,D)] >= max(D,S);
}
