Submission #597841

#	Time	Username	Problem	Language	Result	Execution time	Memory
597841		yanndev	커다란 상품 (IOI17_prize)	C++17	20 / 100	50 ms	336 KiB

prize

#include "prize.h"
#include <bits/stdc++.h>
using namespace std;

int find_best(int n) {
    for (int i = 0; i < n; i++) {
        vector<int> a = ask(i);
        if (a[0] == 0 && a[1] == 0)
            return i;
        
        int l = i;
        int r = n;
        while (l < r) {
            int m = (l + r + 1) / 2;
            vector<int> b = ask(m);
            if (b[0] == a[0] && b[1] == a[1])
                l = m;
            else
                r = m - 1;
        }

		//cout << "poor range " << i << ' ' << l << '\n';
        i = max(i, l - 1);
    }
}

Compilation message (stderr)

prize.cpp: In function 'int find_best(int)':
prize.cpp:25:1: warning: control reaches end of non-void function [-Wreturn-type]
   25 | }
      | ^

• Subtask 1: 20 / 20
• Subtask 2: 0 / 80