제출 #491286

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

ricehub

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<ll>;
using pl = pair<ll,ll>;
#define pb push_back
#define form(m,it) for(auto it=m.begin(); it!=m.end(); it++)
#define forp(i,a,b) for(ll i=a; i<=b; i++)
#define forn(i,a,b) for(ll i=a; i>=b; i--)
#define newl '\n'
#define ff first
#define ss second
const ll mod = 1000000007;

int besthub(int r, int l, int x[], ll b){
    ll ans=0,n,m,cnt,temp;
    forp(i,0,r-1){
        n=i-1,m=i+1;
        cnt=1,temp=0;
        while(temp<=b){
            if(n<0 && m>r-1){
                break;
            } else if(n>=0 && m>r-1){
                if(temp+(x[i]-x[n])<=b){
                    temp+=(x[i]-x[n]);
                    n--;
                    cnt++;
                } else {
                    break;
                }
            } else if(m<=r-1 && n<0){
                if(temp+(x[m]-x[i])<=b){
                    temp+=(x[m]-x[i]);
                    m++;
                    cnt++;
                } else {
                    break;
                }
            } else {
                if(x[m]-x[i]<x[i]-x[n] && temp+(x[m]-x[i])<=b){
                    temp+=(x[m]-x[i]);
                    m++;
                    cnt++;
                } else if(temp+(x[i]-x[n])<=b){
                    temp+=(x[i]-x[n]);
                    n--;
                    cnt++;
                } else {
                    break;
                }
            }
        }
        ans=max(ans,cnt);
    }

    return ans;
}

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