Submission #597856

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

prize

#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
 
int totQ = 0;
vector<int> ans[200042];
 
vector<int> query(int i) {
    if (ans[i].empty()) {
        totQ++;
        return ans[i] = ask(i);
    }
    return ans[i];
}
 
int find_best(int n) {
    for (int i = 0; i < n; i++) {
        vector<int> a = query(i);
        assert(totQ <= 10000);
        if (a[0] == 0 && a[1] == 0)
            return i;
        
        int l = i;
        int r = n - 1;
        while (l < r) {
            assert(totQ <= 10000);
            int m = (l + r + 1) / 2;
            vector<int> b = query(m);
            if (b[0] == a[0] && b[1] == a[1])
                l = m;
            else
                r = m - 1;
        }
 
		//cout << "poor range " << i << ' ' << l << '\n';
        i = l;
    }
}

Compilation message (stderr)

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

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