# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1238950 | noop | Hack (APIO25_hack) | C++20 | 0 ms | 0 KiB |
#include "hack.h"
#include <bits/stdc++.h>
using namespace std;
bool query (int l, int r){
int gap=sqrt(r-l+1);
vector<int> v;
for (int i=l; i<=l+gap; ++i)
v.push_back(i);
for (int i=r; i>l; i-=gap)
v.push_back(i);
return collisions(v);
}
int hack(){
int l=1,r=1000000;
while (l<r){
int mid=l+r>>1;
if (query(mid,r))
r=mid;
else
l=mid+1;
}
return l;
}