제출 #94654

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
94654	2019-01-22 06:47:13	andy627	쌀 창고 (IOI11_ricehub)	C++17	100 / 100	220 ms	2680 KiB

ricehub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <stdio.h>
#include <algorithm>
#define LL long long
using namespace std;
LL sum[111111];
int besthub(int R,int L,int X[],LL B){
  sum[0]=X[0];
  for(int i=1;i<R;i++) sum[i]=sum[i-1]+X[i];
  int ans=0;
  for(int i=0;i<R;i++){
    int s=1,e=L,m;
    while(s<=e){
      m=(s+e)>>1;
      int sidx=lower_bound(X,X+R,X[i]-m)-X;
      int eidx=upper_bound(X,X+R,X[i]+m)-X-1;
      if((sum[eidx]-sum[i])-(LL)X[i]*(eidx-i)+(LL)X[i]*(i-sidx)-((!i?0:sum[i-1])-(!sidx?0:sum[sidx-1]))<=B) s=m+1;
      else e=m-1;
    }
    int sidx=lower_bound(X,X+R,X[i]-e)-X;
    int eidx=upper_bound(X,X+R,X[i]+e)-X-1;
    int sidx2=lower_bound(X,X+R,X[i]-s)-X;
    int eidx2=upper_bound(X,X+R,X[i]+s)-X-1;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 17 / 17
• Subtask 2: 25 / 25
• Subtask 3: 26 / 26
• Subtask 4: 32 / 32