제출 #1296044

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1296044		hssaan_arif	Rice Hub (IOI11_ricehub)	C++20	0 / 100	1 ms	784 KiB

ricehub

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

#define endl "\n"
#define pb push_back
#define ll long long
#define fi first
#define se second

const int N = 3e5 + 5, M = 1e9 + 7, LG = 20;

int R , A[N] , L , B;

int besthub(int n, int sz, int X[], long long b){
    int l=0 , r=n+1;
    while(l+1 < r){
        ll mid = (l+r)>>1 , cr = 1e18;

        for (int i=0 ; i<n-mid+1 ; i++){

            int l1 = X[i] , r1 = X[i+mid-1];
            if (mid&1){
                cr = min(cr , (ll)(r1-l1) * (mid/2));
            }else{
                cr = min(cr , (ll)(r1-l1)*((mid-2)/2) + (X[i+(mid/2)]-X[i+(mid/2)-1]));
            }
            
        }
        // cout << mid << ' ' << cr << endl;
        if (cr <= b){
            l = mid;
        }else{
            r = mid;
        }
    }
    return l;
}


// signed main(){
//     cin >> R >> L >> B;
//     for (int i=0 ; i<R ; i++){
//         cin >> A[i];
//     }
//     cout << besthub(R , L , A , B);
// }

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