제출 #1252519

#제출 시각아이디문제언어결과실행 시간메모리
1252519NekoRolly장애물 (IOI25_obstacles)C++20
24 / 100
109 ms7872 KiB
#include "obstacles.h" #include<bits/stdc++.h> using namespace std; int n,m; vector<int> vpos; void initialize(vector<int> T,vector<int> H){ n = T.size(), m = H.size(); for (int i=0; i<m; i++) if (T[n-1] <= H[i]) vpos.push_back(i); return; } bool can_reach(int L, int R, int S, int D) { if (S > D) swap(S, D); auto it = lower_bound(vpos.begin(), vpos.end(), S); return it == vpos.end() || *it > 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...