oj.uz

Submission #563308

# Submission time Handle Problem Language Result Execution time Memory
563308 2022-05-16T20:44:42 Z 1ne Rice Hub (IOI11_ricehub) C++14
0 / 100
 2 ms 596 KB 
#include "ricehub.h"
#include<bits/stdc++.h>
using namespace std;
int besthub(int R, int L, int X[], long long B)
{
  int ans = 0;
  vector<int64_t>pref(R + 1,0),dpref(R + 1,0);
  for (int i = 0 ;i<R - 1;++i){
	  pref[i + 1] = pref[i] + (X[i + 1] - X[i]);
	  dpref[i + 2] = pref[i + 1] + dpref[i + 1];
  }
  //for (int i = 0;i<R;++i)cout<<dpref[i]<<" ";
  //cout<<'\n';
  //1 3 18 - 
  auto dist = [&](int l,int r){
	 return pref[r] * (r - l) - dpref[r] + dpref[l]<=B;
  };
  int l = 0,r = 0;
  while(l<=r && r < R){
	  if (r + 1 < R && dist(l,r + 1)){
		  ++r;
	  } 
	  else if (l + 1<=r) {
		  ++l;
	  }
	  else {
		l++;
		r = l;
	  }
	  ans = max(ans,r - l + 1);
  }
  return ans;
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Incorrect 1 ms 264 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 596 KB Output isn't correct
2 Halted 0 ms 0 KB -