oj.uz

답안 #563310

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
563310 2022-05-16T20:47:56 Z 1ne 쌀 창고 (IOI11_ricehub) C++14
0 / 100
 172 ms 700 KB 
//#include "ricehub.h"
#include<bits/stdc++.h>
using namespace std;
int besthub(int R, int L, int X[], long long B)
{
  int ans = 1;
  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;
  };
  for (int i = 0;i<R;++i){
	 for (int j = i + 1;j<R;++j){
		if (dist(i,j))ans = max(ans,j - i + 1);
		//cout<<i<<" "<<j<<" "<<dist(i,j)<<'\n';
	}
  }	
  return ans;
}

Subtask #1
0 / 17.0

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 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 0 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 172 ms 700 KB Output isn't correct
2 Halted 0 ms 0 KB -