Submission #856474

#	Time	Username	Problem	Language	Result	Execution time	Memory
856474		nnin	Rice Hub (IOI11_ricehub)	C++14	68 / 100	10 ms	3684 KiB

ricehub

#include "ricehub.h"
#include<bits/stdc++.h>
#define ll long long
#define pii pair<ll,int>
using namespace std;

int besthub(int n, int m, int x[], long long b) {
    int ans = 0;
    ll cost = 0;
    int l = 0;
    int r = 0;
    for(int i=0;i<n;i++) {
        if(i>0) cost += (x[i]-x[i-1])*(i-l-r+i-1);
        if(r<i) {
            cost += x[++r]-x[i];
        }
        while(cost>b) {
            if(x[r]-x[i] > x[i]-x[l]) {
                cost -= x[r--]-x[i];
            } else {
                cost -= x[i]-x[l++];
            }
        }
        while(true) {
            if(r<n-1 && x[r+1]-x[i] <= x[i]-x[l]) {
                cost += x[++r]-x[i];
                cost -= x[i]-x[l++];
            } else if(l>0 && x[i]-x[l-1] < x[r]-x[i]) {
                cost += x[i]-x[--l];
                cost -= x[r--]-x[i];
            } else if(r<n-1 && cost+x[r+1]-x[i] <= b) {
                cost += x[++r]-x[i];
            } else if(l>0 && cost+x[i]-x[l-1] <= b) {
                cost += x[i]-x[--l];
            } else {
                break;
            }
        }
        ans = max(ans, r-l+1);
    }
    return ans;
}
/*
5 20 6
1
2
10
12
14
3

*/

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