Submission #1255994

#TimeUsernameProblemLanguageResultExecution timeMemory
1255994AvianshObstacles for a Llama (IOI25_obstacles)C++20
24 / 100
69 ms7496 KiB
#include "obstacles.h"
#include <bits/stdc++.h>

using namespace std;

vector<int>pref(2e5+5);

void initialize(vector<int> T, vector<int> H) {
    int n = T.size();
    int m = H.size();
    int tmax = T[n-1];
    for(int i = 0;i<m;i++){
        if(tmax>H[i]){
            pref[i]=1;
        }
    }
    for(int i = 1;i<2e5+5;i++){
        pref[i]+=pref[i-1];
    }
    return;
}

bool can_reach(int L, int R, int S, int D) {
    S--;
    int aval = pref[D];
    if(S>=0){
        aval-=pref[S];
    }
    if(aval==D-S){
        return 1;
    }
    return 0;
}
#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...