답안 #805153

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
805153	2023-08-03T13:29:22 Z	Kerim	쌀 창고 (IOI11_ricehub)	C++17	68 / 100	1000 ms	612 KB

ricehub

#include "ricehub.h"
#include "bits/stdc++.h"
#define ll long long

using namespace std;


int besthub(int R, int L, int X[], long long B){
    int answer = 0;
    for (int i = 0; i < R; i++){
        int x = X[i];
        vector<int> dist;
        for (int j = 0; j < R; j++)
            dist.push_back(abs(X[j] - x));
        sort(dist.begin(), dist.end());
        ll budget = 0;
        int count = 0;
        for (auto x: dist){
            budget += x;
            if (budget > B)
                break;
            count += 1;
        }
        answer = max(answer, count);
    }
    return answer;
}

Subtask #1

17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 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	0 ms	212 KB	Output is correct

Subtask #2

25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	240 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 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	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	2 ms	212 KB	Output is correct
22	Correct	3 ms	212 KB	Output is correct
23	Correct	5 ms	212 KB	Output is correct
24	Correct	5 ms	212 KB	Output is correct
25	Correct	6 ms	212 KB	Output is correct
26	Correct	4 ms	212 KB	Output is correct
27	Correct	4 ms	212 KB	Output is correct
28	Correct	4 ms	212 KB	Output is correct

Subtask #3

26.0 / 26.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	15 ms	308 KB	Output is correct
4	Correct	14 ms	212 KB	Output is correct
5	Correct	2 ms	212 KB	Output is correct
6	Correct	2 ms	212 KB	Output is correct
7	Correct	10 ms	320 KB	Output is correct
8	Correct	9 ms	324 KB	Output is correct
9	Correct	4 ms	312 KB	Output is correct
10	Correct	5 ms	212 KB	Output is correct
11	Correct	11 ms	324 KB	Output is correct
12	Correct	11 ms	212 KB	Output is correct
13	Correct	20 ms	340 KB	Output is correct
14	Correct	18 ms	328 KB	Output is correct
15	Correct	4 ms	316 KB	Output is correct
16	Correct	4 ms	212 KB	Output is correct
17	Correct	13 ms	212 KB	Output is correct
18	Correct	11 ms	324 KB	Output is correct
19	Correct	18 ms	212 KB	Output is correct
20	Correct	17 ms	324 KB	Output is correct
21	Correct	276 ms	396 KB	Output is correct
22	Correct	297 ms	400 KB	Output is correct
23	Correct	611 ms	396 KB	Output is correct
24	Correct	671 ms	392 KB	Output is correct
25	Correct	560 ms	404 KB	Output is correct
26	Correct	609 ms	340 KB	Output is correct
27	Correct	507 ms	400 KB	Output is correct
28	Correct	522 ms	408 KB	Output is correct

Subtask #4

0 / 32.0

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