oj.uz

Submission #880543

# Submission time Handle Problem Language Result Execution time Memory
880543 2023-11-29T16:01:48 Z andro Rice Hub (IOI11_ricehub) C++14
42 / 100
 1000 ms 1072 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<=R;i++){
        vector<int>v;
        for(int j=1;j<=R;j++)v.push_back(abs(X[i]-X[j]));
        long long l=0,r=10005,p=0;
        while(l<=r){
            int mid=(l+r)/2;
            long long c=0;
            for(auto it:v){
                if(it<=mid)c+=it;
            }
            if(c<=B){
                l=mid+1;
                p=mid;
            }
            else {
                r=mid-1;
            }
        }
        int u=0;
        long long c=0;
        for(int j=1;j<=R;j++){
            if(abs(X[i]-X[j])<=p)c+=abs(X[i]-X[j]);
            if(abs(X[i]-X[j])<=p)u++;
        }
        for(int j=1;j<=R;j++){
            if(abs(X[i]-X[j])==p+1){
                c+=abs(X[i]-X[j]);
                if(c<=B)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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 0 ms 448 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 1 ms 344 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 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 452 KB Output is correct
21 Correct 4 ms 348 KB Output is correct
22 Correct 4 ms 348 KB Output is correct
23 Correct 4 ms 348 KB Output is correct
24 Correct 4 ms 448 KB Output is correct
25 Correct 4 ms 348 KB Output is correct
26 Correct 4 ms 348 KB Output is correct
27 Correct 4 ms 348 KB Output is correct
28 Correct 4 ms 348 KB Output is correct

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Incorrect 12 ms 464 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1010 ms 1072 KB Time limit exceeded
2 Halted 0 ms 0 KB -