제출 #551204

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
551204		Koosha_mv	쌀 창고 (IOI11_ricehub)	C++14	100 / 100	18 ms	2036 KiB

ricehub

#include <bits/stdc++.h>
using namespace std;
#define dbgv(v) cout<<#v<<" = "; f(i,0,v.size()) cout<<v[i]<<" "; cout<<endl
#define dbga(a,x,y) cout<<#a<<" = "; f(i,x,y) cout<<a[i]<<" "; cout<<endl
#define erorp(x) cout<<#x<<"={"<<x.F<<" , "<<x.S<<"}"<<endl
#define eror(x) cout<<#x<<'='<<(x)<<endl
#define f_(i,a,b) for(int i=a;i>=b;i--)
#define f(i,a,b) for(int i=a;i<b;i++)
#define nb(x) __builtin_popcount(x)
#define all(v) v.begin(),v.end()
#define bit(n,k) (((n)>>(k))&1)
#define Add(x,y) x=(x+y)%mod
#define maxm(a,b) a=max(a,b)
#define minm(a,b) a=min(a,b)
#define lst(x) x[x.size()-1]
#define sz(x) int(x.size())
#define mp make_pair
#define ll long long
#define pb push_back
#define S second
#define F first
#include "ricehub.h"

const int N=1e6+99;

int n,m,a[N],b[N];
ll k,ps[N];

int besthub(int R,int L,int X[],long long B) {
	int ans=0;
	n=R,m=L,k=B;
	f(i,1,n+1) a[i]=X[i-1];
	f(i,1,n+1) ps[i]=ps[i-1]+a[i];
	f(i,4,n){
		int l=0,r=min(i,n-i+1);
		while(l+1<r){
			int mid=(l+r)>>1;
			if((ps[i+mid]-ps[i])-(ps[i-1]-ps[i-mid-1])<=k) l=mid;
			else r=mid;
		}
		maxm(ans,2*l+1);
		if(i+l<n && (ps[i+l]-ps[i])-(ps[i-1]-ps[i-l-1])+a[i+l+1]-a[i]<=k){
			maxm(ans,2*(l+1));
		}
	}
	return ans;
}

/*
int32_t main(){
	ios:: sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cin>>n;
	f(i,0,n) cin>>b[i];
	cout<<besthub(n,20,b,6);
}
*/

• Subtask 1: 17 / 17
• Subtask 2: 25 / 25
• Subtask 3: 26 / 26
• Subtask 4: 32 / 32