oj.uz

Submission #71828

# Submission time Handle Problem Language Result Execution time Memory
71828 2018-08-25T16:33:29 Z Rolling Tamref(#2251, TAMREF) The Ant Doing Hard Work (FXCUP3_ant) C++17
100 / 100
 3 ms 484 KB 
#include "ant.h"

int FindK() {
    int tt = 1 << 26;
    int q = DeliverCount(tt);
    int lo = tt/(q+1), mi, hi = (q ? (tt+q-1)/q : 1e8-1);
    int d;
    while(hi - lo > 1){
        mi = (lo + hi) >> 1;
        d = DeliverCount(mi);
        if(d){
            hi = mi;
        }else{
            lo = mi;
        }
    }
	return hi;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 248 KB Correct
2 Correct 2 ms 484 KB Correct
3 Correct 2 ms 484 KB Correct
4 Correct 2 ms 484 KB Correct
5 Correct 3 ms 484 KB Correct