oj.uz

Submission #460705

# Submission time Handle Problem Language Result Execution time Memory
460705 2021-08-09T08:28:35 Z BT21tata Rice Hub (IOI11_ricehub) C++17
68 / 100
 16 ms 3276 KB 
#include "ricehub.h"
#include<bits/stdc++.h>

typedef long long ll;

using namespace std;

ll cnt[100005], a[100005];

int check(int x, int n)
{
    int lnum=x>>1;
    int rnum=x-lnum-1;
    ll ans=0, cur, ret=1e18;
    for(int i=lnum; i<n-rnum; i++)
    {
        cur=cnt[i]-cnt[i-lnum];
        ans=lnum*a[i]-cur;

        cur=cnt[i+rnum+1]-cnt[i+1];
        ans+=(cur-rnum*a[i]);

        ret=min(ans, ret);
    }
    return ret;
}

int besthub(int n, int len, int X[], long long m)
{
    for(int i=0; i<n; i++)
        cnt[i+1]=cnt[i]+X[i], a[i]=X[i];

    int l=0, r=n, mid;
    while(l<=r)
    {
        mid=(l+r)>>1;
    //    cout<<l<<' ' <<r<<' '<<mid<<' '<<check(mid, n)<<endl;
        if(check(mid, n)<=m) l=mid+1;
        else r=mid-1;
    }
    return r;
}

/*


5 20 6
1 2 10 12 14
3

*/

Subtask #1
17.0 / 17.0

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

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 304 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 292 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 296 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 208 KB Output is correct
28 Correct 1 ms 204 KB Output is correct

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 440 KB Output is correct
26 Correct 2 ms 348 KB Output is correct
27 Correct 2 ms 332 KB Output is correct
28 Correct 1 ms 460 KB Output is correct

Subtask #4
0 / 32.0

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