Submission #672016

#TimeUsernameProblemLanguageResultExecution timeMemory
672016Hacv16쌀 창고 (IOI11_ricehub)C++17
43 / 100
1074 ms596 KiB
#include<bits/stdc++.h>
#include "ricehub.h"

using namespace std;

typedef long long ll;
const ll INF = 1e18;

int besthub(int n, int l, int x[], ll b){
	int ans = 1;

	for(int mid = 0; mid < n; mid++){
		int cnt = 1, l = mid - 1, r = mid + 1;
		ll av = b;
  	
  		while(av && (l >= 0 || r < n)){
  			ll dl = (l >= 0 ? x[mid] - x[l] : INF);
  			ll dr = (r <  n ? x[r] - x[mid] : INF);

  			if(av - min(dl, dr) < 0) break;
  			av -= min(dl, dr);

  			if(dl < dr) l--;
  			else r++;

  			cnt++;
  		}
  		
  		ans = max(ans, cnt);
	}

	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...