Submission #71933

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
71933	2018-08-26T01:22:00 Z	블랙야크(#2261, cki86201)	The Ant Doing Hard Work (FXCUP3_ant)	C++17	100 / 100	2 ms	436 KB

ant

#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;
		if(low == 1 && high == 1e8) mid = (low + 2 * high) / 3;
        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;
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	256 KB	Correct
2	Correct	2 ms	360 KB	Correct
3	Correct	2 ms	360 KB	Correct
4	Correct	2 ms	436 KB	Correct
5	Correct	2 ms	436 KB	Correct