| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1264690 | martin_011 | Obstacles for a Llama (IOI25_obstacles) | C++20 | 70 ms | 8264 KiB |
#include "obstacles.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
vll res;
void initialize(std::vector<int> t, std::vector<int> h) {
ll n = t.size();
ll m = h.size();
res.assign(m, 0);
ll g = 0;
for (int i=0; i<m; i++) {
while (i<m && t[0] <= h[i]) i++;
g++;
while (i<m && t[0] > h[i]) {
res[i] = g;
i++;
}
}
return;
}
bool can_reach(int L, int R, int S, int D) {
if (res[S] == res[D]) return true;
else 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... | ||||
