Submission #469009

#TimeUsernameProblemLanguageResultExecution timeMemory
469009Cross_Ratio커다란 상품 (IOI17_prize)C++14
20 / 100
90 ms328 KiB
#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 (stderr)

prize.cpp: In function 'int find_best(int)':
prize.cpp:21:1: warning: control reaches end of non-void function [-Wreturn-type]
   21 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...