Submission #49753

#	Time	Username	Problem	Language	Result	Execution time	Memory
49753		gs13105	Rice Hub (IOI11_ricehub)	C++17	49 / 100	24 ms	11896 KiB

ricehub

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <iterator>
#include "ricehub.h"

using namespace std;

int besthub(int R, int L, int X[], long long B)
{
    int p = 0, q = 0, res = 0;
    long long c = 0;
    for(int i = 0; i < R; i++)
    {
        if(i)
            c += 1LL * ((i - p) - (q - i)) * (X[i] - X[i - 1]);

        while(c > B)
            c -= X[i] - X[p++];

        while(q < R && (X[q] - X[i] <= X[i] - X[p] || c + X[q] - X[i] <= B))
        {
            c += X[q++] - X[i];
            while(c > B)
                c -= X[i] - X[p++];
        }

        res = max(res, q - p);
    }
    return res;
}

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