Submission #1261571

#	Time	Username	Problem	Language	Result	Execution time	Memory
1261571		avighna	장애물 (IOI25_obstacles)	C++20	0 / 100	53 ms	6468 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) {
  // int val = psum[d];
  // if (s != 0) {
  //   val -= psum[s - 1];
  // }
  // return val == d - s + 1;
  return true;
}

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