oj.uz

답안 #469006

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
469006 2021-08-30T11:41:21 Z Cross_Ratio 커다란 상품 (IOI17_prize) C++14
20 / 100
 92 ms 328 KB 
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;



int find_best(int N) {
    int s = 0;
    int e = N;
    while(s + 1 != e) {
        int mid = s + e >> 1;
        vector<int> V = ask(mid);
        if(V[0]==0&&V[1]==0) return mid;
        if(V[0]==1) e = mid;
        else s = mid;
    }
}

Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:11:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   11 |         int mid = s + e >> 1;
      |                   ~~^~~
prize.cpp:17:1: warning: control reaches end of non-void function [-Wreturn-type]
   17 | }
      | ^

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 280 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 0 ms 200 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

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 280 KB Output is correct
3 Correct 1 ms 272 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 0 ms 200 KB Output is correct
8 Correct 1 ms 280 KB Output is correct
9 Correct 1 ms 200 KB Output is correct
10 Correct 1 ms 200 KB Output is correct
11 Incorrect 92 ms 284 KB Incorrect
12 Halted 0 ms 0 KB -