Submission #1302594

#TimeUsernameProblemLanguageResultExecution timeMemory
1302594lunarecho장애물 (IOI25_obstacles)C++20
10 / 100
147 ms17640 KiB
#include "obstacles.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> t, h;
set<int> s;
void initialize(std::vector<int> T, std::vector<int> H) {
  t = T;
  h = H;
  for(int i=0;i<h.size();++i) {
    if(t[0] <= h[i]) {
      s.insert(i);
    }
  }
  return;
}

bool can_reach(int L, int R, int S, int D) {
  if(S > D) {
    swap(S, D);
  }
  auto it = s.lower_bound(S);
  if(it != s.end() && *it <= D) {
    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...