Submission #1298517

#TimeUsernameProblemLanguageResultExecution timeMemory
1298517vache_kocharyanObstacles for a Llama (IOI25_obstacles)C++20
0 / 100
48 ms5176 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) {
	n = T.size();
	m = H.size();
	T.resize(n);
	H.resize(m);
	for (int i = 0; i < n; i++)::T[i] = T[i];
	for (int i = 0; i < m; i++)::H[i] = H[i];
}

bool can_reach(int L, int R, int S, int D) {
	if (n == 1)
	{
		for (int i = S; i <= D; i++)
		{
			if (!is_free(0, i))
			{
				return false;
			}
		}
		return true;
	}
	else
	{
		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...