제출 #264737

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
264737		Coroian_David	커다란 상품 (IOI17_prize)	C++11	97.62 / 100	58 ms	4272 KiB

prize

#include <bits/stdc++.h>

//#include "prize.h"

#define MAX_N 200000

#define xx first
#define yy second

using namespace std;

typedef long long lint;

vector<int> ask(int i);

int N;
int mx;
int rez = -1;
int spec[MAX_N + 1];

int xd[MAX_N + 1];
pair <int, int> q[MAX_N + 1];

vector <int> tmp;

int ST, DR;

int aib[MAX_N + 1];

void baga(int poz, int nr)
{
    while(poz <= N)
    {
        aib[poz] += nr;
        poz += poz & (-poz);
    }
}

int getSum(int poz)
{
    int rez = 0;
    while(poz > 0)
    {
        rez += aib[poz];
        poz -= poz & (-poz);
    }

    return rez;
}

int getS(int st, int dr)
{
    int rez = getSum(dr);
    rez -= getSum(st - 1);

    return rez;
}

int XX;

vector <int> doAsk(int poz)
{
    static int CNT = 0;

    if(rez != -1)
        return {0, 0};

    if(xd[poz] == 1)
    {
        tmp[0] = q[poz].xx;
        tmp[1] = q[poz].yy;

        return tmp;
    }

    xd[poz] = 1;


    CNT ++;

    assert(CNT <= 10000);
    vector <int> a = ask(poz - 1);
    q[poz] = {a[0], a[1]};

    if(a[0] + a[1] > mx && XX)
        while(1)cout << " PUSCA " << a[0] << " " << a[1] << " " << mx << "\n";

    if(a[0] + a[1] == 0)
        rez = poz;

    else if(a[0] + a[1] < mx)
    {
        spec[poz] = 1;
        baga(poz, 1);

        if(a[0] == 0)
            ST = max(ST, poz);

        if(a[1] == 0)
            DR = min(DR, poz);
    }


    return a;
}

bool verif(int poz, int &cst, int &cdr, int &px)
{
    if(rez != -1)
        return 0;

    vector <int> a = doAsk(poz);

    if(a[0] + a[1] == mx)
    {
        cst = a[0];
        cdr = a[1];
        px = poz;

        return 1;
    }

    spec[poz] = 1;
    return 0;
}

int lst, ldr;

void intreaba(int poz, int &cst, int &cdr, int &px)
{
    int n = N;

    if(rez != -1)
        return;

    if(verif(poz, cst, cdr, px))
        return;

    int st = poz - 1;
    int dr = poz + 1;
    while(st >= lst || dr <= ldr)
    {
        if(st >= lst)
        {
            if(verif(st, cst, cdr, px))
                return;

            st --;
        }

        if(dr <= ldr)
        {
            if(verif(dr, cst, cdr, px))
                return;

            dr ++;
        }
    }
}

void divide(int st, int dr, int pst, int pdr, int cate)
{
    if(rez != -1)
        return;

    st = max(st, ST);
    dr = min(dr, DR);

    if(st > dr || cate == 0)
        return;

    int nou = cate - getS(st, dr);
    if(nou <= 0)
        return;

   // cout << " SUNTEM " << st << " " << dr << " AVEM INSRE ST " << pst << " DR " << pdr << " " << cate << "\n";

    if((dr - st + 1) - cate <= 1)
    {
        for(int i = st; i <= dr; i ++)
            doAsk(i);

        return;
    }


    int cst, cdr, px;
    int mid = (st + dr) >> 1;
    lst = st;
    ldr = dr;
    intreaba(mid, cst, cdr, px);

    divide(st, px - 1, pst, cdr, cst - pst);
    divide(px + 1, dr, cst, pdr, cdr - pdr);
}

int find_best(int n)
{
    ST = 1;
    DR = n;
    N = n;
    tmp.resize(2);
    if(n <= 5000)
    {
        for(int i = 0; i < n; i ++)
        {
            vector<int> a = ask(i);

            if(a[0] + a[1] == 0)
                return i;
        }

        assert(1 == 0);
        //return;
    }

    srand(time(0));
    int rad = sqrt(n);
    int change = 0;
    for(int i = 1; i <= 480; i ++)
    {
        lint poz = i - 1;

        vector <int> a = doAsk(poz + 1);

        if(a[0] + a[1] == 0)
            return poz;

        if(a[0] + a[1] > mx)
            change ++;

        mx = max(mx, a[0] + a[1]);

        if(change == 4)
            break;
    }

    XX = 1;

    divide(1, n, 0, 0, mx);

    return rez - 1;
}

컴파일 시 표준 에러 (stderr) 메시지

prize.cpp: In function 'void intreaba(int, int&, int&, int&)':
prize.cpp:131:9: warning: unused variable 'n' [-Wunused-variable]
  131 |     int n = N;
      |         ^
prize.cpp: In function 'int find_best(int)':
prize.cpp:218:9: warning: unused variable 'rad' [-Wunused-variable]
  218 |     int rad = sqrt(n);
      |         ^~~

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