답안 #1013259

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1013259	2024-07-03T10:49:21 Z	Muhammet	쌀 창고 (IOI11_ricehub)	C++17	0 / 100	27 ms	4312 KB

ricehub

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

#define sz(s) (int)s.size()

using namespace std;

#define ll long long 

int besthub(int n, int L, int a[], ll b){
    int ind = n/2;
    vector <int> v;
    for(int i = 0; i < n; i++){
        v.push_back(abs(a[i]-a[ind]));
    }
    sort(v.rbegin(), v.rend());
    int ans = 0;
    while(sz(v) > 0){
        if(v.back() > b) break;
        b -= v.back();
        v.pop_back();
        ans++;
    }
    return ans;
}

Subtask #1

0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Incorrect	0 ms	348 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #2

0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	444 KB	Output is correct
4	Correct	0 ms	448 KB	Output is correct
5	Correct	0 ms	348 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	344 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	448 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	448 KB	Output is correct
18	Correct	0 ms	344 KB	Output is correct
19	Incorrect	0 ms	344 KB	Output isn't correct
20	Halted	0 ms	0 KB	-

Subtask #3

0 / 26.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	1 ms	444 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	344 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	0 ms	344 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	1 ms	344 KB	Output is correct
14	Correct	1 ms	344 KB	Output is correct
15	Incorrect	0 ms	348 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #4

0 / 32.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	860 KB	Output is correct
2	Correct	3 ms	716 KB	Output is correct
3	Correct	16 ms	4308 KB	Output is correct
4	Correct	16 ms	4312 KB	Output is correct
5	Correct	5 ms	3288 KB	Output is correct
6	Correct	5 ms	3280 KB	Output is correct
7	Correct	12 ms	4048 KB	Output is correct
8	Correct	12 ms	4056 KB	Output is correct
9	Correct	6 ms	3256 KB	Output is correct
10	Correct	6 ms	3344 KB	Output is correct
11	Correct	16 ms	4264 KB	Output is correct
12	Correct	27 ms	4248 KB	Output is correct
13	Incorrect	7 ms	3420 KB	Output isn't correct
14	Halted	0 ms	0 KB	-