제출 #725896

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
725896		adrilen	Rice Hub (IOI11_ricehub)	C++17	0 / 100	16 ms	2884 KiB

ricehub

#include "ricehub.h"
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> pii;

int besthub(int n, int L, int X[], long long b)
{
    vector <ll> fields;
    for (int i = 0; i < n; i++) fields.emplace_back(X[i]);

    auto lt = fields.begin(), pos = fields.begin(), rt = fields.begin() + 1;
    ll left, right;
    left = right = 0;
    ll cur = 0;
    ll output = 0;

    while (rt != fields.end())
    {

        while (b < cur)
        {
            // cout << *pos << " " << *lt << " " << cur << endl;
            cur -= *pos - *lt;
            lt++, left--;
        }

        while (rt != fields.end() && cur + *rt - *pos <= b)
        {   
            cur += *rt - *pos;
            right++, rt++;
        }

        while (rt != fields.end() && (*pos - *lt) > (*rt - *pos))
        {
            left--, right++, lt++, rt++;
            while (rt != fields.end() && cur + *rt - *pos <= b)
            {   
                cur += *rt - *pos;
                right++, rt++;
            }
        }

        // cout << lt - fields.begin() << " " << pos - fields.begin() << " " << rt - fields.begin() << " " << cur << " " << left << " " << right << endl;
        output = max(output, left + right + 1);

        if (pos + 1 != fields.end()) {
            // cout << cur << " ";
            cur += (*(pos + 1) - *pos) * (left + 1);
            // cout << cur << " ";
            cur += (*pos - *(pos + 1)) * (right);
            // cout << cur << endl;
        }
        pos++, left++, right--;

    }
    // cerr << output << "\n";
    return output;
}

• Subtask 1: 0 / 17
• Subtask 2: 0 / 25
• Subtask 3: 0 / 26
• Subtask 4: 0 / 32