| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1298515 | vache_kocharyan | Obstacles for a Llama (IOI25_obstacles) | C++20 | 52 ms | 5920 KiB |
#include "obstacles.h"
#include <bits/stdc++.h>
using namespace std;
vector<int>T, H;
int n, m;
bool is_free(int i, int j)
{
return T[i] > H[j];
}
void initialize(std::vector<int> T, std::vector<int> H) {
::T = T;
::H = H;
n = T.size();
m = H.size();
}
bool can_reach(int L, int R, int S, int D) {
if (n == 1)
{
for (int i = S; i <= D; i++)
{
if (!is_free(1, i))
{
return false;
}
}
return true;
}
}
Compilation message (stderr)
| # | 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... | ||||
