Submission #680089

#	Time	Username	Problem	Language	Result	Execution time	Memory
680089		raysh07	Rice Hub (IOI11_ricehub)	C++17	100 / 100	46 ms	4588 KiB

ricehub

#include "ricehub.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn = 1e5 + 69;
ll seg[4*maxn];
ll a[maxn];
int n;

void Build(int l, int r, int pos){
  if (l==r){
    seg[pos] = a[l];
    return;
  }
  int mid = (l+r)/2;
  Build(l, mid, pos*2);
  Build(mid + 1, r, pos*2 + 1);
  seg[pos] = seg[pos * 2] + seg[pos * 2 + 1];
}

ll Query(int l, int r, int pos, int ql, int qr){
  if (l>r) return 0;
  if (l>=ql && r<=qr)
    return seg[pos];

  else if (l>qr || ql>r) return 0;

  int mid = (l+r)/2;
  return Query(l, mid, pos*2, ql, qr) + Query(mid + 1, r, pos*2 + 1, ql, qr);
}

bool check(int l, int r, ll B){
  int mid = (l+r)/2;
  int pos = a[mid];
  ll val = (mid - l + 1) * pos - Query(1, n, 1, l, mid);
  val += Query(1, n, 1, mid, r) - (r - mid + 1) * pos;

  return val <= B;
}

int besthub(int R, int L, int X[], long long B)
{
    n = R;
    for (int i=1; i<=n; i++){
      a[i] = X[i-1];
    }

    Build(1, n, 1);

    int ans = 0;
    int r = 0;

    for (int l=1; l<=n; l++){
      while (r!=n && check(l, r+1, B))
      r++;
      ans = max(ans, r-l+1);
    }
    return ans;
}

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