Submission #316176

#	Time	Username	Problem	Language	Result	Execution time	Memory
316176		nikatamliani	The Big Prize (IOI17_prize)	C++14	0 / 100	7 ms	256 KiB

prize

#include <bits/stdc++.h>
using namespace std;
#include "prize.h"
int find_best(int n) {
    int next = -1, at_most = 471;
    if(n > 10000) {
        vector < int > bad;
        for(int i = 0; i <= at_most; ++i) {
            bad = max(bad, ask(i));
        }
        for(int i = 0; i < n; i = next) {
            int l = i, r = n - 1; next = -1;
            vector < int > t = ask(i);
            if(t[0] + t[1] != bad[0] + bad[1]) {
                next = i + 1;
                if(t[0] == 0 && t[1] == 0) return i; 
                continue;
            } 
            while(r >= l) {
                int m = l + r >> 1;
                vector < int > x = ask(m);
                if(x == t) {
                    next = m;
                    l = m + 1;
                } else {
                    r = m - 1; 
                }
            }
            assert(next >= 0);
            vector < int > tt = ask(next);
            for(int j = next + 1; j < n; ++j) {
                vector < int > p = ask(j);
                if(p[0] + p[1] != bad[0] + bad[1]) {
                    if(p[0] == 0 && p[1] == 0) return i;
                    continue;
                }
                next = j;
                break;
            }
        }
        return -1;
    }
    //this is bad
    for(int i = 0; i < n; ++i) {
        vector < int > p = ask(i);
        if(!p[0] && !p[1]) return i; 
    }
}

Compilation message (stderr)

prize.cpp: In function 'int find_best(int)':
prize.cpp:20:27: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   20 |                 int m = l + r >> 1;
      |                         ~~^~~
prize.cpp:48:1: warning: control reaches end of non-void function [-Wreturn-type]
   48 | }
      | ^

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