Problem p02598 (C++) — buggy submission, verdict: Runtime Error

/***************************************** START OF TEMPLATE
 * *********************************************/

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

#define SPEED                                                                  \\
  ios::sync_with_stdio(0);                                                     \\
  cin.tie(0);                                                                  \\
  cout.tie(0);                                                                 \\
  cout << fixed;                                                               \\
  cout << setprecision(10);
#define randomINIT                                                             \\
  mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define foo(i, a, n) for (ll i = (a); i <= n; i++)
#define frr(i, a, n) for (ll i = (a); i >= n; i--)
#define fo(i, n) for (ll i = 0; i < n; i++)
#define newl cout << "\\n";
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define sym(s) s = "#" + s + "#";
#define sqr(v) v *v;
#define all(x) (x).begin(), (x).end()
#define alll(x, n) x + 1, x + n + 1
#define uniq(a) a.resize(unique(a.begin(), a.end()) - a.begin());
#define mset(x, val) memset(x, val, sizeof(x))
#define mset1d(a, n, v) foo(i, 0, n + 5) a[i] = v;
#define mset2d(a, n, m, v) foo(i, 0, n + 5) foo(j, 0, m + 5) a[i][j] = v;
#define deb1(a) cout << a << "\\n";
#define deb2(a, b) cout << a << " " << b << "\\n";
#define deb3(a, b, c) cout << a << " " << b << " " << c << "\\n";
#define deb4(a, b, c, d) cout << a << " " << b << " " << c << " " << d << "\\n";
#define debp(a) cout << a.f << " " << a.s << "\\n";
#define debv(a)                                                                \\
  for (auto it : a)                                                            \\
    cout << it << " ";                                                         \\
  newl;
#define debm(a)                                                                \\
  for (auto it : a)                                                            \\
    cout << "{" << it.f << "," << it.s << "}, ";                               \\
  newl;
#define deb1d(a, n)                                                            \\
  foo(i, 1, n) cout << a[i] << " ";                                            \\
  newl;
#define deb2d(a, n, m)                                                         \\
  foo(i, 1, n) {                                                               \\
    foo(j, 1, m) { cout << a[i][j] << " "; }                                   \\
    newl;                                                                      \\
  }

template <typename T>
using ordered_set =
    tree<T, null_type, less<>, rb_tree_tag, tree_order_statistics_node_update>;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
using vll = vector<ll>;
using vpll = vector<pll>;

const ld PI = 3.14159265358979323846;
const ll MOD = 1e+9 + 7;
const ll INF = LLONG_MAX;
const int INFi = INT_MAX;
const ll N = 1e+6 + 8;

vll adj[N];
ll vis[N];
ll dx4[] = {0, 1, 0, -1}, dy4[] = {1, 0, -1, 0};

ll test_cases = 1;
randomINIT;

/*********************************************************************************************************/
/***************************************** VARIABLE DECLARATIONS
 * *****************************************/
ll n, m, a[N];
string s;
/***************************************** FUNCTION IMPLEMENTATIONS
 * **************************************/
ll P(ll k) {
  ll cnt = 0;
  for (int i = 1; i <= n; i++) {
    cnt += (a[i] - 1) / k;
    if (cnt > m)
      return 0;
  }
  return 1;
}

ll bs(ll L, ll R) {
  while (L < R) {
    ll mid = (L + R) / 2;
    if (P(mid))
      R = mid;
    else
      L = mid + 1;
  }
  return L;
}

/***************************************** START OF MAIN FUNCTION
 * ****************************************/
void MAIN(ll tc) {
  ll mx = -INF;
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    mx = max(mx, a[i]);
  }
  !m ? cout << mx : cout << bs(1, MOD);
}

int main() {
  SPEED;

  // cin>>test_cases;
  foo(i, 1, test_cases) { MAIN(i); }
}

Error: 0

Fixed submission:

/***************************************** START OF TEMPLATE
 * *********************************************/

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

#define SPEED                                                                  \\
  ios::sync_with_stdio(0);                                                     \\
  cin.tie(0);                                                                  \\
  cout.tie(0);                                                                 \\
  cout << fixed;                                                               \\
  cout << setprecision(10);
#define randomINIT                                                             \\
  mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define foo(i, a, n) for (ll i = (a); i <= n; i++)
#define frr(i, a, n) for (ll i = (a); i >= n; i--)
#define fo(i, n) for (ll i = 0; i < n; i++)
#define newl cout << "\\n";
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define sym(s) s = "#" + s + "#";
#define sqr(v) v *v;
#define all(x) (x).begin(), (x).end()
#define alll(x, n) x + 1, x + n + 1
#define uniq(a) a.resize(unique(a.begin(), a.end()) - a.begin());
#define mset(x, val) memset(x, val, sizeof(x))
#define mset1d(a, n, v) foo(i, 0, n + 5) a[i] = v;
#define mset2d(a, n, m, v) foo(i, 0, n + 5) foo(j, 0, m + 5) a[i][j] = v;
#define deb1(a) cout << a << "\\n";
#define deb2(a, b) cout << a << " " << b << "\\n";
#define deb3(a, b, c) cout << a << " " << b << " " << c << "\\n";
#define deb4(a, b, c, d) cout << a << " " << b << " " << c << " " << d << "\\n";
#define debp(a) cout << a.f << " " << a.s << "\\n";
#define debv(a)                                                                \\
  for (auto it : a)                                                            \\
    cout << it << " ";                                                         \\
  newl;
#define debm(a)                                                                \\
  for (auto it : a)                                                            \\
    cout << "{" << it.f << "," << it.s << "}, ";                               \\
  newl;
#define deb1d(a, n)                                                            \\
  foo(i, 1, n) cout << a[i] << " ";                                            \\
  newl;
#define deb2d(a, n, m)                                                         \\
  foo(i, 1, n) {                                                               \\
    foo(j, 1, m) { cout << a[i][j] << " "; }                                   \\
    newl;                                                                      \\
  }

template <typename T>
using ordered_set =
    tree<T, null_type, less<>, rb_tree_tag, tree_order_statistics_node_update>;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
using vll = vector<ll>;
using vpll = vector<pll>;

const ld PI = 3.14159265358979323846;
const ll MOD = 1e+9 + 7;
const ll INF = LLONG_MAX;
const int INFi = INT_MAX;
const ll N = 1e+6 + 8;

vll adj[N];
ll vis[N];
ll dx4[] = {0, 1, 0, -1}, dy4[] = {1, 0, -1, 0};

ll test_cases = 1;
randomINIT;

/*********************************************************************************************************/
/***************************************** VARIABLE DECLARATIONS
 * *****************************************/
ll n, m, a[N];
string s;
/***************************************** FUNCTION IMPLEMENTATIONS
 * **************************************/
ll P(ll k) {
  ll cnt = 0;
  for (int i = 1; i <= n; i++) {
    if (a[i] == 1)
      continue;
    cnt += (a[i] - 1) / k;
    if (cnt > m)
      return 0;
  }
  return 1;
}

ll bs(ll L, ll R) {
  while (L < R) {
    ll mid = (L + R) / 2;
    if (P(mid))
      R = mid;
    else
      L = mid + 1;
  }
  return L;
}

/***************************************** START OF MAIN FUNCTION
 * ****************************************/
void MAIN(ll tc) {
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  deb1(bs(0, MOD));
}

int main() {
  SPEED;

  // cin>>test_cases;
  foo(i, 1, test_cases) { MAIN(i); }
}