제출 #1316382

#제출 시각아이디문제언어결과실행 시간메모리
1316382ezzzay장애물 (IOI25_obstacles)C++20
0 / 100
2096 ms6292 KiB
#include "obstacles.h" #include<bits/stdc++.h> using namespace std; #define ff first #define ss second #define pb push_back vector<int>HH,TT; void initialize(std::vector<int> T, std::vector<int> H) { TT.clear(); HH.clear(); for(auto a:T)TT.pb(a); for(auto b:H)HH.pb(b); } bool can_reach(int L, int R, int S, int D) { if(S>D)swap(S,D); for(int i=S;i<=D;i++){ if(TT[0]<=HH[i])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...