Submission #224664

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
224664	2020-04-18T14:38:07 Z	jhtan	Rice Hub (IOI11_ricehub)	C++14	42 / 100	1000 ms	908 KB

ricehub

#include "ricehub.h"
#include "bits/stdc++.h"

using namespace std;

int besthub(int R, int L, int X[], long long B)
{
  int mx = 0;
  
  for(int i=1; i<=L; i++) {
    int s = 0, c = 0;
    vector<int> V;
    for(int j=0; j<R; j++) V.push_back(abs(i-X[j]));
    sort(V.begin(), V.end());

    for(int j=0; j<R; j++) {
      if(s + V[j] <= B) {s += V[j]; c++;}
      else break;
    }

    mx = max(mx, c);
  }
  
  return mx;
}

Subtask #1

17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	256 KB	Output is correct
2	Correct	4 ms	256 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	4 ms	256 KB	Output is correct
2	Correct	4 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	7 ms	256 KB	Output is correct
6	Correct	6 ms	384 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	4 ms	256 KB	Output is correct
11	Correct	4 ms	384 KB	Output is correct
12	Correct	5 ms	512 KB	Output is correct
13	Correct	5 ms	384 KB	Output is correct
14	Correct	5 ms	256 KB	Output is correct
15	Correct	7 ms	256 KB	Output is correct
16	Correct	6 ms	256 KB	Output is correct
17	Correct	5 ms	256 KB	Output is correct
18	Correct	4 ms	256 KB	Output is correct
19	Correct	6 ms	256 KB	Output is correct
20	Correct	6 ms	256 KB	Output is correct
21	Correct	11 ms	256 KB	Output is correct
22	Correct	11 ms	256 KB	Output is correct
23	Correct	120 ms	376 KB	Output is correct
24	Correct	113 ms	256 KB	Output is correct
25	Correct	112 ms	368 KB	Output is correct
26	Correct	109 ms	256 KB	Output is correct
27	Correct	92 ms	256 KB	Output is correct
28	Correct	95 ms	504 KB	Output is correct

Subtask #3

0 / 26.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	34 ms	256 KB	Output is correct
2	Correct	34 ms	256 KB	Output is correct
3	Execution timed out	1085 ms	256 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	1091 ms	908 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-