oj.uz

Submission #307671

# Submission time Handle Problem Language Result Execution time Memory
307671 2020-09-29T04:17:56 Z juggernaut Rice Hub (IOI11_ricehub) C++14
68 / 100
 1000 ms 2168 KB 
#include"ricehub.h"
#include<bits/stdc++.h>
using namespace std;
int n,a[100005];
long long b;
bool app(int l,int r){
    long long mn=1e18;
    int i=(l+r)>>1;
    long long cnt=0;
    for(int j=l;j<=r;j++)
        cnt+=abs(a[j]-a[i]);
    mn=min(mn,cnt);
    return mn<=b;
}
bool check(int x){
    bool flag=0;
    for(int i=0;i+x-1<n;i++)flag|=app(i,x+i-1);
    return flag;
}
int besthub(int N,int L,int A[],long long B){
    n=N;b=B;
    for(int i=0;i<n;i++)a[i]=A[i];
    int l=1,r=n,m;
    while(l<r){
        m=(l+r+1)>>1;
        if(check(m))l=m;
        else r=m-1;
    }
    return l;
}

Subtask #1
17.0 / 17.0

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

Subtask #2
25.0 / 25.0

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

Subtask #3
26.0 / 26.0

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

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 294 ms 512 KB Output is correct
2 Correct 309 ms 668 KB Output is correct
3 Execution timed out 1092 ms 2168 KB Time limit exceeded
4 Halted 0 ms 0 KB -