Submission #1313156

#TimeUsernameProblemLanguageResultExecution timeMemory
1313156DedibeatObstacles for a Llama (IOI25_obstacles)C++20
24 / 100
67 ms7344 KiB
#include "obstacles.h" #include <bits/stdc++.h> using namespace std; vector<int> comp; int n, m; void initialize(std::vector<int> T, std::vector<int> H) { n = T.size(); m = H.size(); comp.assign(m, 0); int id = 1; for(int i = 0; i < m; i++) { if(T.back() > H[i]) { comp[i] = id; } else id++; //cout << comp[i] << " "; } //cout << endl; } bool can_reach(int L, int R, int S, int D) { return comp[S] == comp[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...