Submission #71878

#TimeUsernameProblemLanguageResultExecution timeMemory
71878:p (#119)The Ant Doing Hard Work (FXCUP3_ant)C++14
0 / 100
3 ms376 KiB
#include "ant.h" #include <bits/stdc++.h> using namespace std; int FindK() { int l = 1, r = 99999999; int res = 99999999; vector<pair<int, int>> logs; while(l<r) { int t = (l+r)/2; int cnt = DeliverCount(t); logs.push_back({t, cnt}); if(cnt > 0) { res = min(res, t); r = t - 1; } else l = t + 1; } bool ok = true; for(auto log : logs) { if(log.first/l != log.second) ok = false; } return ok ? l : res; }
#Verdict Execution timeMemoryGrader output
Fetching results...