Submission #743342

#	Time	Username	Problem	Language	Result	Execution time	Memory
743342		vjudge1	Rice Hub (IOI11_ricehub)	C++17	42 / 100	1083 ms	740 KiB

ricehub

#include "ricehub.h"

#include<bits/stdc++.h>

using namespace std ;

using ll = long long ; 
using pii = pair<ll , ll> ; 

const int N = 1e6+5 ; 

ll qs[N] , ans ; 

int besthub(int R, int L, int X[], long long B)
{
  for(int i=0;i<L;i++){
        ll cnt = 0 , sum = 0 ;
        vector<int> mn ;
        for(int j=0;j<R;j++){
            mn.push_back(abs(i - X[j])) ;
        }
        sort(mn.begin() , mn.end());
        int j = 0 ;
        while(j < R){
            if(sum + mn[j] > B) break;
            sum += mn[j] ;
            j++;
            cnt++ ;
        }
        ans = max(ans , cnt) ;
    }
  
  
    return ans ; 
}

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