Submission #1365191

#TimeUsernameProblemLanguageResultExecution timeMemory
1365191mannshah1211Obstacles for a Llama (IOI25_obstacles)C++20
24 / 100
56 ms7356 KiB
#include "obstacles.h"
#include <bits/stdc++.h>

using namespace std;

vector<int> pref;

void initialize(vector<int> t, vector<int> h) {
  int n = t.size(), m = h.size();
  pref.resize(m + 1);
  for (int i = 1; i <= m; i++) {
    pref[i] = pref[i - 1] + (h[i - 1] >= t[n - 1]);
  }
}

bool can_reach(int l, int r, int s, int d) {
  if (s > d) {
    swap(s, d);
  }
  return (pref[s] == pref[d + 1]);
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...