oj.uz

Submission #16449

# Submission time Handle Problem Language Result Execution time Memory
16449 2015-08-25T07:05:42 Z chan492811 Rice Hub (IOI11_ricehub) C++
100 / 100
 29 ms 5772 KB 
#include "ricehub.h"
#include <cstdlib>
#include <cstdio>
#include <algorithm>
using namespace std;
long long n,m,left,right;
long long b,l,max1,now;
long long arr[100010];
int besthub(int R, int L, int X[], long long B)
{
    long long i;
    n=R; b=B;
    for(i=0;i<n;i++) arr[i]=(long long)X[i];
    while(right<n && now<=b){
        if(arr[right]-arr[0]<=b-now){
            now+=arr[right++]-arr[0];
        }else break;
    }max1=max(max1,right-left);
    for(i=1;i<n;i++){
        now+=(i-left)*(arr[i]-arr[i-1]); now-=(right-i)*(arr[i]-arr[i-1]);
        while(now>b){
            if(arr[i]-arr[left]<=arr[right-1]-arr[i]) now-=arr[--right]-arr[i];
            else now-=arr[i]-arr[left++];
        }
        while(right<n && arr[i]-arr[left]>=arr[right]-arr[i]){
            now-=arr[i]-arr[left]; left++;
        }
        while(now<=b){
            if(right<n && left>0){
                if(arr[i]-arr[left-1]>=arr[right]-arr[i]){
                    if(arr[right]-arr[i]<=b-now) now+=arr[right++]-arr[i];
                    else break;
                }else{
                    if(arr[i]-arr[left-1]<=b-now) now+=arr[i]-arr[--left];
                    else break;
                }
            }else if(right==n && left>0){
                if(arr[i]-arr[left-1]<=b-now) now+=arr[i]-arr[--left];
                else break;
            }else if(right<n && left==0){
                if(arr[right]-arr[i]<=b-now) now+=arr[right++]-arr[i];
                else break;
            }else break;
        }max1=max(max1,right-left);
    }
    return (int)max1;
}

Subtask #1
17.0 / 17.0

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

Subtask #2
25.0 / 25.0

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

Subtask #3
26.0 / 26.0

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

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 5772 KB Output is correct
2 Correct 0 ms 5772 KB Output is correct
3 Correct 29 ms 5772 KB Output is correct
4 Correct 27 ms 5772 KB Output is correct
5 Correct 5 ms 5772 KB Output is correct
6 Correct 2 ms 5772 KB Output is correct
7 Correct 17 ms 5772 KB Output is correct
8 Correct 14 ms 5772 KB Output is correct
9 Correct 9 ms 5772 KB Output is correct
10 Correct 0 ms 5772 KB Output is correct
11 Correct 26 ms 5772 KB Output is correct
12 Correct 9 ms 5772 KB Output is correct
13 Correct 13 ms 5772 KB Output is correct
14 Correct 6 ms 5772 KB Output is correct
15 Correct 15 ms 5772 KB Output is correct
16 Correct 18 ms 5772 KB Output is correct
17 Correct 11 ms 5772 KB Output is correct
18 Correct 0 ms 5772 KB Output is correct
19 Correct 0 ms 5772 KB Output is correct
20 Correct 19 ms 5772 KB Output is correct