Submission #1031781

#	Time	Username	Problem	Language	Result	Execution time	Memory
1031781		shiomusubi496	The Big Prize (IOI17_prize)	C++17	99.72 / 100	35 ms	5656 KiB

prize

#include "prize.h"
 
#include <bits/stdc++.h>
 
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rrep(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define rrep2(i, a, b) for (int i = (int)(b) - 1; i >= (int)(a); --i)
 
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
 
using namespace std;
 
using ll = long long;
 
template<class T, class U> bool chmin(T& a, const U& b) { return a > b ? a = b, true : false; }
template<class T, class U> bool chmax(T& a, const U& b) { return a < b ? a = b, true : false; }
 
vector<vector<int>> memo;
vector<int> Ask(int n) {
    if (memo[n].empty()) memo[n] = ask(n);
    return memo[n];
}
 
int find_best(int n) {
    memo.resize(n);
    int cnt = 0, xx = 480;
    rep (i, 480) {
        auto res = Ask(i);
        chmax(cnt, res[0] + res[1]);
        if (res[0] + res[1] == 0) return i;
        if (cnt >= 30) {
            xx = i + 1;
            break;
        }
    }
    int x = xx;
    while (x < n) {
        int y = 0;
        while (x < n) {
            auto res = Ask(x);
            if (res[0] + res[1] == 0) return x;
            if (res[0] + res[1] == cnt) {
                y = res[0];
                break;
            }
            ++x;
        }
        int ok = xx, ng = n;
        while (ng - ok > 1) {
            int mid = (ok + ng) / 2;
            if (mid <= x) ok = mid;
            else {
                auto res = Ask(mid);
                if (res[0] + res[1] == 0) return mid;
                if (res[0] + res[1] < cnt) ng = mid;
                else if (res[0] > y) ng = mid;
                else ok = mid;
            }
        }
        x = ok + 1;
    }
}

Compilation message (stderr)

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

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