oj.uz

답안 #111806

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
111806 2019-05-16T08:20:53 Z Mercenary 쌀 창고 (IOI11_ricehub) C++14
0 / 100
 6 ms 384 KB 
#include "ricehub.h"
#include<bits/stdc++.h>

using namespace std;
typedef long long ll;

bool Chk(int X[] , int R , ll B , int ask){
    int l = 0 , h = ask - 1;
    ll sum = 0;
    ll suml = 0;
    for(int i = 0 ; i < ask ; ++i){
        sum += X[i];
        if(i <= (l + h) / 2)suml += X[i];
    }
    while(true){
        if(((ask + 1) / 2) * (ll)X[(l + h) / 2] - suml + sum - suml - (ask / 2) * (ll)X[(l + h) / 2] <= B)return 1;
        if(h == R - 1)break;
        sum += -X[l] + X[h + 1];
        suml += -X[l] + X[(l + h) / 2 + 1];
        ++l;++h;
    }
    return 0;
}

int besthub(int R, int L, int X[], long long B)
{
    int l = 1;
    int h = R;
    while(l <= h){
        ll mid = l + h >> 1;
        if(Chk(X , R , B , mid))l = mid + 1;
        else h = mid - 1;
    }
    cerr << Chk(X,R,B,1);
    return h;
}

Compilation message

ricehub.cpp: In function 'int besthub(int, int, int*, long long int)':
ricehub.cpp:30:20: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
         ll mid = l + h >> 1;
                  ~~^~~

Subtask #1
0 / 17.0

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

Subtask #2
0 / 25.0

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

Subtask #3
0 / 26.0

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

Subtask #4
0 / 32.0

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