Submission #1293170

#TimeUsernameProblemLanguageResultExecution timeMemory
1293170aren_danceObstacles for a Llama (IOI25_obstacles)C++20
0 / 100
48 ms5952 KiB
#include <bits/stdc++.h>
using namespace std;
const int N=3e5+1;
int nxt[N];
void initialize(std::vector<int> t, std::vector<int> h){
    int m=h.size();
    for(int i=0;i<m;++i){
        nxt[i]=m+1;
    }
    for(int i=0;i<m;--i){
        if(t[0]>=h[i]){
            if(i!=0){
                nxt[i]=min(i,nxt[i-1]);
            }
            else{
                nxt[i]=i;
            }
        }
    }
}
bool can_reach(int l, int r, int s, int d){
    if(nxt[d]<=s){
        return 1;
    }
    return 0;
}
/*int main()
{
    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...