Submission #1199441

#	Time	Username	Problem	Language	Result	Execution time	Memory
1199441		AMel0n	Rice Hub (IOI11_ricehub)	C++20	100 / 100	8 ms	2376 KiB

ricehub

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define FOR(i,N) for(ll i = 0; i < N; i++)
#define all(x) (x).begin(), (x).end()
#define F first 
#define S second

#include "ricehub.h"

ll N;
vector<ll> ps;
vector<ll> V;

ll cost(ll l, ll r) {
    ll m = (l + r) / 2; // 0 indexed
    // sum of the distance of coordinates between rice field m and rice fields [l, r]
    return (ps[r+1] - ps[m+1]) - V[m] * (r-m)    +   V[m] * (m-l+1) - (ps[m+1] - ps[l]);
}

int besthub(int R, int L, int X[], ll B) {
    ::N = R;
    ps.resize(N+1);
    V.resize(N+1);
    FOR(i,N) {ps[i+1] = ps[i] + X[i]; V[i] = X[i];}

    ll res = 0, l = 0;
    for (ll r = 0; r < N; r++) { // two pointers, indices of the ricehubs
        ll c = cost(l, r);
        while (c > B) {
            l++;
            c = cost(l, r);
        }
        res = max(res, r - l + 1);
    }
    return res;
}

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