Submission #515845

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
515845	2022-01-19 22:02:41	thiago_bastos	Rice Hub (IOI11_ricehub)	C++17	100 / 100	20 ms	2480 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 <vector>
#include <algorithm>
#include <climits>
#include <iostream>
int besthub(int R, int L, int X[], long long B)
{
  int ans = 0;  
  std :: vector<long long> pre(R + 1, 0);
  for(int i = 1; i <= R; ++i) pre[i] = pre[i - 1] + X[i - 1];
  for(int i = 0; i < R; ++i) {
   int lo = 0;
   for(int k = 31 - __builtin_clz(R); k >= 0; --k) {
    int n = lo | (1 << k);
    int mid = (n - 1) / 2;
    if(i - mid < 0 || i + mid >= R) continue;
    auto l = pre[i] - pre[i - mid];
    auto r = pre[i + mid + 1] - pre[i + 1];
    if(n & 1) {
      if(r - l <= B) lo = n;
    } else {
      if(i + mid + 1 < R && r + X[i + mid + 1] - l - X[i] <= B) lo = n;
      if(i - mid - 1 >= 0 && r - l - X[i - mid - 1] + X[i] <= B) lo = n;
    }
   }
   ans = std :: max(ans, lo);
  }
  return ans;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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