#include "ant.h"
int FindK()
{
int f = 66666666;
int t = DeliverCount(f);
int s, g;
if(t == 0)
{
s = f + 1;
g = 99999999;
}
else if(t == 1)
{
s = f / 2 + 1;
g = f;
}
else
{
s = 1;
g = f / 2;
}
while(s < g)
{
int x = (s + g) / 2;
int t = DeliverCount(x);
if(t > 1)
g = x - 1;
else if(t == 1)
g = x;
else
s = x + 1;
}
return s;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
248 KB |
Correct |
2 |
Correct |
2 ms |
356 KB |
Correct |
3 |
Correct |
3 ms |
440 KB |
Correct |
4 |
Correct |
2 ms |
440 KB |
Correct |
5 |
Correct |
2 ms |
440 KB |
Correct |