제출 #556301

#제출 시각아이디문제언어결과실행 시간메모리
556301Dan4Life쌀 창고 (IOI11_ricehub)C++17
68 / 100
14 ms1424 KiB
#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long

ll pref[100010];

ll sum(int i, int j){ return pref[j+1]-pref[i]; }

int besthub(int n, int m, int a[], ll k)
{
    /*
    for(int i = 0; i < n; i++){
        int j = i;
        while(i<n and a[i]==a[i+1]) i++;
        v.pb({a[j],j-i+1});
    }
    n = (int)v.size();*/
    pref[0] = 0;
    for(int i = 0; i < n; i++)
        pref[i+1] = pref[i]+(ll)a[i];//v[i].second;
    int l = 1, r = n;
    while(l<r){
        int mid = (l+r+1)/2; ll mn = (ll)4e18;
        for(int i = 0; i <= n-mid; i++){
            int j = i+mid-1; int med = (i+j)/2; int x = med;
            ll sum1 = (ll)a[med]*(med-i+1)-sum(i,med);
            ll sum2 = sum(med+1,j)-a[med]*(j-med);
            mn = min(mn, sum1+sum2);
        }
        if(mn<=k) l=mid;
        else r = mid-1;
    }
    return l;
}

컴파일 시 표준 에러 (stderr) 메시지

ricehub.cpp: In function 'int besthub(int, int, int*, long long int)':
ricehub.cpp:26:53: warning: unused variable 'x' [-Wunused-variable]
   26 |             int j = i+mid-1; int med = (i+j)/2; int x = med;
      |                                                     ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...