oj.uz

Submission #224648

# Submission time Handle Problem Language Result Execution time Memory
224648 2020-04-18T14:22:52 Z Amy313 Rice Hub (IOI11_ricehub) C++14
0 / 100
 39 ms 384 KB 
#include "ricehub.h"
#include<bits/stdc++.h>
int besthub(int R, int L, int X[], long long B)
{
	int maxi= -1, c, a;
	long long cp = B;
	for(int i=0; i<L; i++)
	{
		c = 0;
		cp = B;
		for(int j=0; j<R; j++)
		{
			a = abs(i-X[j]);
			if(a<=cp)
			{
				c++;
			}
			else
			{
				break;
			}
		}
		if(c>maxi)
		{
			maxi = c;
		}
	}
  return maxi;
}

Subtask #1
0 / 17.0

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

Subtask #4
0 / 32.0

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