제출 #744079

#제출 시각아이디문제언어결과실행 시간메모리
744079vjudge1쌀 창고 (IOI11_ricehub)C++17
0 / 100
3 ms596 KiB
#include "ricehub.h"

int besthub(int R, int L, int X[], long long B)
{
    long long qs[R+1];
    qs[0] = 0;
    long long ans;
    for(int i=1;i<=R;++i)
    {
        qs[i] = qs[i-1]+X[i-1];
    }
    long long l = 1,r = R;
    while(l <= r)
    {
        long long mid = (l+r)/2;
        bool can = false;
        for(int med = (mid+1)/2;med <= r-mid/2;++med)
        {
            long long sumLeft = qs[med-(med%2==1)]-qs[med-mid/2+(med%2==0)];
            long long sumRight = qs[med+mid/2]-qs[med+1];
            long long cost = sumRight - sumLeft;
            if(cost <= B)
            {
                can = true;
                break;
            }
        }
        if(can)
        {
            ans = mid;
            l = mid+1;
        }
        else r = mid-1;
    }
    return ans;
}

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

ricehub.cpp: In function 'int besthub(int, int, int*, long long int)':
ricehub.cpp:35:12: warning: 'ans' may be used uninitialized in this function [-Wmaybe-uninitialized]
   35 |     return ans;
      |            ^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...