Submission #782719

#	Time	Username	Problem	Language	Result	Execution time	Memory
782719		JoenPoenMan	Rice Hub (IOI11_ricehub)	C++17	17 / 100	1080 ms	1616 KiB

ricehub

#include "ricehub.h"
#include <bits/stdc++.h>

using namespace std;

#define ALL(arr) begin(arr), end(arr)
#define CONTAINS(arr, val) (find(ALL(arr), val) == end(arr))

typedef pair<int, int> ii;

int besthub(int R, int L, int X[], long long B)
{
    vector<int> crs;
    long long cost = 0;
    int i = 0;
    int best = 0;
    int dc = 0;
    for (int x = 1; x <= L && i < R; x++)
    {
        while (crs.size() && i < R && (X[i]-x) <= crs[0]) {
            cost -= crs[0];
            crs.erase(crs.begin());
            crs.push_back(x - X[i]);
            cost += X[i]-x;
            dc -= 2;
            i++;
        }
        while (i < R && cost + (X[i]-x) <= B) {
            crs.push_back(x - X[i]);
            cost += X[i]-x;
            dc--;
            i++;
        }
        best = max(best, (int)crs.size());
        for (int &el : crs) {
            if (el == 0) {
                dc += 2;
            } 
            el++;
        }
        cost += dc;
        while (cost > B) {
            cost -= crs[0];
            crs.erase(crs.begin());
            dc--;
        }
    }
    return best;
}

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