제출 #355592

#제출 시각아이디문제언어결과실행 시간메모리
355592David_M쌀 창고 (IOI11_ricehub)C++14
100 / 100
17 ms3308 KiB
#include "ricehub.h" #include<bits/stdc++.h> #define ll long long using namespace std; const int N=100005; ll ans, pref[N], l, r, m, bb, x[N]; bool check(){ m=l+r>>1; ll b=pref[r]+(l>0)*pref[l-1]-(m>0)*2*pref[m]; if((l+r)%2==0) b+=x[m]; return b<=bb; } int besthub(int R,int L,int X[],ll B){ bb=B; for (int i=0; i<R; i++)x[i]=X[i],pref[i]=X[i]+(i>0)*pref[i-1]; for (r=0; r<R; r++){ while(l<r&&!check())l++; ans=max(ans, r-l+1); } return ans; }

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

ricehub.cpp: In function 'bool check()':
ricehub.cpp:8:5: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
    8 |  m=l+r>>1;
      |    ~^~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...