oj.uz

답안 #961789

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
961789 2024-04-12T12:52:55 Z hirayuu_oj 쌀 창고 (IOI11_ricehub) C++17
0 / 100
 2 ms 860 KB 
#include "ricehub.h"
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(x) x.begin(),x.end()
using ll=long long;
const ll INF=1LL<<60;

int besthub(int R, int L, int X[], long long B){
    vector<ll> cum(R+1,0);
    vector<ll> x(R);
    rep(i,R){
        x[i]=X[i];
        cum[i+1]=cum[i]+x[i];
    }
    ll ok=1,ng=R+1;
    while(ng-ok>1){
        ll mid=(ok+ng)>>1;
        ll half=mid>>1;
        bool can=0;
        rep(i,R-mid+1){
            ll lf=cum[i+half]-cum[i];
            ll ri=cum[i+mid]-cum[i+half];
            ll rs=0;
            if(mid&1)rs-=R;
            if(rs+ri-lf<=B){
                can=1;
            }
        }
        if(can)ok=mid;
        else ng=mid;
    }
    return ok;
}

Subtask #1
0 / 17.0

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

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 448 KB Output is correct
2 Correct 1 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 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Incorrect 0 ms 348 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

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