oj.uz

Submission #224528

# Submission time Handle Problem Language Result Execution time Memory
224528 2020-04-18T10:29:19 Z T0p_ Rice Hub (IOI11_ricehub) C++14
0 / 100
 9 ms 512 KB 
#include <bits/stdc++.h>
#include "ricehub.h"
using namespace std;

int besthub(int R, int L, int X[], long long B)
{
	int ans = 0;
	for(int i=0 ; i<R ; i++)
	{
		long long temp = B;
		int now = 1, j = i+1;
		while(j < R)
		{
			if(temp < X[j] - X[i]) break ;
			temp -= X[j] - X[i];
			j++;
			now++;
		}
		ans = max(ans, now);

	}
	return ans;
}

Subtask #1
0 / 17.0

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

Subtask #2
0 / 25.0

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

Subtask #3
0 / 26.0

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

Subtask #4
0 / 32.0

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