Submission #71902

# Submission time Handle Problem Language Result Execution time Memory
71902 2018-08-25T20:07:26 Z :p(#2229, exqt) The Ant Doing Hard Work (FXCUP3_ant) C++17
0 / 100
3 ms 248 KB
#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 time Memory Grader output
1 Runtime error 3 ms 248 KB Execution failed because the return code was nonzero
2 Halted 0 ms 0 KB -