oj.uz

Submission #383359

# Submission time Handle Problem Language Result Execution time Memory
383359 2021-03-29T18:02:44 Z Iwanttobreakfree Rice Hub (IOI11_ricehub) C++17
0 / 100
 4 ms 748 KB 
#include "ricehub.h"
#include <vector>
#include <algorithm>
using namespace std;
int besthub(int R, int L, int X[], long long B){
	vector<int> v(R);
	for(int i=0;i<R;i++)v[i]=X[i];
	sort(v.begin(),v.end());
	int l=0,r=R,maxi=0;
	while(l<=r){
		int mid=(r-l)/2+l;
		long long int i=mid+1,sum=0,c=0;
		while(i<R&&sum<B){
			sum+=v[i]-v[mid];
			i++;
			c++;
		}
		if(c>maxi){
			maxi=c;
			r=mid-1;
		}
		else l=mid+1;
	}
  return maxi;
}

Subtask #1
0 / 17.0

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

Subtask #2
0 / 25.0

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

Subtask #3
0 / 26.0

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

Subtask #4
0 / 32.0

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