Submission #1204982

#TimeUsernameProblemLanguageResultExecution timeMemory
1204982avighnaHack (APIO25_hack)C++20
56.60 / 100
129 ms2056 KiB
#include <bits/stdc++.h>

long long collisions(std::vector<long long> x);

int hack() {
  const int N = 1000000000;
  const int B = 7000;
  
  int s = 1, e = N / B;
  while (s < e) {
    int m = (s + e) / 2;
    std::vector<long long> a;
    for (int i = 0; i < B - 1; ++i) {
      a.push_back(i + 1);
    }
    for (int i = s - 1; i < m; ++i) {
      a.push_back(B * (i + 1));
    }
    if (collisions(a)) {
      e = m;
    } else {
      s = m + 1;
    }
  }
  for (int i = std::max(2, B * (s - 1)); i < B * s; ++i) {
    if (collisions({1, i + 1})) {
      return i;
    }
  };
  return N;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...