Submission #1301325

#	Time	Username	Problem	Language	Result	Execution time	Memory
1301325		tamir1	Obstacles for a Llama (IOI25_obstacles)	C++20	0 / 100	69 ms	8368 KiB

obstacles

#include "obstacles.h"
#include <bits/stdc++.h>
using namespace std;


vector<int> nxt;
vector<int> obs;

void initialize(std::vector<int> T, std::vector<int> H) {
  int M = H.size();
  int N = T.size();
  nxt.assign(M, 0);
  obs.assign(M, 0);
  for(int i = 0; i < M; i++) {
    obs[i] = (T[0] >= H[i] ? 1 : 0);
    // cout << H[i] << " ";
  }
//   cout << "\n";
//   cout << T[0] << "s\n";
  int last = 0;
  for(int i = M - 1; i >= 0; i--) {
    if(obs[i]) last = 0;
    else last = max(last, i);
    nxt[i] = last;
  }
  for(int i = 0; i < M; i++) cout << obs[i] << " ";
  cout << "\n";
  for(int i = 0; i < M; i++) cout << nxt[i] << " ";
  cout << "\n";
  return;
}

bool can_reach(int L, int R, int S, int D) {
  if(S > D) swap(S, D);
  return nxt[S] >= D;
}

• 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