제출 #725932

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
725932		adrilen	Rice Hub (IOI11_ricehub)	C++17	49 / 100	19 ms	2892 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 pos = fields.begin(), lt = fields.begin(), rt = fields.begin() + 1;
    ll cur = 0;
    if (n == 1) return 1;
    long output = 0;


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

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

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

        // cout << lt - fields.begin() << " " << pos - fields.begin() << " " << rt - fields.begin() << "\n";
        output = max(output, ((rt - fields.begin()) - (lt - fields.begin())));
        
        pos++;
        if (rt != fields.end())
        {
            // cout << "c";
            // cout << cur << " ";
            cur += (*pos - *(pos - 1)) * ((pos - fields.begin()) - (lt - fields.begin()));
            // cout << cur << " ";
            cur += (*(pos - 1) - *pos) * ((rt - fields.begin()) - (pos - fields.begin()));
            // cout << cur << "\n";
        }
    }
    // cerr << output << "\n";
    return output;
}

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