Submission #28919

#	Time	Username	Problem	Language	Result	Execution time	Memory
28919		ozaslan	Rice Hub (IOI11_ricehub)	C++14	100 / 100	23 ms	5924 KiB

ricehub

#include "ricehub.h"
#include<bits/stdc++.h>

#include "ricehub.h"
#include <stdio.h>
#include <stdlib.h>

#define MAX_R  1000000

using namespace std;

/*static int R, L;
static long long B;
static int X[MAX_R];
static int solution;

inline
void my_assert(int e) {if (!e) abort();}

static void read_input()
{
  int i;
  my_assert(3==scanf("%d %d %lld",&R,&L,&B));
  for(i=0; i<R; i++)
    my_assert(1==scanf("%d",&X[i]));
  my_assert(1==scanf("%d",&solution));
}

int main()
{
    freopen("grader.in.1", "r", stdin);
  int ans;
  read_input();
  ans = besthub(R,L,X,B);
  if(ans==solution)
    printf("Correct.\n");
  else
    printf("Incorrect.  Returned %d instead of %d.\n",ans,solution);

  return 0;
}*/

int besthub(int R, int L, int X[], long long B)
{
    int enIyi = 0, k = 1;

    int sag = 0, sol = 0;
    long long toplam = 0;

    while(1) {
        int orta = (sol + sag + 1) / 2;

        if(toplam > B) {
            toplam -= (X[orta] - X[sol]);
            sol++;
            k--;
        }

        else if(sag < R-1){
            enIyi = max(k, enIyi);
            k++;
            sag++;
            toplam += (X[sag] - X[orta]);
        }
        else break;
    }

    enIyi = max(k, enIyi);

	return enIyi;
}

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