Submission #1296627

#TimeUsernameProblemLanguageResultExecution timeMemory
1296627123123123Obstacles for a Llama (IOI25_obstacles)C++20
24 / 100
84 ms7732 KiB
#include "obstacles.h" #include <bits/stdc++.h> using namespace std; vector <int> ch; void initialize(std::vector<int> T, std::vector<int> H) { int i, N = T.size(), M = H.size(); for(i = 0; i < M; i++) { if(H[i] >= T[N - 1]) ch.push_back(i); } } bool can_reach(int L, int R, int S, int D) { int l, r, ind; l = min(S, D); r = max(S, D); auto it = lower_bound(ch.begin(), ch.end(), l); ind = it - ch.begin(); if(ind == ch.size() || ch[ind] > r) return true; return false; return 0; }
#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...