Submission #135106

#TimeUsernameProblemLanguageResultExecution timeMemory
135106alexandra_udristoiu커다란 상품 (IOI17_prize)C++14
20 / 100
85 ms508 KiB
#include<iostream>
#include<vector>
#include "prize.h"
using namespace std;
int find_best(int n){
    int nr, p, st, dr, mid;
    vector<int> a;
    a = ask(0);
    if(a[1] == 0){
        return 0;
    }
    p = 0;
    nr = a[1];
    while(nr > 0){
        st = p + 1;
        dr = n;
        while(st <= dr){
            mid = (st + dr) / 2;
            a = ask(mid);
            if(a[1] == nr){
                st = mid + 1;
            }
            else{
                dr = mid - 1;
            }
        }
        a = ask(st);
        if(a[1] == 0){
            return st;
        }
        p = st + 1;
        nr--;
    }
}

Compilation message (stderr)

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