oj.uz

Submission #228559

# Submission time Handle Problem Language Result Execution time Memory
228559 2020-05-01T13:14:47 Z tushar_2658 Rice Hub (IOI11_ricehub) C++14
68 / 100
 1000 ms 2560 KB 
#include "ricehub.h"
#include "bits/stdc++.h"
using namespace std;

const int maxn = 100005;
using ll = long long;

ll a[maxn], lim;
int n;

bool can(int x){
	ll ret = LLONG_MAX;
	for(int i = x; i <= n; ++i){
		int l = i - x + 1;
		ll mid = (l + (x / 2));
		ll need = 0;
		for(int j = l; j <= i; ++j){
			need += llabs(a[j] - a[mid]);
		}
		ret = min(ret, need);
	}
	if(ret <= lim)return 1;
	else return 0;
}

int besthub(int R, int L, int X[], long long B)
{
	lim = B;
	n = R;
	for(int i = 1; i <= R; ++i){
		a[i] = X[i - 1];
	}
	sort(a + 1, a + n + 1);
	int lo = 1, hi = R, ans = 1;
	while(lo <= hi){
		int mid = (lo + hi) >> 1;
		if(can(mid)){
			ans = mid;
			lo = mid + 1;
		}else {
			hi = mid - 1;
		}
	}
	return ans;
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 4 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 512 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 5 ms 436 KB Output is correct

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 6 ms 384 KB Output is correct
8 Correct 6 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 6 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 6 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 6 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 29 ms 384 KB Output is correct
22 Correct 29 ms 384 KB Output is correct
23 Correct 22 ms 512 KB Output is correct
24 Correct 22 ms 384 KB Output is correct
25 Correct 22 ms 384 KB Output is correct
26 Correct 22 ms 384 KB Output is correct
27 Correct 73 ms 384 KB Output is correct
28 Correct 73 ms 504 KB Output is correct

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 294 ms 760 KB Output is correct
2 Correct 293 ms 740 KB Output is correct
3 Execution timed out 1092 ms 2560 KB Time limit exceeded
4 Halted 0 ms 0 KB -