제출 #1238956

#제출 시각아이디문제언어결과실행 시간메모리
1238956noopHack (APIO25_hack)C++20
0 / 100
8 ms1208 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+1; 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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...