Submission #1314373

#	Time	Username	Problem	Language	Result	Execution time	Memory
1314373		Cyanberry	Obstacles for a Llama (IOI25_obstacles)	C++20	0 / 100	53 ms	5092 KiB

obstacles

#include "obstacles.h"
#include <bits/stdc++.h>
using namespace std;

set<int> walls;
void initialize(std::vector<int> T, std::vector<int> H) {
	int maxT = 0;
	for (int i = 0; i < T.size(); ++i) {
		maxT = max(maxT, T[i]);
	}
	for (int i = 0; i < H.size(); ++i) {
		if (H[i] > maxT) {
			walls.insert(i);
		}
	}
}

bool can_reach(int L, int R, int S, int D) {
	return walls.lower_bound(S) == walls.upper_bound(D);
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 10
• Subtask 2: 0 / 14
• Subtask 3: 0 / 13
• Subtask 4: 0 / 21
• Subtask 5: 0 / 25
• Subtask 6: 0 / 17