oj.uz

답안 #388076

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
388076 2021-04-09T21:56:16 Z Pichon5 쌀 창고 (IOI11_ricehub) C++17
0 / 100
 4 ms 536 KB 
#include "ricehub.h"
#include <bits/stdc++.h>
#define vi vector<int>
#define pb push_back
#define ll long long int
using namespace std;
int besthub(int R, int L, int X[], long long B)
{
    int res=0;
    ll pref[R];
    pref[0]=X[0];
    for(int i=1;i<R;i++){
        pref[i]=pref[i-1]+X[i];
    }
    for(ll i=0;i<R;i++){
        ll b=i,e=R-1;
        while(b<=e){
            ll mid=(b+e)/2;
            ll MID=(i+mid)/2;
            ll aux=pref[mid];
            aux-=pref[MID];
            aux-=(mid-MID)*X[MID];
            if(MID!=i){
                aux+=(MID-i+1)*X[MID];
                aux-=pref[MID-1];
                if(i)aux+=pref[i-1];
            }
            if(aux<=B){
                res=max(res,int(mid-i+1));
                b=mid+1;
            }else{
                e=mid-1;
            }
        }
    }
    return res;
}

Subtask #1
0 / 17.0

# 결과 실행 시간 메모리 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 #2
0 / 25.0

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

Subtask #3
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 536 KB Output isn't correct
2 Halted 0 ms 0 KB -