Submission #71932

#TimeUsernameProblemLanguageResultExecution timeMemory
71932블랙야크 (#119)The Ant Doing Hard Work (FXCUP3_ant)C++11
90 / 100
3 ms488 KiB
#include "ant.h"
#include <math.h>
#include <algorithm>
#include <stdio.h>
using namespace std;

int FindK() {
    int low = 1, high = 1e8, res = -1;
    while(low <= high) {
        int mid = (low + high) / 2;
        int t = DeliverCount(mid);
    	if(t == 0) low = mid + 1;
		else if(t == 1) {
			res = mid;
			high = mid - 1;
			low = max(low, mid / 2 + 1);
		}
		else {
			high = mid / 2;
		}
	}
    return res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...