Submission #1296600

#TimeUsernameProblemLanguageResultExecution timeMemory
1296600gaboObstacles for a Llama (IOI25_obstacles)C++20
10 / 100
65 ms8124 KiB
#include "obstacles.h"
#include <bits/stdc++.h>
using namespace std;

int N, M;
vector<int> T_gl, H_gl;
vector<int> bad_pref;
void initialize(std::vector<int> T, std::vector<int> H) {
    T_gl = T;
    H_gl = H;
    N = (int)T.size();
    M = (int)H.size();

    if (N == 1) {
        bad_pref.assign(M + 1, 0);
        int t0 = T_gl[0];
        for (int j = 0; j < M; ++j) {
            int bad = (t0 <= H_gl[j]) ? 1 : 0; 
            bad_pref[j + 1] = bad_pref[j] + bad;
        }
    }
}

bool can_reach(int L, int R, int S, int D) {
    if (N == 1) {
        int l = min(S, D);
        int r = max(S, D);

        int blocked = bad_pref[r + 1] - bad_pref[l];
        return (blocked == 0);
    }
    return false;
}
#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...