Submission #1086950

#	Time	Username	Problem	Language	Result	Execution time	Memory
1086950		MrPavlito	Rice Hub (IOI11_ricehub)	C++17	17 / 100	9 ms	1884 KiB

ricehub

#include "ricehub.h"
#include <bits/stdc++.h>
//#define int long long
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define sc second
#define endl "\n"
#define pii pair<int,int>


using namespace std;

const int MAXN = 1e5+5;
const int mod7 = 1e9+7;
const long long inf = 1e18;

int n;

int besthub(int R, int L, int X[], long long B)
{
    n = R;
    int l = 0;int r =1;
    int i =0;
    long long trsum = 0;
    int cntr = 0;
    int cntl =0;
    int mx = 0;
    while(r<n)
    {
        while(r<n)
        {
            if(trsum+ X[r] - X[i] <= B)
            {
                trsum+= X[r++] - X[i];
                cntr++;
            }
            else if(i<l && X[r] - X[i] < X[i] - X[l] && trsum+ (X[r] - X[i]) - (X[i] - X[l]) <= B)
            {

                trsum -= (X[i] - X[l]);
                trsum += (X[r] - X[i]);
                l++;
                r++;
            }
            else if(trsum >= B && l<i)
            {
                cntl--;
                trsum -= (X[i] - X[l++]);
            }
            else break;
        }
        mx = max(mx, r-l);
        i++;
        trsum += (i-l) * (X[i] - X[i-1]);
        trsum -= (r-i) * (X[i] - X[i-1]);

    }
    return mx;
}

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