답안 #1015778

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1015778	2024-07-06T18:51:53 Z	KasymK	쌀 창고 (IOI11_ricehub)	C++17	68 / 100	1000 ms	740 KB

ricehub

#include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define ll long long
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
 
int besthub(int r, int l, int x[], ll b){
    int ans = 0;
    for(int k = 0; k < r; ++k){
        vector<int> v;
        for(int i = 0; i < r; ++i)
            v.pb(abs(x[k]-x[i]));
        sort(all(v));
        ll sm = 0;
        int cnt = 0;
        for(auto i : v){
            sm += i;
            if(sm > b)
                break;
            cnt++;
        }
        ans = max(ans, cnt);
    }
    return ans;
}
 
// const int N = 20;
// int a[N];
 
// int main(){
//     int r, l;
//     ll b;
//     r = 5, l = 20, b = 6;
//     a[0] = 1, a[1] = 2, a[2] = 10, a[3] = 12, a[4] = 14;
//     printf("%d\n", besthub(r, l, a, b));
//     return 0;
// }

Subtask #1

17.0 / 17.0

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

Subtask #2

25.0 / 25.0

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

Subtask #3

26.0 / 26.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	10 ms	456 KB	Output is correct
4	Correct	11 ms	344 KB	Output is correct
5	Correct	2 ms	348 KB	Output is correct
6	Correct	2 ms	448 KB	Output is correct
7	Correct	7 ms	456 KB	Output is correct
8	Correct	7 ms	348 KB	Output is correct
9	Correct	3 ms	444 KB	Output is correct
10	Correct	4 ms	448 KB	Output is correct
11	Correct	11 ms	600 KB	Output is correct
12	Correct	10 ms	456 KB	Output is correct
13	Correct	14 ms	456 KB	Output is correct
14	Correct	16 ms	348 KB	Output is correct
15	Correct	3 ms	348 KB	Output is correct
16	Correct	3 ms	348 KB	Output is correct
17	Correct	8 ms	348 KB	Output is correct
18	Correct	9 ms	348 KB	Output is correct
19	Correct	14 ms	456 KB	Output is correct
20	Correct	15 ms	456 KB	Output is correct
21	Correct	254 ms	496 KB	Output is correct
22	Correct	290 ms	348 KB	Output is correct
23	Correct	610 ms	496 KB	Output is correct
24	Correct	579 ms	348 KB	Output is correct
25	Correct	560 ms	492 KB	Output is correct
26	Correct	525 ms	344 KB	Output is correct
27	Correct	500 ms	496 KB	Output is correct
28	Correct	527 ms	500 KB	Output is correct

Subtask #4

0 / 32.0

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