Submission #1286495

#TimeUsernameProblemLanguageResultExecution timeMemory
1286495eri16Obstacles for a Llama (IOI25_obstacles)C++20
10 / 100
66 ms6596 KiB
#include <bits/stdc++.h> using namespace std; int arr1[200005]; void initialize(std::vector<int> T, std::vector<int> H){ if (T.size()==1){ for (int i=0; i<H.size(); i++){ arr1[i]=(T[0]>H[i]) ? 1 : 0; } int k=0; for (int i=0; i<H.size(); i++){ if (arr1[i]==1){arr1[i]=k;} else{ arr1[i]=-1; if (i>0){ if (arr1[i-1]!=-1){ k++; } } } } } } bool can_reach(int L, int R, int S, int D){ return arr1[S]==arr1[D]; }
#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...