제출 #1258320

#제출 시각아이디문제언어결과실행 시간메모리
1258320medmdg장애물 (IOI25_obstacles)C++20
0 / 100
139 ms14408 KiB
#include "obstacles.h" #include<bits/stdc++.h> using namespace std; set<int> cut; void initialize(vector<int> T, vector<int> H) { for(int i=0;i<H.size();i++){ if(H[i]>=T.back())cut.insert(i); } } bool can_reach(int L, int R, int S, int D) { set<int>::iterator t; t=cut.lower_bound(S); if(t==cut.end())return true; return (*t)>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...