| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1239834 | lunarecho | Hack (APIO25_hack) | C++20 | 24 ms | 5540 KiB |
#include "hack.h"
#include <bits/stdc++.h>
using namespace std;
bool is(long long m)
{
vector<long long> tester1;
tester1.push_back(1);
for(long long i=(m / 3);i<=m;++i)
{
tester1.push_back(i);
}
return collisions(tester1) > 0;
}
int hack(){
long long l = 1;
long long r = 1000000;
while(l < r)
{
long long m = (l + r) >> 1;
if(is(m))
{
r = m;
}
else
{
l = m + 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... | ||||
