Submission #1299266

#TimeUsernameProblemLanguageResultExecution timeMemory
1299266alexrana2626장애물 (IOI25_obstacles)C++20
0 / 100
69 ms6176 KiB
#include "obstacles.h" #include <bits/stdc++.h> using namespace std; vector<int> v; void initialize(vector<int> T, vector<int> H) { for (int i = 0; i < H.size(); i++) { if (T[0] <= H[i]) v.push_back(i); } } bool can_reach(int L, int R, int S, int D) { auto it = lower_bound(v.begin(), v.end(), min(S, D)); if (*it < D && it != v.end()) { return false; } return true; }
#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...