Submission #500804

#	Time	Username	Problem	Language	Result	Execution time	Memory
500804		beaconmc	Rice Hub (IOI11_ricehub)	C++14	0 / 100	57 ms	1180 KiB

ricehub

//#include "ricehub.h"
#include <bits/stdc++.h>


typedef long long ll;
#define FOR(i, x, y) for(ll i=x; i<y; i++)

using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
  
#define ordered_set tree<ll, null_type,less_equal<ll>, rb_tree_tag,tree_order_statistics_node_update>


int besthub(int R, int L, int X[], ll B){
    ll lo = 0, hi = 0;
    ll ans = 0;
    ll curcost  = 0;
    while (hi<R-1){
        if ((hi-lo+1)%2==0) curcost += X[hi+1] - X[(hi-lo)/2+1 + lo];
        else curcost += X[hi+1] - X[(hi-lo)/2 + lo];
        if (curcost>B){
            if ((hi-lo+1)%2==0) curcost -= X[hi+1], curcost += X[lo];
            else curcost -= X[hi+1], curcost+= X[lo];
            lo ++;
        } else hi++;
        cout << "LOL" << lo << " " << hi << " " << curcost << endl;
        ans = max(ans, hi-lo+1);
    }
    return ans;
}


/*int main(){
    int R,L,B;
    cin >> R >> L >> B;
    int X[R];
    FOR(i, 0, R){
        cin >> X[i];
    }
    cout << besthub(R, L, X, B);
}*/

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