제출 #101106

#제출 시각아이디문제언어결과실행 시간메모리
101106ansol4328Rice Hub (IOI11_ricehub)C++11
0 / 100
5 ms384 KiB
#include<stdio.h>

bool pos(int del, int *m, long long B, int n)
{
    int cnt=n-del;
    int hcnt=cnt/2;
    long long d=0;
    for(int i=0 ; i<cnt/2 ; i++) d+=(long long)m[cnt-i+1]-m[i];
    if(d<=B) return true;
    for(int i=0 ; i<n-cnt ; i++)
    {
        int didx=i, aidx=i+cnt;
        d-=(long long)m[didx+hcnt]-m[didx];
        d+=(long long)m[aidx]-m[aidx-hcnt];
        if(d<=B) return true;
    }
    return false;
}

int besthub(int R, int L, int *X, long long B)
{
    int st=0, fn=R, mid, res;
    while(st<=fn)
    {
        mid=(st+fn)>>1;
        if(pos(mid,X,B,R)) fn=mid-1, res=mid;
        else st=mid+1;
    }
    return R-res;
}

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

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