# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1255265 | tatais | Obstacles for a Llama (IOI25_obstacles) | C++20 | 0 ms | 0 KiB |
#include "obstacles.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> Sifilis;
void initialize(std::vector<int> T, std::vector<int> H) {
Sifilis.resize(H.size()+1,0);
for(int i=1;i<Sifilis.size();++i){
Silifis[i]+=Sifilis[i-1]+(H[i-1]>=T[T.size()-1]);
}
return;
}
bool can_reach(int L, int R, int S, int D) {
return (Sifilis[S]==Sifilis[D]);//gracias papa dio por este momento
}