| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1235036 | Hanksburger | Hack (APIO25_hack) | C++20 | 199 ms | 1284 KiB |
#include "hack.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int hack()
{
int l=2, r=1e9;
while (l<r)
{
int mid=(l+r)/2, sq=sqrt(mid-l+1.5);
vector<long long> tmp;
for (int i=1; i<=sq; i++)
tmp.push_back(i);
for (int i=mid+1; i>l; i-=sq)
tmp.push_back(i);
sort(tmp.begin(), tmp.end());
tmp.resize(unique(tmp.begin(), tmp.end())-tmp.begin());
if (collisions(tmp))
r=mid;
else
l=mid+1;
}
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... | ||||
