| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1367506 | waygonz | Hack (APIO25_hack) | C++20 | 47 ms | 3268 KiB |
#include "hack.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int hack() {
int l = 1, r = (int)1e9;
while (l < r) {
int mid = (l + r) / 2;
int N = mid - l + 1;
int x = sqrt(N);
set<ll> A;
for (int i = 1; i <= x; i++) A.emplace(i);
for (int i = l; i <= mid; i += x) A.emplace(i);
A.emplace(mid);
vector<ll> Q;
for (auto &e : A) Q.emplace_back(e);
if (collisions(Q)) 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... | ||||
