Submission #1256265

#TimeUsernameProblemLanguageResultExecution timeMemory
1256265nibertObstacles for a Llama (IOI25_obstacles)C++20
0 / 100
2093 ms5704 KiB
#include <bits/stdc++.h>
using namespace std;

static vector<int> H;
static int T0;

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

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, blocked
    }
    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...