답안 #259475

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
259475	2020-08-07T21:58:20 Z	amiratou	쌀 창고 (IOI11_ricehub)	C++14	68 / 100	1000 ms	640 KB

ricehub

#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
ll d[100005];

int besthub(int R, int L, int X[], long long B)
{
	int ans=1;
	for (int i = 0; i < R; ++i)
	{
		for (int j = 0; j < R; ++j)
			d[j]=abs(X[j]-X[i]);
		sort(d,d+R);
		ll rem=B;
		int cnt=0;
		for (int j = 0; j < R; ++j)
		{
			if(d[j]>rem)break;
			else rem-=d[j],cnt++;
		}
		ans=max(ans,cnt);
	}
	return ans;
}

Subtask #1

17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct

Subtask #2

25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	0 ms	384 KB	Output is correct
11	Correct	0 ms	384 KB	Output is correct
12	Correct	0 ms	384 KB	Output is correct
13	Correct	0 ms	384 KB	Output is correct
14	Correct	0 ms	384 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	0 ms	384 KB	Output is correct
18	Correct	1 ms	384 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Correct	1 ms	384 KB	Output is correct
21	Correct	3 ms	384 KB	Output is correct
22	Correct	3 ms	384 KB	Output is correct
23	Correct	9 ms	384 KB	Output is correct
24	Correct	6 ms	384 KB	Output is correct
25	Correct	6 ms	384 KB	Output is correct
26	Correct	6 ms	384 KB	Output is correct
27	Correct	6 ms	512 KB	Output is correct
28	Correct	5 ms	384 KB	Output is correct

Subtask #3

26.0 / 26.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	1 ms	396 KB	Output is correct
3	Correct	19 ms	384 KB	Output is correct
4	Correct	18 ms	384 KB	Output is correct
5	Correct	3 ms	384 KB	Output is correct
6	Correct	3 ms	384 KB	Output is correct
7	Correct	19 ms	384 KB	Output is correct
8	Correct	13 ms	384 KB	Output is correct
9	Correct	8 ms	384 KB	Output is correct
10	Correct	6 ms	384 KB	Output is correct
11	Correct	21 ms	384 KB	Output is correct
12	Correct	15 ms	384 KB	Output is correct
13	Correct	24 ms	384 KB	Output is correct
14	Correct	24 ms	384 KB	Output is correct
15	Correct	6 ms	384 KB	Output is correct
16	Correct	6 ms	384 KB	Output is correct
17	Correct	14 ms	384 KB	Output is correct
18	Correct	15 ms	384 KB	Output is correct
19	Correct	24 ms	384 KB	Output is correct
20	Correct	23 ms	384 KB	Output is correct
21	Correct	385 ms	456 KB	Output is correct
22	Correct	388 ms	504 KB	Output is correct
23	Correct	812 ms	504 KB	Output is correct
24	Correct	811 ms	504 KB	Output is correct
25	Correct	760 ms	504 KB	Output is correct
26	Correct	759 ms	472 KB	Output is correct
27	Correct	686 ms	384 KB	Output is correct
28	Correct	700 ms	504 KB	Output is correct

Subtask #4

0 / 32.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	1084 ms	640 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-