#include <bits/stdc++.h>
using namespace std;
long long collisions(std::vector<long long> x);
int hack(){
int l = 0, r = 1e6+1;
while(r-l>1){
int mid = (l+r)/2;
vector<long long> g(mid);
for (int i = 0; i<mid; i++) g[i] = i+1;
long long res = collisions(g);
if (res==0) l = mid;
else r = mid;
}
return l;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |