제출 #397252

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
397252		idk321	커다란 상품 (IOI17_prize)	C++11	20 / 100	57 ms	22512 KiB

prize

#include "prize.h"

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;

int to;

vector<int> big;

pair<int, vector<int>> differentRight(int a, int b, vector<int> inf)
{

    int res = -1;
    vector<int> rinf;
    while (a <= b)
    {
        int mid = (a + b) / 2;
        vector<int> cinf = ask(mid);

        if (cinf == inf)
        {
            a = mid + 1;
        } else
        {
            res = mid;
            rinf = cinf;
            b = mid - 1;
            if (cinf[0] + cinf[1] == big[0] + big[1])
            {

            }
        }
    }

    return {res, rinf};
}

pair<int, vector<int>> differentLeft(int a, int b, vector<int> inf)
{
    int res = -1;
    vector<int> rinf;
    while (a <= b)
    {
        int mid = (a + b) / 2;
        vector<int> cinf = ask(mid);

        if (cinf == inf)
        {
            b = mid - 1;
        } else
        {
            res = mid;
            rinf = cinf;
            a = mid + 1;
        }
    }

    return {res, rinf};
}

int find_best(int N) {
    n = N;
    to = n - 1;

    if (n <= 5000)
    {
        int res = -1;
        for (int i = 0; i < n; i++)
        {
            vector<int> v = ask(i);
            if (v[0] == 0 && v[1] == 0) res = i;
        }

        return res;
    }

    vector<int> needed = {0, 0};
    big = {0, 0};
    vector<int> inf;
    int cur = 0;
    inf = ask(cur);
    if (inf[0] + inf[1] > big[0] + big[1]) big = inf;

    if (inf == needed) return cur;
    for (int i = 0; i < 4; i++)
    {
        auto p1 = differentRight(cur, n - 1, inf);
        cur = p1.first;
        inf = p1.second;
        if (inf == needed) return cur;
        if (inf[0] + inf[1] > big[0] + big[1]) big = inf;
    }
    int sum = big[0] + big[1];

    vector<vector<int>> infAt(n, vector<int>(2));
    for (int i = 0; i < n; i += 100)
    {
        infAt[i] = ask(i);
        if (infAt[i] == needed) return i;
    }

    for (int i = 0; i + 100 < n; i += 100)
    {
        int l = i;
        int r = i + 100;

        if (infAt[l] == needed) return l;
        if (infAt[r] == needed) return r;

        if (infAt[l][0] + infAt[l][1] == sum)
        {
            auto p1 = differentRight(l, r, infAt[l]);
            l = p1.first;
            infAt[l] = p1.second;
        }
        if (infAt[r][0] + infAt[r][1] == sum)
        {
            auto p2 = differentLeft(l, r, infAt[r]);
            r = p2.first;
            infAt[r] = p2.second;
        }

        if (infAt[l] == needed) return l;
        if (infAt[r] == needed) return r;

        if (r - l <= 1) continue;
        if ((infAt[l][0] + infAt[l][1] == infAt[r][0] + infAt[r][1] &&  infAt[l][1] - infAt[r][1] > 0) || (infAt[l][0] + infAt[l][1] <= 30 || infAt[r][0] + infAt[r][1] <= 30))
        {
            for (int j = l + 1; j < r; j++)
            {
                vector<int> cinf = ask(j);
                if (cinf[0] == 0 && cinf[1] == 0) return j;
            }
        }
    }

    for (int i = 0; i < n; i += 100)
    {
        if (i + 100 >= n)
        {
            for (int j = i + 1; j < n; j++)
            {
                vector<int> cinf = ask(j);
                if (cinf == needed) return j;
            }
        }
    }


	return -1;
}

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