# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
469009 | 2021-08-30T11:52:09 Z | Cross_Ratio | 커다란 상품 (IOI17_prize) | C++14 | 90 ms | 328 KB |
#include "prize.h" #include <bits/stdc++.h> using namespace std; int find_best(int N) { int s = 0; int e = N; srand(0); int cnt = 0; while(s + 1 != e) { int mid = rand() % (e - s) + s; vector<int> V = ask(mid); if(V[0] == 0 && V[1] == 0) return mid; else if(V[0] == 0) s = mid; else if(V[1] == 0) e = mid; cnt++; assert(cnt < 10000); } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 200 KB | Output is correct |
2 | Correct | 1 ms | 328 KB | Output is correct |
3 | Correct | 1 ms | 284 KB | Output is correct |
4 | Correct | 1 ms | 200 KB | Output is correct |
5 | Correct | 1 ms | 200 KB | Output is correct |
6 | Correct | 1 ms | 200 KB | Output is correct |
7 | Correct | 1 ms | 328 KB | Output is correct |
8 | Correct | 1 ms | 200 KB | Output is correct |
9 | Correct | 1 ms | 200 KB | Output is correct |
10 | Correct | 1 ms | 200 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 200 KB | Output is correct |
2 | Correct | 1 ms | 200 KB | Output is correct |
3 | Correct | 1 ms | 284 KB | Output is correct |
4 | Correct | 1 ms | 200 KB | Output is correct |
5 | Correct | 1 ms | 200 KB | Output is correct |
6 | Correct | 1 ms | 272 KB | Output is correct |
7 | Correct | 1 ms | 296 KB | Output is correct |
8 | Correct | 1 ms | 280 KB | Output is correct |
9 | Correct | 1 ms | 272 KB | Output is correct |
10 | Correct | 1 ms | 200 KB | Output is correct |
11 | Runtime error | 90 ms | 320 KB | Execution killed with signal 6 |
12 | Halted | 0 ms | 0 KB | - |