Submission #1296040

#	Time	Username	Problem	Language	Result	Execution time	Memory
1296040		SabaKharebava	Obstacles for a Llama (IOI25_obstacles)	C++20	0 / 100	2096 ms	22972 KiB

obstacles

#include<bits/stdc++.h>

using namespace std;

vector<int> c;

void initialize(vector<int> t, vector<int> h) {
	c.resize(h.size(), -1);
	auto dfs = [&](auto &dfs, int i, int j, int val) -> void {
		if (h[j] >= t[i] || i < 0 || i >= t.size() || j >= h.size()) {
			return;
		}
		if (i == 0)
			c[j] = val;
		dfs(dfs, i+1, j, val);
		dfs(dfs, i, j+1, val);

		if (i == 2 && j-1 >= 0 && h[j-1] >= t[i-1] && h[j-2] < t[0] && c[j] == -1) {
			int ind = j;
			while (ind >= 0 && h[ind] < t[0]) {
				c[ind] = val;
				ind--;
			}
			if (j+1 < h.size() && h[j+1] < t[0])
				dfs(dfs, 0, j+1, val);
		}
	};

	for (int i = 0; i < h.size(); i++)
		if (c[i] == -1 && h[i] < t[0])
			dfs(dfs, 0, i, i);
}

bool can_reach(int ll, int r, int s, int d) {
	if (d < s)
		swap(d, s);
	return (c[d] == s);
}

• 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