| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1236325 | tamzid | Hack (APIO25_hack) | C++20 | 0 ms | 320 KiB |
#include "hack.h"
#include <bits/stdc++.h>
using ll = long long;
int hack(){
// std::vector<long long> x = {3333,2565454,21223,898997,9999,4,8,100,2340040,222,44,2222211};
// long long a = collisions(x);
ll st = 2;
ll en = 1000000 - 1;
while(st < en)
{
ll m = st + (en - st) / 2;
if(collisions({1,m + 1}) == 1)
{
st = m + 1;
}
else
{
en = m - 1;
}
}
return st;
}| # | 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... | ||||
