Submission #1256259

#TimeUsernameProblemLanguageResultExecution timeMemory
1256259bynixObstacles for a Llama (IOI25_obstacles)C++20
24 / 100
68 ms7496 KiB
#include "obstacles.h"
#include "bits/stdc++.h"
using namespace std;

vector<int> id;

void initialize(vector<int> T, vector<int> H) {
  int N = T.size(), M = H.size();
  id.resize(M, 0);

  int c = 1;
  if (M == 1) return;
  for (int i = 1; i < M; i++){
    if ((T[N-1] > H[i]) == (T[N-1] > H[i-1])) id[i] = id[i-1];
    else id[i] = c, c++;
  }
}

bool can_reach(int L, int R, int S, int D) {
  return id[S] == id[D];
}
#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...