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



#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstring>
#include <chrono>
#include <complex>
#define endl "\\n"
typedef long long LL;
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mod 1000000007
#define mod2 998244353
#define inf 1000000000000000001;
#define all(c) c.begin(), c.end()
#define sz(v) ((ll)(v).size())
#define mp(x, y) make_pair(x, y)
#define mem(a, val) memset(a, val, sizeof(a))
#define eb emplace_back
#define pb push_back
#define f first
#define s second
#define dbg(a) cout << #a << " --> " << (a) << "\\n";
#define forn(i, n) for (ll i = 0; i < (n); ++i)
#define fornd(i, n) for (ll i = (n)-1; i >= 0; --i)
#define forab(i, a, b) for (ll i = (a); i <= (b); ++i)
#define read(a)                                                                \\
  ll a;                                                                        \\
  cin >> a;
#define reads(s)                                                               \\
  string s;                                                                    \\
  cin >> s;
#define readb(a, b)                                                            \\
  ll a, b;                                                                     \\
  cin >> a >> b;
#define readc(a, b, c)                                                         \\
  ll a, b, c;                                                                  \\
  cin >> a >> b >> c;
#define readarr(a, n)                                                          \\
  int a[(n) + 1] = {};                                                         \\
  forab(i, 0, (n - 1)) { cin >> a[i]; }
#define readmat(a, n, m)                                                       \\
  int a[n + 1][m + 1] = {};                                                    \\
  forab(i, 1, n) { forab(j, 1, m) cin >> a[i][j]; }
#define readv(A, n)                                                            \\
  vll A(n, 0);                                                                 \\
  forn(i, n) cin >> A[i];
#define print(a) cout << a << endl;
#define printarr(a, n)                                                         \\
  forab(i, 1, n) cout << a[i] << " ";                                          \\
  cout << endl;
#define printv(v)                                                              \\
  for (int i : v)                                                              \\
    cout << i << " ";                                                          \\
  cout << endl;
#define printmat(a, n, m)                                                      \\
  forab(i, 1, n) {                                                             \\
    forab(j, 1, m) cout << a[i][j] << " ";                                     \\
    cout << endl;                                                              \\
  }

#define fast_io ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
using namespace std;
bool isPowerOfTwo(int x) { return x && (!(x & (x - 1))); }
int takemod(int x) { return (x % mod + mod) % mod; }

int fpow(int base, int power, int MOD) {
  int result = 1;
  base = base % MOD;
  while (power) {
    if (power & 1)
      result = (result * base) % MOD;
    base = (base * base) % MOD;
    power = power >> 1;
  }
  return result;
}

int modinv(int x) { return fpow(x, mod - 2, mod); }
void solve() {
  ll n, k, mx = 0;
  cin >> n >> k;
  vll A(n);
  forn(i, n) {
    cin >> A[i];
    mx = max(mx, A[i]);
  }
  ll l = 0, r = mx;
  // dbg(mx)
  if (k == 0) {
    cout << mx << endl;
    return;
  }
  while (r - l > 1) {
    ll mid = (l + r) / 2;
    ll er = 0;
    forn(i, n) {
      ll res = A[i];
      er += (A[i] - 1) / mid;
    }
    // dbg(er);
    if (er > k) {
      l = mid;
    } else {
      r = mid;
    }
  }
  cout << r << endl;
}
int main() {
#ifndef ONLINE_JUDGE
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
#endif
  fast_io;
  int T = 1;
  // cin>>T;
  //  cin.ignore(); must be there when using getline(cin, s)
  while (T--) {
    solve();
  }
  return 0;
}


Error: -6
terminate called after throwing an instance of 'std::bad_alloc'
  what():  std::bad_alloc


Fixed submission:



#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstring>
#include <chrono>
#include <complex>
#define endl "\\n"
typedef long long LL;
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mod 1000000007
#define mod2 998244353
#define inf 1000000000000000001;
#define all(c) c.begin(), c.end()
#define sz(v) ((ll)(v).size())
#define mp(x, y) make_pair(x, y)
#define mem(a, val) memset(a, val, sizeof(a))
#define eb emplace_back
#define pb push_back
#define f first
#define s second
#define dbg(a) cout << #a << " --> " << (a) << "\\n";
#define forn(i, n) for (ll i = 0; i < (n); ++i)
#define fornd(i, n) for (ll i = (n)-1; i >= 0; --i)
#define forab(i, a, b) for (ll i = (a); i <= (b); ++i)
#define read(a)                                                                \\
  ll a;                                                                        \\
  cin >> a;
#define reads(s)                                                               \\
  string s;                                                                    \\
  cin >> s;
#define readb(a, b)                                                            \\
  ll a, b;                                                                     \\
  cin >> a >> b;
#define readc(a, b, c)                                                         \\
  ll a, b, c;                                                                  \\
  cin >> a >> b >> c;
#define readarr(a, n)                                                          \\
  int a[(n) + 1] = {};                                                         \\
  forab(i, 0, (n - 1)) { cin >> a[i]; }
#define readmat(a, n, m)                                                       \\
  int a[n + 1][m + 1] = {};                                                    \\
  forab(i, 1, n) { forab(j, 1, m) cin >> a[i][j]; }
#define readv(A, n)                                                            \\
  vll A(n, 0);                                                                 \\
  forn(i, n) cin >> A[i];
#define print(a) cout << a << endl;
#define printarr(a, n)                                                         \\
  forab(i, 1, n) cout << a[i] << " ";                                          \\
  cout << endl;
#define printv(v)                                                              \\
  for (int i : v)                                                              \\
    cout << i << " ";                                                          \\
  cout << endl;
#define printmat(a, n, m)                                                      \\
  forab(i, 1, n) {                                                             \\
    forab(j, 1, m) cout << a[i][j] << " ";                                     \\
    cout << endl;                                                              \\
  }

#define fast_io ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
using namespace std;
bool isPowerOfTwo(int x) { return x && (!(x & (x - 1))); }
int takemod(int x) { return (x % mod + mod) % mod; }

int fpow(int base, int power, int MOD) {
  int result = 1;
  base = base % MOD;
  while (power) {
    if (power & 1)
      result = (result * base) % MOD;
    base = (base * base) % MOD;
    power = power >> 1;
  }
  return result;
}

int modinv(int x) { return fpow(x, mod - 2, mod); }
void solve() {
  ll n, k, mx = 0;
  cin >> n >> k;
  vll A(n);
  forn(i, n) {
    cin >> A[i];
    mx = max(mx, A[i]);
  }
  ll l = 0, r = mx;
  // dbg(mx)
  if (k == 0) {
    cout << mx << endl;
    return;
  }
  while (l < r) {
    ll mid = (l + r) / 2;
    ll er = 0;
    forn(i, n) {
      ll res = A[i];
      er += (A[i]) / mid;
    }
    // dbg(er);
    if (er > k) {
      l = mid + 1;
    } else {
      r = mid;
    }
  }
  cout << l << endl;
}
int main() {
#ifndef ONLINE_JUDGE
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
#endif
  fast_io;
  int T = 1;
  // cin>>T;
  //  cin.ignore(); must be there when using getline(cin, s)
  while (T--) {
    solve();
  }
  return 0;
}