oj.uz

답안 #880457

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
880457 2023-11-29T12:59:35 Z andro 쌀 창고 (IOI11_ricehub) C++14
17 / 100
 1000 ms 600 KB 
#include <bits/stdc++.h>
#include "ricehub.h"
//#define int long long
using namespace std;
int besthub(int R, int L, int X[], long long B){
    int ans=1;
    for(int i=1;i<=R;i++){
        //od desno kolko ih ima u [X[i],X[i]+mid]
        // od levo [X[i]-mid,X[i]]
        int l=0,r=10000,p=-1;
        while(l<=r){
            int mid=(l+r)/2;
            int c=0;
            for(int j=1;j<=R;j++){
                if(abs(X[i]-X[j])<=mid)c+=abs(X[i]-X[j]);
            }
            if(c<=B){
                l=mid+1;
                p=mid;
            }
            else {
                r=mid-1;
            }
        }
        int u=0;
        for(int j=1;j<=R;j++){
            if(abs(X[i]-X[j])<=p)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
0 / 25.0

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

Subtask #3
0 / 26.0

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

Subtask #4
0 / 32.0

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