oj.uz

Submission #580855

# Submission time Handle Problem Language Result Execution time Memory
580855 2022-06-22T02:20:37 Z benson1029 Rice Hub (IOI11_ricehub) C++14
0 / 100
 3 ms 456 KB 
#include "ricehub.h"
#include<bits/stdc++.h>
using namespace std;

long long sum = 0;

int besthub(int R, int L, int X[], long long B)
{
	sort(X, X+R);
	int ptr = 0;
	int ans = 0;
	for(int i=0; i<R; i++) {
		if(ptr < i) {
			ptr = i;
			sum = 0;
		}
		while(ptr<R-1 && sum - X[(i+ptr+1)/2] + X[ptr+1] <= B) {
			ptr++;
			sum = sum - X[(i+ptr+1)/2] + X[ptr+1];
		}
		ans = max(ans, ptr-i+1);
		sum = sum + X[i] - X[(i+ptr)/2];
	}
	return ans;
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 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 316 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Incorrect 1 ms 212 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

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

Subtask #4
0 / 32.0

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