oj.uz

Submission #880570

# Submission time Handle Problem Language Result Execution time Memory
880570 2023-11-29T16:32:03 Z AlphaMale06 Rice Hub (IOI11_ricehub) C++14
17 / 100
 10 ms 2652 KB 
#include<bits/stdc++.h>
#include "ricehub.h"

using namespace std;
using ll = long long;

const int N = 100005;
ll suf[N], pref[N];

int besthub(int n, int L, int a[], long long c)
{
    if(n==1)return 1;
    for(int i=1; i<=n; i++){
        pref[i]=pref[i-1]+a[i-1];
    }
    for(int i=n-1; i>=0; i--){
        suf[i]=pref[n]-pref[i];
    }
    ll sufind=n;
    ll mx;
    ll s=n/2;
    ll cost=a[s]*(s+1)-pref[s+1]-a[s]*(n-s)+suf[s+1];
    while(cost>c){
        s=sufind/2;
        cost=a[s]*(s+1)-pref[s+1]-a[s]*(sufind-s)+suf[s]-suf[sufind];
        if(cost<=c)break;
        sufind--;
    }
    mx=sufind;
    for(int i=1; i< n; i++){
        cost=0;
        while(cost<=c && sufind<n){
            s=(sufind+i)/2;
            cost=a[s]*(s-i+1)-pref[s+1]+pref[i]-a[s]*(sufind-s)+suf[s+1]-suf[sufind+1];
            sufind++;
        }
        if(sufind==n && cost<=c){
            mx=max(mx, sufind-i);
            break;
        }
        else{
            sufind--;
            mx=max(mx, sufind-i);
        }
    }
    return mx;
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2392 KB Output is correct

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Incorrect 0 ms 2396 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Incorrect 1 ms 2396 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2652 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 9 ms 2652 KB Output is correct
4 Incorrect 10 ms 2652 KB Output isn't correct
5 Halted 0 ms 0 KB -