oj.uz

Submission #594324

# Submission time Handle Problem Language Result Execution time Memory
594324 2022-07-12T10:58:46 Z Bench0310 Rice Hub (IOI11_ricehub) C++17
58 / 100
 24 ms 2520 KB 
#include <bits/stdc++.h>
#include "ricehub.h"

using namespace std;
typedef long long ll;

int besthub(int n,int L,int pos[],ll b)
{
    vector<ll> sum(n,0);
    for(int i=0;i<n;i++) sum[i]=(i>0?sum[i-1]:0)+pos[i];
    auto s=[&](int l,int r){return (sum[r]-(l>0?sum[l-1]:0));};
    int res=0;
    for(int i=0;i<n;i++)
    {
        int l=0,r=n;
        while(l<r-1)
        {
            int m=(l+r)/2;
            int cl=m/2;
            int cr=(m+1)/2;
            int x=i-cl;
            int y=i+cr;
            bool ok=0;
            if(0<=x&&y<n) ok=(cl*ll(pos[i])-s(x,i-1)+s(i+1,y)-cr*ll(pos[i])<=b);
            if(ok) l=m;
            else r=m;
        }
        res=max(res,l+1);
    }
    return res;
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 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
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 312 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 312 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 312 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 312 KB Output is correct
20 Correct 1 ms 316 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 2 ms 324 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 360 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 580 KB Output is correct
2 Correct 4 ms 596 KB Output is correct
3 Correct 22 ms 2516 KB Output is correct
4 Correct 22 ms 2516 KB Output is correct
5 Correct 10 ms 1236 KB Output is correct
6 Correct 11 ms 1216 KB Output is correct
7 Correct 21 ms 2260 KB Output is correct
8 Correct 20 ms 2216 KB Output is correct
9 Correct 10 ms 1096 KB Output is correct
10 Correct 13 ms 1196 KB Output is correct
11 Correct 24 ms 2496 KB Output is correct
12 Correct 23 ms 2520 KB Output is correct
13 Correct 11 ms 1236 KB Output is correct
14 Correct 14 ms 1236 KB Output is correct
15 Correct 16 ms 1876 KB Output is correct
16 Correct 17 ms 1968 KB Output is correct
17 Correct 21 ms 2224 KB Output is correct
18 Correct 20 ms 2228 KB Output is correct
19 Correct 24 ms 2328 KB Output is correct
20 Correct 21 ms 2388 KB Output is correct