| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1207081 | alterio | Hack (APIO25_hack) | C++20 | 134 ms | 1344 KiB |
#include "hack.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
bool ask(ll x) {
vector<ll> v;
ll k = sqrt(x);
for (ll i = 1; i < k; i++) v.push_back(i);
for (ll i = k; i <= x; i += k) v.push_back(i);
if (v.back() != x) v.push_back(x);
return collisions(v) > 0;
}
int hack() {
ll l = 1, r = 1e9 + 1;
while (l + 1 < r) {
ll mid = (l + r) / 2;
if (ask(mid)) r = mid;
else l = mid;
}
return r - 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... | ||||
