제출 #1299249

#제출 시각아이디문제언어결과실행 시간메모리
1299249lizi14장애물 (IOI25_obstacles)C++20
0 / 100
2094 ms5920 KiB
#include "obstacles.h" #include <bits/stdc++.h> using namespace std; const int N=2e5+5; int x[N]; long long n; void initialize(vector<int> T, vector<int> H) { n=H.size(); int j=0; for(int j=0; j<H.size(); j++){ if(T[0]<=H[j]){ x[j]=-1; //k.push_back(j); } else{ x[j]=1; } //cout<<x[j]<<" "; //x[j]=a; //j++; } return; } bool can_reach(int L, int R, int S, int D) { //L--,R--,S--,D--; if(S>D)swap(S,D); for(int i=S; i<D; i++){ if(x[i]==-1){ return 0; } } 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...