답안 #880468

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
880468	2023-11-29T13:09:39 Z	andro	쌀 창고 (IOI11_ricehub)	C++14	42 / 100	1000 ms	728 KB

ricehub

#include <bits/stdc++.h>
#include "ricehub.h"
using namespace std;
int besthub(int R, int L, int X[], long long B){
    int ans=1;
    for(int i=1;i<=R;i++){
        vector<int>v;
        for(int j=1;j<=R;j++)v.push_back(abs(X[i]-X[j]));
        sort(v.begin(),v.end());
        long long c=0;
        int u=0;
        for(auto it:v){
            c+=it;
            if(c>B)break;
            u++;
        }
        ans=max(ans,u);
    }
    return ans;
}/*
signed main(){
    int X[4]={0,10,12,14};
    cout<<besthub(3,14,X,6);
}*/
/*
1 3
2 3
3 3
3
*/

Subtask #1

17.0 / 17.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	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct

Subtask #2

25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	1 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
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	1 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 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	1 ms	348 KB	Output is correct
16	Correct	0 ms	344 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	1 ms	452 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	3 ms	348 KB	Output is correct
22	Correct	3 ms	348 KB	Output is correct
23	Correct	7 ms	444 KB	Output is correct
24	Correct	7 ms	344 KB	Output is correct
25	Correct	7 ms	344 KB	Output is correct
26	Correct	7 ms	452 KB	Output is correct
27	Correct	7 ms	344 KB	Output is correct
28	Correct	7 ms	348 KB	Output is correct

Subtask #3

0 / 26.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	24 ms	456 KB	Output is correct
4	Correct	27 ms	596 KB	Output is correct
5	Correct	3 ms	348 KB	Output is correct
6	Correct	3 ms	348 KB	Output is correct
7	Correct	15 ms	460 KB	Output is correct
8	Correct	15 ms	348 KB	Output is correct
9	Correct	6 ms	348 KB	Output is correct
10	Correct	6 ms	452 KB	Output is correct
11	Correct	19 ms	348 KB	Output is correct
12	Correct	22 ms	348 KB	Output is correct
13	Correct	32 ms	348 KB	Output is correct
14	Correct	32 ms	348 KB	Output is correct
15	Correct	6 ms	348 KB	Output is correct
16	Correct	6 ms	348 KB	Output is correct
17	Correct	18 ms	348 KB	Output is correct
18	Correct	18 ms	348 KB	Output is correct
19	Correct	31 ms	344 KB	Output is correct
20	Correct	31 ms	344 KB	Output is correct
21	Correct	608 ms	524 KB	Output is correct
22	Correct	592 ms	596 KB	Output is correct
23	Execution timed out	1047 ms	344 KB	Time limit exceeded
24	Halted	0 ms	0 KB	-

Subtask #4

0 / 32.0

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