제출 #757785

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
757785		borisAngelov	커다란 상품 (IOI17_prize)	C++17	컴파일 에러	0 ms	0 KiB

prize

#include "prize.h"

#include <iostream>
#include <vector>
#include <random>
#include <ctime>

using namespace std;

const int maxn = 200005;

int N;

int max_result = 0;

vector<int> results[maxn];

int divide(int l, int r, int removed_from_left, int removed_from_right)
{
    if (l > r)
    {
        return 0;
    }

    int mid = (l + r) / 2;
    vector<int> curr;

    while (mid <= r)
    {
        //curr = ask(mid);

        if (!results[mid].empty())
        {
            curr = results[mid];
        }
        else
        {
            curr = ask(curr);
            results[mid].push_back(curr[0]);
            results[mid].push_back(curr[1]);
        }

        if (curr[0] + curr[1] == 0)
        {
            return mid;
        }

        if (curr[0] + curr[1] == max_result)
        {
            break;
        }

        ++mid;
    }

    if (mid <= r)
    {
        curr[0] -= (removed_from_left - (mid - (l + r) / 2));
        curr[1] -= removed_from_right;

        if (curr[0] > 0)
        {
            int idx = divide(l, (l + r) / 2 - 1, removed_from_left, removed_from_right + curr[1] + (mid - (l + r) / 2));

            if (idx != 0)
            {
                return idx;
            }
        }

        if (curr[1] > 0)
        {
            int idx = divide(mid + 1, r, removed_from_left + curr[0] + (mid - (l + r) / 2), removed_from_right);

            if (idx != 0)
            {
                return idx;
            }
        }

        return 0;
    }
    else
    {
        mid = (l + r) / 2 - 1;

        while (mid >= l)
        {
            if (!results[mid].empty())
            {
                curr = results[mid];
            }
            else
            {
                curr = ask(curr);
                results[mid].push_back(curr[0]);
                results[mid].push_back(curr[1]);
            }

            if (curr[0] + curr[1] == 0)
            {
                return mid;
            }

            if (curr[0] + curr[1] == max_result)
            {
                return mid;
            }

            --mid;
        }

        if (mid == l - 1)
        {
            return 0;
        }

        curr[0] -= removed_from_left;

        if (curr[0] > 0)
        {
            return divide(l, mid - 1, removed_from_left, removed_from_right + (r - mid));
        }

        return 0;
    }

    return 0;
}

int find_best(int n)
{
    N = n;

    for (int i = 0; i < min(n, 470); ++i)
    {
        vector<int> curr_result = ask(i);

        results[i].push_back(curr_result[0]);
        results[i].push_back(curr_result[1]);

        max_result = max(max_result, curr_result[0] + curr_result[1]);
    }

    return divide(0, N - 1, 0, 0);
}

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

prize.cpp: In function 'int divide(int, int, int, int)':
prize.cpp:38:24: error: cannot convert 'std::vector<int>' to 'int'
   38 |             curr = ask(curr);
      |                        ^~~~
      |                        |
      |                        std::vector<int>
In file included from prize.cpp:1:
prize.h:4:26: note:   initializing argument 1 of 'std::vector<int> ask(int)'
    4 | std::vector<int> ask(int i);
      |                      ~~~~^
prize.cpp:95:28: error: cannot convert 'std::vector<int>' to 'int'
   95 |                 curr = ask(curr);
      |                            ^~~~
      |                            |
      |                            std::vector<int>
In file included from prize.cpp:1:
prize.h:4:26: note:   initializing argument 1 of 'std::vector<int> ask(int)'
    4 | std::vector<int> ask(int i);
      |                      ~~~~^