제출 #265080

#제출 시각아이디문제언어결과실행 시간메모리
265080arayi커다란 상품 (IOI17_prize)C++17
0 / 100
59 ms2936 KiB
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;


const int N = 2e5 + 55;
int dz[N], aj[N];
bool col[N];
int mx, q;
int as(int a)
{
    q++;
    if(q == 4500)
    {
        assert(0);
    }
    vector <int> fp = ask(a);
    if(fp[0] + fp[1] == 0) return 0;
    if(!col[a] && fp[0] + fp[1] < mx) return 2;
    if(fp[0] - dz[a]) return -1;
    return 1;
}

int find_best(int n) {
    mx = (n + 1) / 2;
    while(true)
    {
        int l = 0, r = n - 1;
        while(l <= r)
        {
            int mid = (l + r)/2;
            int sm = as(mid);
            if(sm == 0) return mid;
            if(sm == 2)
            {
                for (int i = mid + 1; i < n; i++)
                    dz[i]++;
                for (int i = mid - 1; i >= 0; i--)
                    aj[i]++;
                col[mid] = true;
                break;
            }
            if(sm == 1) l = mid + 1;
            if(sm == -1) r = mid - 1;
        }
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...