Submission #1297164

#TimeUsernameProblemLanguageResultExecution timeMemory
1297164gaboObstacles for a Llama (IOI25_obstacles)C++20
24 / 100
87 ms7800 KiB
#include "obstacles.h"
#include <bits/stdc++.h>
using namespace std;

static vector<int> v;

void initialize(vector<int> t, vector<int> h)
{
    v.clear();
    int n = t.size(), m = h.size();
    int x = t[n-1];
    for(int i=0;i<m;i++)
        if(h[i] >= x)
            v.push_back(i);
}

bool can_reach(int L, int R, int S, int D)
{
    int a = min(S,D), b = max(S,D);
    auto it = lower_bound(v.begin(), v.end(), a);
    return (it == v.end() || *it > b);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...