oj.uz

Submission #897567

# Submission time Handle Problem Language Result Execution time Memory
897567 2024-01-03T12:30:17 Z ThylOne Rice Hub (IOI11_ricehub) C++14
68 / 100
 11 ms 4704 KB 
#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){
  long long sum = 0;
     
  for(int i=0;i<T;i++)sum+=pos[i];
      
  auto computeScore = [&](int x,int l,int r){
    long long re = 0;
    for(int i = l;i<=r;i++){
      re+=abs(x-pos[i]);
    }
  return re;
};
    auto findGoodSegment = [&](int l,int r){
        int best = pos[(l+r)/2];
        int pos_best = (l+r)/2;
        int right_part=pref[r]-pref[pos_best];
        right_part-= (r-pos_best)*best;
        //cout<<"r"<<right_part<<endl;
        int left_part=(pos_best-l+1)*best;
        left_part-=(pref[pos_best]-(l==0?0:pref[l-1]));
        //cout<<"l"<<left_part<<endl;
        

        int 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++){
        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);
      pref.resize(R);
      limit = L;
      int 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

ricehub.cpp: In function 'bool existWithT(int)':
ricehub.cpp:39:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |       for(int right=T;right<pos.size();right++){
      |                       ~~~~~^~~~~~~~~~~
ricehub.cpp:15:8: warning: variable 'computeScore' set but not used [-Wunused-but-set-variable]
   15 |   auto computeScore = [&](int x,int l,int r){
      |        ^~~~~~~~~~~~

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 444 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 452 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #2
25.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 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 376 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 396 KB Output is correct

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 452 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 456 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 2 ms 344 KB Output is correct

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 712 KB Output is correct
2 Correct 3 ms 860 KB Output is correct
3 Correct 10 ms 4704 KB Output is correct
4 Incorrect 11 ms 4700 KB Output isn't correct
5 Halted 0 ms 0 KB -