| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1353504 | isct | Hack (APIO25_hack) | C++20 | 3 ms | 1976 KiB |
#include "hack.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
int hack()
{
vector<long long> q = {1};
for (int i = 3; i <= 1e5 + 1; i++)
{
q.push_back(i);
}
long long l = 1;
long long r = q.size();
int ans;
while (l < r)
{
long long mid = (l + r) / 2;
vector<long long> query = vector(q.begin(), q.begin() + mid);
long long response = collisions(query);
if (response >= 1)
{
r = mid;
ans = mid;
}
else
l = mid + 1;
}
return q[ans] - q[ans - 1];
}| # | 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... | ||||
