제출 #1296596

#제출 시각아이디문제언어결과실행 시간메모리
1296596gabo장애물 (IOI25_obstacles)C++20
0 / 100
2093 ms5920 KiB
#include "obstacles.h"
#include <bits/stdc++.h>
using namespace std;

int N,M;
vector<int> T_gl, H_gl;

void initialize(std::vector<int> T, std::vector<int> H) {
  T_gl = T;
  H_gl = H;
  N = (int)T.size();
  M = (int)H.size();
}

bool can_reach(int L, int R, int S, int D) {
  if (N != 1) return false;
  if (S < 0 || D < 0 || S >= M || D >= M) return false;
  int h = T_gl[0];
  int l = min(S, D);
  int r = max(S, D);
  for (int i = l; i <= r; i++) {
    if (h <= H_gl[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...