oj.uz

Submission #284026

# Submission time Handle Problem Language Result Execution time Memory
284026 2020-08-26T13:41:40 Z Haunted_Cpp Rice Hub (IOI11_ricehub) C++17
0 / 100
 29 ms 2168 KB 
#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long i64;

int besthub(int R, int L, int X[], i64 B) {
  vector<i64> pre(R), suf(R);
  pre[0] = 0;
  for (int i = 1; i < R; i++) {
    pre[i] = pre[i - 1] + (X[i] - X[i - 1]);
  }
  suf.back() = 0;
  for (int i = R - 2; ~i; i--) {
    suf[i] = suf[i + 1] + (X[i + 1] - X[i]);
  }
  auto range_sum = [&](const vector<i64> &dp, int lo, int hi, bool is_suf) {
    if (!is_suf) return dp[hi] - dp[lo];
    return dp[lo] - dp[hi];
  };
  auto ok = [&](int how_many) {
    for (int i = 0; i <= R - how_many; i++) {
      const int lo = i;
      const int hi = i + how_many - 1;
      const int mid = lo + (hi - lo) / 2;
      i64 dist = 0;
      // Right side
      dist += range_sum(pre, mid, hi, false);
      cout << range_sum(pre, mid, hi, false) << '\n';
      // Left side
      dist += range_sum(suf, lo, mid, true);
      cout << range_sum(suf, lo, mid, true) << '\n';
      if (dist <= B) return true;
    }
    return false;
  };
  int lo = 0, hi = R + 7;
  while(lo < hi) {
    const int mid = lo + (hi - lo) / 2;
    if (!ok(mid)) hi = mid;
    else lo = mid + 1;
  }
  return hi - 1;
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Incorrect 29 ms 2168 KB Output isn't correct
2 Halted 0 ms 0 KB -