제출 #1258323

#제출 시각아이디문제언어결과실행 시간메모리
1258323medmdg장애물 (IOI25_obstacles)C++20
24 / 100
69 ms7496 KiB
#include "obstacles.h"
#include<bits/stdc++.h>
using namespace std;
vector<int> c;
void initialize(vector<int> T, vector<int> H) {
  c.clear();
  c.resize(H.size());
  for(int i=0;i<H.size();i++){
    if(H[i]>=T.back())c[i]=1;
  }
  for(int i=1;i<H.size();i++)c[i]+=c[i-1];
}

bool can_reach(int L, int R, int S, int D) {
  return c[D]==c[S];
}
#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...