제출 #1207063

#제출 시각아이디문제언어결과실행 시간메모리
1207063baneHack (APIO25_hack)C++20
0 / 100
28 ms4256 KiB
#include "hack.h" #include <bits/stdc++.h> using namespace std; bool check(int mid){ vector<long long>X(mid + 1); iota(X.begin(), X.end(), 1); return collisions(X) >= 1; } int hack(){ int L = 2, R = 500'000; while(L<=R){ int mid = (L+R) / 2; if (R == L)return L; if (check(mid)){ R = mid - 1; }else{ L = mid + 1; } } return R + 1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...