제출 #402515

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
402515		Lobo	쌀 창고 (IOI11_ricehub)	C++17	100 / 100	24 ms	2116 KiB

ricehub

#include <bits/stdc++.h>
#include <ricehub.h>
 
using namespace std;
 
const long long INFll = 1e18;
const int INFii = 1e9;
const long long mod = (long long) 1e9 + 7;
typedef long long ll;
typedef int ii;
typedef double dbl;
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
 
#define maxn 110000
//LEMBRAR DE MUDAR
 
ll ps[maxn];
 
int besthub(int R, int L, int X[], long long B){
  
    ps[0] = 0;
    for(ll i = R; i >= 1; i--) {
        X[i] = X[i-1];
    }
 
    for(ll i = 1; i <= R; i++) {
        ps[i] = ps[i-1] + X[i]; 
    }
 
    ll ans = 0;
    for(ll i = 1; i <= R; i++) {
        ii l = i;
        ii r = R;
        ii mid = (l+r)/2;
        ii best = i;
 
        while(l <= r) {
            ll m = (i+mid)/2;
            ll cost = X[m]*(m-i+1) - ps[m] + ps[i-1]  +  ps[mid] - ps[m] - X[m]*(mid-m);
 
            if(cost <= B) {
                best = mid;
                l = mid+1;
                mid = (l+r)/2;
            }
            else {
                r = mid-1;
                mid = (l+r)/2;
            }
        }
 
        ans = max(ans, best-i+1LL);
 
    }
 
    return ans;
}

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