제출 #133001

#제출 시각아이디문제언어결과실행 시간메모리
133001Boxworld쌀 창고 (IOI11_ricehub)C++14
0 / 100
499 ms54828 KiB
#include "ricehub.h" #include <bits/stdc++.h> using namespace std; const int maxN=100100; long long S[maxN]; int besthub(int R, int L, int X[], long long B){ for (int i=0;i<R;i++)S[i]=S[i-1]+X[i]; int l,r,ans=1; for (int l=0;l<R;l++) for (int r=l;r<R;r++){ int m=(l+r)/2,nL=l-1; long long cost=S[m]-S[l-1]-(m-l+1)*X[l]+S[r]-S[m]-(r-m)*X[m]; printf("l=%d r=%d m=%d cost=%lld\n",l,r,m,cost); if(cost<=B)ans=max(ans,r-l+1); else break; } return ans; }

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

ricehub.cpp: In function 'int besthub(int, int, int*, long long int)':
ricehub.cpp:11:17: warning: unused variable 'nL' [-Wunused-variable]
   int m=(l+r)/2,nL=l-1;
                 ^~
ricehub.cpp:8:6: warning: unused variable 'l' [-Wunused-variable]
  int l,r,ans=1;
      ^
ricehub.cpp:8:8: warning: unused variable 'r' [-Wunused-variable]
  int l,r,ans=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...