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

#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>

const int MOD = 1e9 + 7;
const int iINF = 2147483647 / 2;
const long long int llINF = 9223372036854775807 / 2;

using namespace std;
using ll = long long int;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;

typedef pair<ll, ll> pll;
bool paircomp(const pll &a, const pll &b) {
  if (a.first == b.first)
    return a.second < b.second;
  return a.first < b.first;
}

#define REP(i, n) for (ll i = 0; i < (n); i++)
#define RREP(i, n) for (ll i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define AUTO(i, m) for (auto &i : m)
#define ALL(a) (a).begin(), (a).end()
#define MAX(vec) *std::max_element(vec.begin(), vec.end())
#define MIN(vec) *std::min_element(vec.begin(), vec.end())
#define ARGMAX(vec)                                                            \\
  std::distance(vec.begin(), std::max_element(vec.begin(), vec.end()))
#define ARGMIN(vec)                                                            \\
  std::distance(vec.begin(), std::min_element(vec.begin(), vec.end()))
#define REV(T) greater<T>()
#define PQ(T) priority_queue<T, vector<T>, greater<T>>
#define VVL(a, b, c) vector<vector<ll>>(a, vector<ll>(b, c))
#define VV(T, a, b, c) vector<vector<T>>(a, vector<T>(b, c))
#define VVVL(a, b, c, d)                                                       \\
  vector<vector<vector<ll>>>(a, vector<vector<ll>>(b, vector<ll>(c, d)))
#define VVV(T, a, b, c, d)                                                     \\
  vector<vector<vector<T>>>(a, vector<vector<T>>(b, vector<T>(c, d)))
#define SP(a) setprecision(a)
#define SQRT(a) sqrt((long double)(a))
#define DPOW(a, b) pow((long double)(a), (long double)(b))
#define UNIQUE(vec)                                                            \\
  do {                                                                         \\
    sort(ALL((vec)));                                                          \\
    (vec).erase(std::unique(ALL((vec))), (vec).end());                         \\
  } while (0)

ll POW(ll n, ll m) {
  if (m == 0) {
    return 1;
  } else if (m % 2 == 0) {
    ll tmp = POW(n, m / 2);
    return (tmp * tmp);
  } else {
    return (n * POW(n, m - 1));
  }
}

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ll N, K;
  cin >> N >> K;
  vl A(N);
  REP(i, N) cin >> A[i];
  vl B;
  vl C;
  vl AA;
  ll zero = 0;
  REP(i, N) {
    if (A[i] < 0) {
      B.push_back(-A[i]);
      AA.push_back(-A[i]);
    } else if (A[i] > 0) {
      C.push_back(A[i]);
      AA.push_back(A[i]);
    } else {
      zero++;
      AA.push_back(0);
    }
  }
  // どうやっても0
  if (K > N - zero) {
    // cout << zero << endl;
    cout << 0 << endl;
    return 0;
  }
  // どうやっても-
  if ((K >= N - zero && B.size() % 2 == 1) || (C.size() == 0 && K % 2 == 1)) {
    if (zero > 0) {
      // cout << "b" << endl;
      cout << 0 << endl;
      return 0;
    } else {
      ll ans = MOD - 1;
      sort(ALL(AA));
      REP(i, K) ans = (ans * AA[i]) % MOD;
      cout << ans << endl;
      return 0;
    }
  }
  // cout << "c" << endl;

  sort(ALL(B), REV(ll));
  sort(ALL(C), REV(ll));

  vector<long double> BP;
  BP.push_back(0);
  AUTO(b, B) { BP.push_back(BP.back() + log(b)); }

  // REP(i, B.size() + 1) cout << BP[i] << endl;

  vector<long double> CP;
  CP.push_back(0);
  AUTO(c, C) { CP.push_back(CP.back() + log(c)); }

  // REP(i, C.size() + 1) cout << CP[i] << endl;

  ll maxi = -1;
  long double ma = -llINF;
  REP(i, (K / 2) + 1) {
    if (BP.size() <= (i * 2) || CP.size() <= (K - (i * 2)))
      continue;
    if (ma < BP[i * 2] + CP[K - (i * 2)]) {
      maxi = i;
      ma = BP[i * 2] + CP[K - (i * 2)];
    }
  }
  ll ans = 1;
  REP(i, maxi * 2) ans = (ans * B[i]) % MOD;
  REP(i, K - (maxi * 2)) ans = (ans * C[i]) % MOD;
  cout << ans << endl;

  return 0;
}


