oj.uz

답안 #880162

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
880162 2023-11-28T22:27:32 Z andro 쌀 창고 (IOI11_ricehub) C++14
42 / 100
 1000 ms 1180 KB 
#include <bits/stdc++.h>

//#include "ricehub.h"

using namespace std;
int besthub(int R, int L, int X[], long long B){
    int ans=0;
    for(int i=1;i<=L;i++){
        vector<int>v;
        for(int j=1;j<=R;j++){
            v.push_back(abs(X[j]-i));
        }
        sort(v.begin(),v.end());
        int u=0;
        int c=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);
}
*/

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 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 2 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 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 2 ms 448 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 8 ms 348 KB Output is correct
22 Correct 6 ms 348 KB Output is correct
23 Correct 105 ms 448 KB Output is correct
24 Correct 105 ms 348 KB Output is correct
25 Correct 103 ms 348 KB Output is correct
26 Correct 102 ms 344 KB Output is correct
27 Correct 112 ms 432 KB Output is correct
28 Correct 113 ms 348 KB Output is correct

Subtask #3
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 348 KB Output is correct
2 Correct 24 ms 348 KB Output is correct
3 Execution timed out 1090 ms 348 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

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