Submission #787091

#	Time	Username	Problem	Language	Result	Execution time	Memory
787091		JoenPoenMan	Rice Hub (IOI11_ricehub)	C++17	68 / 100	1059 ms	1680 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;
    stack<ii> removed;
    long long cost = 0;
    int i = 0;
    int best = 0;
    long long dc = 0;
    unsigned int distTillNext = 1e8;
    for (int x = 1; x <= L && (i < R || dc < 0); x++)
    {
        while (!removed.empty() && removed.top().first + x - removed.top().second <= B - cost) {
            crs.insert(crs.begin(), removed.top().first + x - removed.top().second);
            cost += crs[0];
            dc++;
            removed.pop();
        }
        while (i < R && cost + (X[i]-x) <= B) {
            crs.push_back(x - X[i]);
            cost += X[i]-x;
            dc--;
            i++;
        }
        while (crs.size() && i < R && (X[i]-x) <= crs[0]) {
            cost -= crs[0];
            removed.push({crs[0], x});
            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());
        distTillNext = 1e8;
        bool first = false;
        for (int i = 0; i < crs.size(); i++) {
            if (crs[i] == 0) {
                dc += 2;
            } 
            if (crs[i] < 0 && !first) distTillNext = -crs[i]-1, first = true;
            crs[i]++;
        }
        
    

        cost += dc;
        while (cost > B) {
            cost -= crs[0];
            removed.push({crs[0], x});
            crs.erase(crs.begin());
            dc--;
        }
        unsigned int dx = 1e8;
        if (i < R && X[i]-(x+1) <= B-cost) dx = 0;
        if (i < R && dc-1 != 0) dx = ceil((B - cost - X[i] + (float)(x+1))/(dc-1));
        if (i < R && crs.size()) dx = min(dx, (unsigned int)((X[i]-(x+1)-crs[0]+1)/2));
        dx = min(dx, distTillNext);
        if (dc > 0) {
            dx = min(dx, (unsigned int)((B-cost)/dc));
        }
        x += dx;
        cost += dc * dx;
        for (int &el : crs) el += dx;
    }
    return best;
}

Compilation message (stderr)

ricehub.cpp: In function 'int besthub(int, int, int*, long long int)':
ricehub.cpp:54:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |         for (int i = 0; i < crs.size(); i++) {
      |                         ~~^~~~~~~~~~~~

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