Error: 0

Fixed submission:

#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>

const int MOD = 1e9 + 7;
const int iINF = 2147483647 / 2;
const long long int llINF = 9223372036854775807 / 2;

using namespace std;
using ll = long long int;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;

typedef pair<ll, ll> pll;
bool paircomp(const pll &a, const pll &b) {
  if (a.first == b.first)
    return a.second < b.second;
  return a.first < b.first;
}

#define REP(i, n) for (ll i = 0; i < (n); i++)
#define RREP(i, n) for (ll i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define AUTO(i, m) for (auto &i : m)
#define ALL(a) (a).begin(), (a).end()
#define MAX(vec) *std::max_element(vec.begin(), vec.end())
#define MIN(vec) *std::min_element(vec.begin(), vec.end())
#define ARGMAX(vec)                                                            \\
  std::distance(vec.begin(), std::max_element(vec.begin(), vec.end()))
#define ARGMIN(vec)                                                            \\
  std::distance(vec.begin(), std::min_element(vec.begin(), vec.end()))
#define REV(T) greater<T>()
#define PQ(T) priority_queue<T, vector<T>, greater<T>>
#define VVL(a, b, c) vector<vector<ll>>(a, vector<ll>(b, c))
#define VV(T, a, b, c) vector<vector<T>>(a, vector<T>(b, c))
#define VVVL(a, b, c, d)                                                       \\
  vector<vector<vector<ll>>>(a, vector<vector<ll>>(b, vector<ll>(c, d)))
#define VVV(T, a, b, c, d)                                                     \\
  vector<vector<vector<T>>>(a, vector<vector<T>>(b, vector<T>(c, d)))
#define SP(a) setprecision(a)
#define SQRT(a) sqrt((long double)(a))
#define DPOW(a, b) pow((long double)(a), (long double)(b))
#define UNIQUE(vec)                                                            \\
  do {                                                                         \\
    sort(ALL((vec)));                                                          \\
    (vec).erase(std::unique(ALL((vec))), (vec).end());                         \\
  } while (0)

ll POW(ll n, ll m) {
  if (m == 0) {
    return 1;
  } else if (m % 2 == 0) {
    ll tmp = POW(n, m / 2);
    return (tmp * tmp);
  } else {
    return (n * POW(n, m - 1));
  }
}

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ll N, K;
  cin >> N >> K;
  vl A(N);
  REP(i, N) cin >> A[i];
  vl B;
  vl C;
  vl AA;
  ll zero = 0;
  REP(i, N) {
    if (A[i] < 0) {
      B.push_back(-A[i]);
      AA.push_back(-A[i]);
    } else if (A[i] > 0) {
      C.push_back(A[i]);
      AA.push_back(A[i]);
    } else {
      zero++;
      AA.push_back(0);
    }
  }
  // どうやっても0
  if (K > N - zero) {
    // cout << zero << endl;
    cout << 0 << endl;
    return 0;
  }
  // どうやっても-
  if ((K == N && B.size() % 2 == 1) || (C.size() == 0 && K % 2 == 1)) {
    if (zero > 0) {
      // cout << "b" << endl;
      cout << 0 << endl;
      return 0;
    } else {
      ll ans = MOD - 1;
      sort(ALL(AA));
      REP(i, K) ans = (ans * AA[i]) % MOD;
      cout << ans << endl;
      return 0;
    }
  }
  // cout << "c" << endl;

  sort(ALL(B), REV(ll));
  sort(ALL(C), REV(ll));

  long double po = -llINF;

  vector<long double> BP;
  BP.push_back(0);
  AUTO(b, B) { BP.push_back(BP.back() + log10(b)); }

  // REP(i, B.size() + 1) cout << BP[i] << endl;

  vector<long double> CP;
  CP.push_back(0);
  AUTO(c, C) { CP.push_back(CP.back() + log10(c)); }

  // REP(i, C.size() + 1) cout << CP[i] << endl;

  ll maxi = 0;
  long double ma = 0;
  REP(i, (K / 2) + 1) {
    if (ma < BP[i * 2] + CP[K - (i * 2)]) {
      maxi = i;
      ma = BP[i * 2] + CP[K - (i * 2)];
    }
  }
  ll ans = 1;
  REP(i, maxi * 2) ans = (ans * B[i]) % MOD;
  REP(i, K - (maxi * 2)) ans = (ans * C[i]) % MOD;
  cout << ans << endl;

  return 0;
}