oj.uz

Submission #897510

# Submission time Handle Problem Language Result Execution time Memory
897510 2024-01-03T10:32:06 Z ThylOne Rice Hub (IOI11_ricehub) C++14
0 / 100
 1000 ms 348 KB 
#include "ricehub.h"
#include<bits/stdc++.h>

using namespace std;
vector<int> pos;
long long budget;
int limit;
bool existWithT(int T){
  int sum = 0;

  for(int i=0;i<T;i++)
    sum+=pos[i];
  
  auto computeScore = [&](int x,int l,int r){
    int re = 0;
    for(int i = l;i<=r;i++){
      re+=abs(x-pos[i]);
    }
    return re;
  };
  auto findGoodSegment = [&](int l,int r){
    int bestInf = double(sum)/double(T);
    int bestSup = ceil(double(sum)/double(T));
    
    if(computeScore(bestInf,l,r)<=budget)return true;
    if(computeScore(bestSup,l,r)<=budget)return true;
    return false;
  };
  if(findGoodSegment(0,T-1))return true;
  for(int right=T;right<pos.size();right++){
    sum-=pos[right-T];
    sum+=pos[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);
  limit = L;
  for(int i = 0;i<R;i++){
    pos[i] = X[i];
  }
  sort(pos.begin(),pos.end());
  int low = 1;
  int high = R;
  while (low<high){
    int mid = (low+high)/2;
    if(existWithT(mid)){
      low = mid;
    }else{
      high = mid-1;
    }
  }
 
  return low;
}

Compilation message

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

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Execution timed out 1022 ms 348 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Execution timed out 1086 ms 348 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1042 ms 344 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1049 ms 348 KB Time limit exceeded
2 Halted 0 ms 0 KB -