| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1367657 | denkenneinausfahrt | Hack (APIO25_hack) | C++20 | 104 ms | 1300 KiB |
#include "hack.h"
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int hack() {
int l = 2, r = 1e9;
while (l < r) {
int mid = (l + r + 1) / 2;
// cerr << mid << ' ';
int sq = sqrt(r - l + 1);
vector<ll> v;
for (int i = 1;i <= sq;i++) v.push_back(i);
for (int j = l + sq - 1;j <= mid;j += sq) v.push_back(j);
if (v.empty() || v.back() != mid) v.push_back(mid);
if (collisions(v)) r = mid - 1;
else l = mid;
}
return l;
}| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
