oj.uz

Submission #61292

# Submission time Handle Problem Language Result Execution time Memory
61292 2018-07-25T15:23:53 Z TuGSGeReL Rice Hub (IOI11_ricehub) C++14
0 / 100
 9 ms 868 KB 
    #include "ricehub.h"
    #include<bits/stdc++.h>
    #define ll long long
    #define mp make_pair
    #define pub push_back
    #define pob pop_back
    using namespace std;
    ll i,ans,a[111111],b,c[111111];
    bool can(ll k, ll kk){
    	ll md=(k+kk)/2,cst;
    	cst=(md-k-kk+md)*a[md]-c[md]+c[k]+c[kk+1]-c[md+1];
    	if(cst<=b) return 1;
    	else return 0;
    }
    int besthub(int n, int L, int X[], long long B) {
    	b=B;
    	for(i=0;i<n;i++) a[i]=X[i];
    	c[0]=a[0];
    	for(i=1;i<n;i++)c[i]=c[i-1]+a[i];
    	for(i=0;i<n;i++){
    		ll x=i,y=n;
    		while(x+1!=y){
    			ll mid=(x+y)/2;
    			if(can(i,mid))x=mid;
    			else y=mid;
    		}
			ans=max(ans,y-i);
		}
    	return ans;
    }

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 248 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 484 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 564 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 868 KB Output isn't correct
2 Halted 0 ms 0 KB -