Submission #758509

#	Time	Username	Problem	Language	Result	Execution time	Memory
758509		Andrey	커다란 상품 (IOI17_prize)	C++14	90 / 100	83 ms	344 KiB

prize

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

int find_best(int n) {
	int y = 0,l,r,m,x,big = 0,z,k;
	for(int i = 0; (i+1)*(i+1) <= n; i++) {
        vector<int> a = ask(i);
        if(a[0] == 0 && a[1] == 0) {
            return i;
        }
        if(a[0]+a[1] > big) {
            big = a[0]+a[1];
            y = i+1;
        }
	}
	k = 600;
	while(y < n) {
        vector<int> a = ask(y);
        x = a[0];
        z = a[1];
        l = y;
        r = n-1;
        if(x+z == 0) {
            return y;
        }
        for(int i = l+k; i < n; i+=k) {
            a = ask(i);
            if(a[0] == x && a[1] == z) {
                l = i;
            }
            else {
                r = i-1;
                l = r-k+1;
                break;
            }
        }
        while(l < r) {
            m = (l+r+1)/2;
            a = ask(m);
            if(a[0] == x && a[1] == z) {
                l = m;
            }
            else {
                r = m-1;
            }
        }
        a = ask(l+1);
        if(a[0] == 0 && a[1] == 0) {
            return l+1;
        }
        y = l+2;
	}
}

Compilation message (stderr)

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

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