# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1213953 | fskarica | Hack (APIO25_hack) | C++20 | 0 ms | 0 KiB |
#include "hack.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define pii pair<int, int>
int n = 1000000;
int bs(int col) {
int lo = 1;
int hi = n + 10;
while (lo < hi) {
int mid = (lo + hi) / 2;
int cnt = 0;
for (int i = 0; i < mid; i++) {
int x = n / mid;
if (i < n % mid) x++;
cnt += x * (x - 1) / 2;
}
if (cnt < col) lo = mid + 1;
else hi = mid
}
return lo;
}
int hack() {
vector <ll> v;
for (int i = 0; i < n; i++) v.push_back(i);
int x = collisions(v);
return bs(x);
}