# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1246157 | KALARRY | Hack (APIO25_hack) | C++20 | 0 ms | 0 KiB |
//chockolateman
#include<bits/stdc++.h>
#include <vector>
#include "hack.h"
using namespace std;
const int S = 31623;
vector<int> nums;
int query_pair(int x)
{
vector<int> temp;
temp.push_back(1);
temp.push_back(1+x);
return collisions(temp);
}
int query(int l,int r)
{
vector<int> temp;
for(int i = l ; i <= r ; i++)
temp.push_back(nums[i]);
int res = collisions(temp);
return res;
}
int hack(){
if(nums.empty())
{
nums.push_back(0); //make it 1-indexed
for(int i = 1 ; i < S ; i++)
nums.push_back(nums.back() + 1);
for(int i = 1 ; i <= S ; i++)
nums.push_back(nums.back() + S);
}
random_shuffle(nums.begin()+1,nums.end());
int l = 1;
int r = nums.size() - 1;
while(l < r)
{
int mid = (l+r+1)/2;
if(query(1,mid))
r = mid-1;
else
l = mid;
}
r++;
int n;
for(l = r-1 ; l >= 0 ; l--)
if(query_pair(abs(nums[r] - nums[l])))
{
n = abs(nums[r] - nums[l]);
break;
}
vector<int> temp;
for(int x = 1 ; x <= n ; x++)
if(n%x==0)
{
temp.clear();
temp.push_back(1);
temp.push_back(1 + x);
if(query_pair(x))
n = x;
}
return n;
}