oj.uz

Submission #224672

# Submission time Handle Problem Language Result Execution time Memory
224672 2020-04-18T14:45:14 Z Amy313 Rice Hub (IOI11_ricehub) C++14
42 / 100
 1000 ms 640 KB 
#include "ricehub.h"
#include<bits/stdc++.h>
using namespace std;
int besthub(int R, int L, int X[], long long B)
{vector<int>V;
	int maxi= 0, c, a;
	long long cp = B;
	for(int i=1; i<=L; i++)
	{
		c = 0;
		cp = B;	
		V.clear();
		for(int j=0; j<R; j++)
		{
			a = abs(i-X[j]);
			V.push_back(a);
		}
		sort(V.begin(), V.end());
		for(int j=0; j<V.size(); j++)
		{
			if(V[j]<=cp)
			{
				cp-=V[j];
				c++;
			}
			else
			{
				break;
			}
		}
		if(c>maxi)
		{
			maxi = c;
		}
	}
  return maxi;
}

Compilation message

ricehub.cpp: In function 'int besthub(int, int, int*, long long int)':
ricehub.cpp:19:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int j=0; j<V.size(); j++)
                ~^~~~~~~~~

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 256 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 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 6 ms 256 KB Output is correct
6 Correct 6 ms 256 KB Output is correct
7 Correct 6 ms 384 KB Output is correct
8 Correct 6 ms 256 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 256 KB Output is correct
11 Correct 5 ms 256 KB Output is correct
12 Correct 5 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 7 ms 256 KB Output is correct
17 Correct 5 ms 256 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 6 ms 256 KB Output is correct
20 Correct 6 ms 256 KB Output is correct
21 Correct 10 ms 384 KB Output is correct
22 Correct 12 ms 384 KB Output is correct
23 Correct 111 ms 376 KB Output is correct
24 Correct 110 ms 256 KB Output is correct
25 Correct 103 ms 376 KB Output is correct
26 Correct 102 ms 384 KB Output is correct
27 Correct 85 ms 256 KB Output is correct
28 Correct 91 ms 376 KB Output is correct

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 256 KB Output is correct
2 Correct 27 ms 384 KB Output is correct
3 Execution timed out 1094 ms 384 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1069 ms 640 KB Time limit exceeded
2 Halted 0 ms 0 KB -