Submission #741166

#	Time	Username	Problem	Language	Result	Execution time	Memory
741166		shoryu386	Rice Hub (IOI11_ricehub)	C++17	17 / 100	18 ms	4988 KiB

ricehub

#include "ricehub.h"
using namespace std;
#include <bits/stdc++.h>
#define ll long long
ll countPsum[1000007], sumPsum[1000007];
ll countrq(ll a, ll b){
	if (b < a) return 0;
	if (a == 0) return countPsum[b];
	else return countPsum[b] - countPsum[a-1];
}

ll sumrq(ll a, ll b){
	if (b < a) return 0;
	if (a == 0) return sumPsum[b];
	else return sumPsum[b] - sumPsum[a-1];
}


int besthub(int R, int L, int X[], long long B)
{
  vector<pair<ll, ll>> vec;
  for (int x = 0; x < R; x++){
    if (vec.size() == 0 || vec.back().first != X[x]) vec.push_back({X[x], 1});
    else vec.back().second++;
  }

  ll n = vec.size();
  
  
  countPsum[0] = vec[0].second;
  sumPsum[0] = vec[0].first * vec[0].second;

  for (int x = 1; x < n; x++){
    countPsum[x] = countPsum[x-1] + vec[x].second;

    sumPsum[x] = sumPsum[x-1] + vec[x].first * vec[x].second;
  }
  
  ll l = 0, r = 0, median = 0; ll ans = 1;
  ll leftSize = 0, rightSize = 0;
  while (r != n){
	while (abs(rightSize - leftSize) > abs(rightSize - leftSize - 2*vec[median].second)){
		rightSize -= vec[median].second; leftSize += vec[median].second; median++;
	}
	while (abs(rightSize - leftSize) > abs(rightSize - leftSize + 2*vec[median].second)){
		rightSize += vec[median].second; leftSize -= vec[median].second; median--;
	}
	ll cost = countrq(l, median-1) * vec[median].first - sumrq(l, median-1)
	  + sumrq(median+1, r) - countrq(median+1, r) * vec[median].first;
	;
	
	if (cost > B) leftSize -= vec[l].second, l++;
	else ans = max(r-l+1, ans), r++, rightSize += vec[r].second;
  }
  return ans;
  
  

  
}

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