oj.uz

Submission #1013822

# Submission time Handle Problem Language Result Execution time Memory
1013822 2024-07-04T06:35:20 Z Muhammet Rice Hub (IOI11_ricehub) C++17
0 / 100
 2 ms 860 KB 
#include <bits/stdc++.h>
#include "ricehub.h"

#define sz(s) (int)s.size()

using namespace std;

#define ll long long 

vector <int> v;

bool f(int x, ll b, int n){
    ll k = 0, ind = x/2, in = x-1;
    for(int i = 0; i < in; i++){
        k += abs(v[ind]-v[i]);
    }
    while(in < n){
        k += abs(v[in]-v[ind]);
        if(k <= b) return true;
        k -= (in-ind)*(v[ind+1]-v[ind]);
        k -= (ind-in-x+2)*(v[ind]-v[ind-1]);
        k -= (v[in-x+1]);
        in++;
        ind++;
    }
    return false;
}

int besthub(int n, int L, int a[], ll b){
    for(int i = 0; i < n; i++) v.push_back(a[i]);
    int l = 2, r = n, ans = 1;
    while(l <= r){
        int md = (l + r) / 2;
        if(f(md,b,n) == 1){
            l = md+1;
            ans = md;
        }
        else {
            r = md-1;
        }
    }
    return ans;
}

Subtask #1
0 / 17.0

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