Submission #1299232

#TimeUsernameProblemLanguageResultExecution timeMemory
1299232lizi14Obstacles for a Llama (IOI25_obstacles)C++20
0 / 100
51 ms5872 KiB
#include "obstacles.h" #include <bits/stdc++.h> using namespace std; const int N=2e5+5; int x[N]; int n; void initialize(vector<int> T, vector<int> H) { n=H.size(); int j=0; for(auto a:H){ if(T[0]>a){ x[j]=1; } else{ x[j]=0; } //x[j]=a; j++; } return; } bool can_reach(int L, int R, int S, int D) { if(S>D)swap(S,D); int kaa=0; S--; D--; for(int i=S; i<=D; i++){ if(x[i]==0){ continue; } else{ kaa=1; break; } } if(kaa==0)return true; else 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...