oj.uz

Submission #516273

# Submission time Handle Problem Language Result Execution time Memory
516273 2022-01-21T01:29:24 Z Jesus Rice Hub (IOI11_ricehub) C++14
0 / 100
 3 ms 460 KB 
#include <iostream>
#include "ricehub.h"

using namespace std;

int besthub(int R, int L,int X[], long long int B){
    long long int izq=0, der=0, maxim=0;
    long long int costo=0;
    int i=0,j=0;
    int z=0;
    while(i<R){
        if(j==R-1||costo>B) {
                if(izq<der){
                    z=(i+j)/2;
                    costo-=X[z+1]-X[z-izq];
                    costo+=(X[z+1]-X[z])*(izq);
                    costo-=(X[z+1]-X[z])*(der);
                    izq++;
                    der--;

                }
                i++;
                izq--;
        }
        else{
            z=(i+j)/2;
            if(izq<der){
                costo+=X[z+1+der]-X[z+1];
                costo+=(X[z+1]-X[z])*izq;
                costo-=(X[z+1]-X[z])*(der-1);
                izq++;
                der--;
            }
            else{
                costo+=X[z+der+1]-X[z];
            }
            j++;
            der++;
        }
        if(costo<=B) maxim=max(maxim,der+izq+1);

    }
    return maxim;
}

Subtask #1
0 / 17.0

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

Subtask #2
0 / 25.0

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

Subtask #3
0 / 26.0

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

Subtask #4
0 / 32.0

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