| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1238953 | noop | Hack (APIO25_hack) | C++20 | 9 ms | 1208 KiB |
#include "hack.h"
#include <bits/stdc++.h>
using namespace std;
bool query (int l, int r){
int gap=sqrt(r-l+1);
vector<long long> v;
for (int i=1; i<=gap; ++i)
v.push_back(i);
for (int i=r; i>l+gap; i-=gap)
v.push_back(i);
return collisions(v);
}
int hack(){
int l=1,r=1000000000;
while (l<r){
int mid=l+r>>1;
if (query(l,mid))
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... | ||||
