Submission #897570

#	Time	Username	Problem	Language	Result	Execution time	Memory
897570		ThylOne	Rice Hub (IOI11_ricehub)	C++14	100 / 100	11 ms	4700 KiB

ricehub

#include "ricehub.h"
#include<bits/stdc++.h>
     
using namespace std;
vector<int> pos;
vector<long long> pref;
long long budget;
int limit;

bool existWithT(int T){

    auto findGoodSegment = [&](int l,int r){
        int best = pos[(l+r)/2];
        int pos_best = (l+r)/2;
        long long right_part=pref[r]-pref[pos_best];
        right_part-= (r-pos_best)*best;
        //cout<<"r"<<right_part<<endl;
        long long left_part=(pos_best-l+1)*best;
        left_part-=(pref[pos_best]-(l==0?0:pref[l-1]));
        //cout<<"l"<<left_part<<endl;
        

        long long computedScore = right_part+left_part;
        if(computedScore<=budget)return true;
       
        return false;
      };
      if(findGoodSegment(0,T-1))return true;
      for(int right=T;right<pos.size();right++){
        if(findGoodSegment(right-T+1,right))return true;
      }
      return false;
    }
    int besthub(int R, int L, int X[], long long B)
    {
     
      budget = B;
      pos.resize(R);
      pref.resize(R);
      limit = L;
      long long act=0;
      for(int i = 0;i<R;i++){
        pos[i] = X[i];
        act+=pos[i];
        pref[i]=act;
      }
     

      
      sort(pos.begin(),pos.end());
      int low = 1;
      int high = R;
      while ((high-low)>1){
        int mid = (low+high)/2;
        if(existWithT(mid)){
          low = mid;
        }else{
          high = mid;
        }
      }
      if(existWithT(high)){
        return high;
      }else{
        return low;
      }
     
    }

Compilation message (stderr)

ricehub.cpp: In function 'bool existWithT(int)':
ricehub.cpp:29:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |       for(int right=T;right<pos.size();right++){
      |                       ~~~~~^~~~~~~~~~~

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