oj.uz

Submission #410782

# Submission time Handle Problem Language Result Execution time Memory
410782 2021-05-23T17:57:14 Z LouayFarah Rice Hub (IOI11_ricehub) C++14
0 / 100
 15 ms 1740 KB 
#include <bits/stdc++.h>
#include "ricehub.h"
using namespace std;
 
 
int besthub(int R, int L, int X[], long long B)
{
    if(R==1)
        return 1;
    int mediane = X[R/2];
    int l =  R/2-1, r = R/2+1;
    int res = 1;
    while((r<R||l>=0)&&(B>=0))
    {
        if(l<0)
        {
            res++;
            B-=abs(mediane-X[r]);
            r++;
        }
        else if(r==R)
        {
            res++;
            B-=abs(mediane-X[l]);
            l--;
        }
        else if(abs(X[l]-mediane)<=abs(X[r]-mediane))
        {
            res++;
            B-=abs(mediane-X[l]);
            l--;
        }
        else if(abs(X[l]-mediane)>abs(X[r]-mediane))
        {
            res++;
            B-=abs(mediane-X[r]);
            r++;
        }
    }
    return res-1;
}

Subtask #1
0 / 17.0

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

Subtask #2
0 / 25.0

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

Subtask #3
0 / 26.0

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

Subtask #4
0 / 32.0

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