Submission #1256266

#	Time	Username	Problem	Language	Result	Execution time	Memory
1256266		nibert	Obstacles for a Llama (IOI25_obstacles)	C++20	0 / 100	2095 ms	5704 KiB

obstacles

#include <vector>
using namespace std;

static vector<int> H;
static int T0;

void initialize(vector<int> T, vector<int> h) {
    T0 = T[0];     // only one row in subtask 1
    H = h;
}

// Returns true if path between S and D is free of vegetation
bool can_reach(int L, int R, int S, int D) {
    if (S > D) swap(S, D);
    for (int j = S; j <= D; j++) {
        if (!(T0 > H[j])) return false; // vegetation found
    }
    return true;
}

• 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