제출 #1236321

#제출 시각아이디문제언어결과실행 시간메모리
1236321tamzidHack (APIO25_hack)C++20
0 / 100
0 ms320 KiB
#include "hack.h" #include <bits/stdc++.h> using ll = long long; int hack(){ // std::vector<long long> x = {3333,2565454,21223,898997,9999,4,8,100,2340040,222,44,2222211}; // long long a = collisions(x); ll st = 2; ll en = 1000000 - 1; while(st < en) { ll m = st + (en - st) / 2; if(collisions({1,m + 1}) == 2) { st = m + 1; } else { en = m - 1; } } return st; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...