oj.uz

Submission #809095

# Submission time Handle Problem Language Result Execution time Memory
809095 2023-08-05T17:01:30 Z annabeth9680 Rice Hub (IOI11_ricehub) C++17
0 / 100
 2 ms 340 KB 
#include <bits/stdc++.h>
#define ll long long
using namespace std;
vector<int> arr;
bool check(int val, int n, ll B){
    for(int i = 1;i<=n-val;++i){
        int r = i+val-1;
        int m = (i+r)/2;
        ll geld;
        if((r-i)%2 == 0){
            geld = (arr[r]-arr[m])-(arr[m]-arr[i-1]);
        }
        else{
            geld = (arr[r]-arr[m])-(arr[m-1]-arr[i-1]);
        }
        if(geld <= B) return true;
    }
    return false;
}
int besthub(int R, int L, int X[], ll B){
    arr.resize(R+1); arr[0] = 0;
    for(int i = 1;i<=R;++i){
        arr[i] = arr[i-1]+X[i-1];
    }
    int l = 0, r = R;
    while(l < r){
        //cout << l << " " << r << "\n";
        int mid = (l+r)/2;
        if(check(mid,R,B)){
            l = mid;
        }
        else{
            r = mid-1;
        }
    }
    return l;
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 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 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

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

Subtask #4
0 / 32.0

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