제출 #1032618

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1032618		ezzzay	쌀 창고 (IOI11_ricehub)	C++14	68 / 100	1093 ms	1836 KiB

ricehub

#include "ricehub.h"
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define ll long long
int besthub(int R, int L, int X[], long long B)
{
    int n=R;
    int ans=0;
    
    for(int i=0;i<n;i++){
        int l=i-1,r=i+1;
        ll k=B;
        int cnt=0;
        while(1){
            if(l==-1 and r==n)break;
            if(l==-1){
                if(abs(X[r]-X[i])<=k){
                    cnt++;
                    k-=abs(X[r]-X[i]);
                    r++;
                }
                else{break;}
            }
            else if(r==n){
                if(abs(X[l]-X[i])<=k){
                    cnt++;
                    k-=abs(X[l]-X[i]);
                    l--;
                }
                else{break;}
            }
            else{
                ll a=abs(X[r]-X[i]),b=abs(X[l]-X[i]);
                if(a<=b){
                    if(abs(X[r]-X[i])<=k){
                    cnt++;
                    k-=abs(X[r]-X[i]);
                    r++;
                }
                else{break;}
                }
                else{
                    if(abs(X[l]-X[i])<=k){
                    cnt++;
                    k-=abs(X[l]-X[i]);
                    l--;
                    }
                    else{break;}
                }
            }
        }
        ans=max(ans,cnt);
    }
    return ans+1;
}

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