Submission #655212

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
655212	2022-11-03T14:46:39 Z	PanTkd	Rice Hub (IOI11_ricehub)	C++14	42 / 100	1000 ms	424 KB

ricehub

#include "ricehub.h"
#include <iostream>
#include <cmath>
typedef long long ll;
using namespace std;
int besthub(int R, int L, int X[], long long B)
{
  for(ll i = R;i>=1;i--){
    for(ll j = 0;j<=R-i;j++){
      ll cost = 0;
      ll med = (i)/2+j;
      for(ll k = j ;k<j+i;k++){
        cost+= abs(X[med]-X[k]);
      }
      if(cost<=B)
        return i;
    }
  }
  return 1;
}

Subtask #1

17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	312 KB	Output is correct

Subtask #2

25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	308 KB	Output is correct
13	Correct	1 ms	316 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	17 ms	308 KB	Output is correct
22	Correct	17 ms	308 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	2 ms	212 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	9 ms	308 KB	Output is correct
28	Correct	9 ms	212 KB	Output is correct

Subtask #3

0 / 26.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	18 ms	312 KB	Output is correct
6	Correct	17 ms	308 KB	Output is correct
7	Correct	136 ms	300 KB	Output is correct
8	Correct	138 ms	424 KB	Output is correct
9	Correct	16 ms	312 KB	Output is correct
10	Correct	17 ms	312 KB	Output is correct
11	Correct	83 ms	300 KB	Output is correct
12	Correct	70 ms	300 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	11 ms	312 KB	Output is correct
16	Correct	14 ms	304 KB	Output is correct
17	Correct	1 ms	316 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	316 KB	Output is correct
20	Correct	1 ms	320 KB	Output is correct
21	Execution timed out	1079 ms	324 KB	Time limit exceeded
22	Halted	0 ms	0 KB	-

Subtask #4

0 / 32.0

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