Submission #468857

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
468857	2021-08-29 20:54:04	pere_gil	Rice Hub (IOI11_ricehub)	C++14	100 / 100	25 ms	1480 KiB

ricehub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "ricehub.h"
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
ll get_sum(int l, int r, ll sum[]){
  return (l==0) ? sum[r] : sum[r]-sum[l-1];
}
bool check(int l, int r, ll b, int v[], ll sum[]){
  int med=(l+r)>>1;
  ll act=(long long) v[med]*(med-l+1LL)-get_sum(l,med,sum);
  act+=(long long) get_sum(med,r,sum)-v[med]*(r-med+1LL);
  return act<=b;
}
int besthub(int n, int dist, int v[], ll b){
  ll sum[n];
  sum[0]=v[0];
  for(int i=1;i<n;i++)
    sum[i]=sum[i-1]+v[i];
  int res=0;
  for(int i=0;i<n;i++){
    int l=i,r=n-1,act=0;
    while(l<=r){
      int med=(l+r)>>1;
      if(check(i,med,b,v,sum)){
        act=med;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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