# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
71628 | 2018-08-25T09:15:20 Z | test(#2228, jh05013) | 일하는 개미 (FXCUP3_ant) | C++ | 3 ms | 496 KB |
#include "ant.h" int paramin(int s, int e){ // Add more parameters as you need int mid, ans; while(s <= e){ mid = (s+e)/2; // Predicate here bool pred = (DeliverCount(mid) >= 1); // Predicate ends if(pred) e=mid-1, ans=mid; else s=mid+1; } return ans; } int FindK() { return paramin(1, 99999999); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Partially correct | 3 ms | 256 KB | Partially correct : C = 27 |
2 | Partially correct | 2 ms | 496 KB | Partially correct : C = 27 |
3 | Partially correct | 2 ms | 496 KB | Partially correct : C = 27 |
4 | Partially correct | 3 ms | 496 KB | Partially correct : C = 27 |
5 | Partially correct | 3 ms | 496 KB | Partially correct : C = 27 |