oj.uz

Submission #61007

# Submission time Handle Problem Language Result Execution time Memory
61007 2018-07-25T05:50:28 Z nvmdava Rice Hub (IOI11_ricehub) C++17
0 / 100
 115 ms 612 KB 
#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;


bool price(int X[], int l,int r, long long B){
	
	int i;
	long long p = 0;
	int m = (r + l) / 2;
	for(i = l; i <m ; i++){
		p +=(long long)(X[m] - X[l]);
	}
	for(i = m + 1; i <=r ; i++){
		p +=(long long)(X[i] - X[m]);
	}
	if(p <= B){
		return 1;
	} else {
		return 0;
	}
}

int besthub(int n, int L, int X[], long long B)
{
	int l = 0, r = 0, m,dif = -1,i;
	for(i = 0; i < n;i++){
		l = i; r = n;
		while(l + 1!= r){
			m = (l+r) / 2;
			if(price(X,i,m,B) == 1){
				l = m;
			} else {
				r = m;
			}
		}
		dif = max(dif , r - i);
	}
	return dif;
}

Subtask #1
0 / 17.0

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

Subtask #2
0 / 25.0

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

Subtask #3
0 / 26.0

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

Subtask #4
0 / 32.0

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