Submission #614235

#	Time	Username	Problem	Language	Result	Execution time	Memory
614235		nohaxjustsoflo	Rice Hub (IOI11_ricehub)	C++17	0 / 100	2 ms	468 KiB

ricehub

#include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<ll,null_type,less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> order_set;
mt19937 mt_rand(chrono::high_resolution_clock::now().time_since_epoch().count());
//uniform_int_distribution<int> gen; ///(min, max)
//int random() {return gen(mt_rand);}
const int mxN=1e5+5;
const int mod=998244353;
const int mxlogN=40;
const int mxK=26;
const int inf=2e9;
const int K=600;
ll a[mxN];
#include "ricehub.h"
int besthub(int n, int L, int A[], ll B)
{
    for(int i=0; i<n; i++) a[i]=A[i];
    ll ans=1,l=0,r=1;
    for(ll i=0; i<n; i++)
    {
        if(i)
        {
            B+=(r-i)*(a[i]-a[i-1]);
            B-=(i-l)*(a[i]-a[i-1]);
        }
        while(l<i&&B<0) B+=a[i]-a[l++];
        while(1)
        {
            while(r<n&&a[i]>=B) B-=a[r++]-a[i];
            ans=max(ans,r-l);
            bool ok=1;
            while(l<i&&r<n&&a[i]-a[l]>a[r]-a[i])
            {
                B+=a[i]-a[l++];
                B-=a[r++]-a[i];
                ok=0;
            }
            if(ok) break;
        }
    }
    return ans;
}
/*
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n, L, B; cin >> n >> L >> B;
    int a[n];
    for(int i=0; i<n; i++) cin >> a[i];
    cout << besthub(n,L,a,B);
}
*/
/*
7 3
4 1 3 4 0 2 3
*/

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