제출 #830218

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
830218	2023-08-19 00:03:05	OAleksa	쌀 창고 (IOI11_ricehub)	C++14	100 / 100	16 ms	2796 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 <bits/stdc++.h>
#include "ricehub.h"
#define f first
#define s second
using namespace std; 
 
int besthub(int R, int L, int X[], long long B)
{
    int n = R;
    int a[n];
    for(int i = 0;i < n;i++)
      a[i] = X[i];
    vector<long long> p(n);
    p[0] = a[0];
    for(int i = 1;i < n;i++)
      p[i] = p[i - 1] + a[i];
    auto check = [&](int l, int r) {
      int mid = (l + r) / 2;
      long long sl = 1ll * a[mid] * (mid - l + 1) - p[mid] + (l == 0 ? 0 : p[l - 1]);
      long long sr = 1ll * p[r] - p[mid] - 1ll * a[mid] * (r - mid);
      return sl + sr <= B;
    };
    int ans = 1;
  for(int i = 0;i < n;i++) {
    int l = i, r = n - 1, mx = i;
    while(l <= r) {
      int mid = (l + r) / 2;
      if(check(i, mid)) {
        mx = mid;
        l = mid + 1;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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