Submission #552404

#	Time	Username	Problem	Language	Result	Execution time	Memory
552404		Wasrek	Rice Hub (IOI11_ricehub)	C++14	0 / 100	2 ms	340 KiB

ricehub

#include<bits/stdc++.h>
// #include "grader.cpp"
#include "ricehub.h"
using namespace std;
int qs[100010];
int besthub(int R, int L, int X[], long long B)
{
  int now=0,temp,ans=1;
  for(int i=0, j=0;i<R && j<R;i++){
    if(i!=0) now-=X[(i+j)>>1]-X[i-1];
    if(j<i)j=i,now=0;
    temp=now;
    while(j<(R-1)){//move j
      temp+=(X[j+1]-X[(i+j+1)>>1]);
      // printf("%d %d %d\n",i,j+1,temp);
      if(temp<=B) j++;
      else break;
    }
    // printf("%d %d\n",i,j);
    ans=max(ans,j-i+1);
    if(j==R-1) break;
  }                        
  return ans;
}

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