Submission #1299271

#TimeUsernameProblemLanguageResultExecution timeMemory
1299271alexrana2626Obstacles for a Llama (IOI25_obstacles)C++20
10 / 100
84 ms7736 KiB
#include "obstacles.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> v;

void initialize(vector<int> T, vector<int> H) 
{
	v.clear();
    for (int i = 0; i < H.size(); i++)
    {
    	if (T[0] <= H[i]) v.push_back(i);
	}
	return;
}

bool can_reach(int L, int R, int S, int D) 
{
	auto it = lower_bound(v.begin(), v.end(), min(S, D));
	if (it != v.end() && *it < max(S, D))
	{
		return false;
	}
	return true;
}
#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...