제출 #1261562

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1261562		avighna	Obstacles for a Llama (IOI25_obstacles)	C++20	10 / 100	69 ms	9032 KiB

obstacles

#include "obstacles.h"

std::vector<int> h, t;
std::vector<int> psum;
int m;

bool b(int i, int j) {
  return t[i] > h[j];
}

void initialize(std::vector<int> T, std::vector<int> H) {
  h = H, t = T;
  m = h.size();
  psum.resize(m);
  psum[0] = b(0, 0);
  for (int j = 1; j < m; ++j) {
    psum[j] = psum[j - 1] + b(0, j);
  }
}

bool can_reach(int l, int r, int s, int d) {
  // s d should be a subrange of l r
  // l s d r
  if (l > s or d > r) {
    return false;
  }
  int val = psum[d];
  if (s != 0) {
    val -= psum[s - 1];
  }
  return val == d - s + 1;
}

• Subtask 0: 0 / 0
• Subtask 1: 10 / 10
• Subtask 2: 0 / 14
• Subtask 3: 0 / 13
• Subtask 4: 0 / 21
• Subtask 5: 0 / 25
• Subtask 6: 0 / 17