Submission #71902

#TimeUsernameProblemLanguageResultExecution timeMemory
71902:p (#119)The Ant Doing Hard Work (FXCUP3_ant)C++17
0 / 100
3 ms248 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; int steps = 26; while(l<=r && steps > 0) { steps--; // cout << l << ' ' << r << ' ' << res << endl; int t = (l+r+1)/2; int p = 99999999 / t; int cnt = DeliverCount(t*p); logs.push_back({t*p, cnt}); if(cnt >= p) { res = min(res, t); r = t - 1; } else l = t + 1; } auto verify = [&logs](int x) -> bool { for(auto &log : logs) { if(log.first / x != log.second) return false; } return true; }; if(l<=r) { if(verify(l)) res = l; } return res; }
#Verdict Execution timeMemoryGrader output
Fetching results...