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

#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;

#define rep(i, n) for (lint i = 0; i < n; i++)
#define repr(i, n) for (lint i = n - 1; i >= 0; i--)
#define repi(i, ini, n) for (lint i = ini; i < n; i++)
#define repir(i, ini, n) for (lint i = n - 1; i >= ini; i--)
#define repb(i, start, end) for (lint i = start; i <= end; i++)
#define repbr(i, start, end) for (lint i = end; i >= start; i--)

#define bit(n) (1LL << (n))

#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rg(v, ini, end) v.begin() + ini, v.begin() + end
#define rrg(v, ini, end) v.rbegin() + ini, v.rbegin() + end

#define ret return 0;
#define chmax(a, b) a = mmax(a, b)
#define chmin(a, b) a = mmin(a, b)

namespace {

using lint = long long;
using ulint = unsigned long long;
using ld = long double;
struct xy {
  lint x, y;
  xy() : x(0), y(0) {}
  xy(lint _x, lint _y) : x(_x), y(_y) {}
  xy operator+(const xy &p) const { return xy(x + p.x, y + p.y); }
  bool operator<(xy p) const {
    if (y == p.y)
      return x < p.x;
    return y < p.y;
  }
};
struct xyd {
  ld x, y;
  xyd() : x(0), y(0) {}
  xyd(long double _x, long double _y) : x(_x), y(_y) {}
};
using vec = vector<lint>;
using vecd = vector<ld>;
using vecs = vector<string>;
using vecp = vector<xy>;
template <class T> using vect = vector<T>;
class vec2 : public vector<vector<lint>> {
public:
  vec2() {}
  vec2(lint n) : vector(n) {}
  vec2(lint h, lint w) : vector(h, vector<lint>(w)) {}
  vec2(lint h, lint w, lint v) : vector(h, vector<lint>(w, v)) {}
};

template <class T> using priq = priority_queue<T>;
template <class T> using rpriq = priority_queue<T, vector<T>, greater<T>>;
template <class Key, class Val> using hashmap = unordered_map<Key, Val>;
template <class Key> using hashset = unordered_set<Key>;

mt19937 mtrand((random_device())());

const double pi = 3.141592653589793238462;
const lint intmax = 9223372036854775807;
const lint inf = 1100100100100100100LL;

template <class T> constexpr auto msum(T arg0) { return arg0; }

template <class T, class... Types> constexpr auto msum(T arg0, Types... args) {
  static_assert(sizeof...(args) > 0, "arg err");

  return arg0 + msum(args...);
}

template <class It> constexpr typename It::value_type mmax(It begin, It end) {
  return *max_element(begin, end);
}

template <class It> constexpr typename It::value_type mmin(It begin, It end) {
  return *min_element(begin, end);
}

template <class T> constexpr auto mmax(T arg) { return arg; }

template <class T, class... Types> constexpr auto mmax(T arg0, Types... args) {
  using promote_t = decltype(msum(arg0, args...));

  return max(static_cast<promote_t>(arg0),
             static_cast<promote_t>(mmax(args...)));
}

template <class T> constexpr auto mmin(T arg) { return arg; }

template <class T, class... Types> constexpr auto mmin(T arg0, Types... args) {
  using promote_t = decltype(msum(arg0, args...));

  return min(static_cast<promote_t>(arg0),
             static_cast<promote_t>(mmin(args...)));
}

template <class T> struct Mplus {
  T operator()(const T &a, const T &b) { return a + b; }

  const static T id = T(0);
};

template <class It, class T = typename It::value_type, class Monoid = Mplus<T>>
T acc(It begin, It end, Monoid f = Mplus<T>()) {
  return accumulate(begin, end, Monoid::id, f);
}

constexpr auto clamp(lint val, lint left, lint right) {
  return mmax(mmin(val, right), left);
}

constexpr lint div2(lint p, lint q) { return (p + q - 1) / q; }

#if (__cplusplus < 201703L)

lint gcd(lint a, lint b) {
  while (1) {
    if (a < b)
      swap(a, b);
    if (!b)
      break;
    a %= b;
  }
  return a;
}

lint lcm(lint a, lint b) { return a / gcd(a, b) * b; }

#endif

constexpr lint powInt(lint a, lint b) {
  if (b == 0) {
    return 1;
  }
  if (b == 1) {
    return a;
  }
  lint tmp = powInt(a, b / 2);
  return (b % 2 == 1 ? a * tmp * tmp : tmp * tmp);
}

template <class T> T sgn(T val) {
  if (val == T(0))
    return T(0);
  if (val < 0)
    return T(-1);
  if (val > 0)
    return T(1);
}

template <class T> constexpr auto modK_belowN(T k, T MOD, T n) {
  return (n + MOD - k - 1) / MOD;
}

template <class T, class Val> bool exist(const T &m, const Val &val) {
  return m.count(val) > 0;
}

template <class It, class T> bool exist(It begin, It end, const T &val) {
  return find(begin, end, val) != end;
}

template <class It, class Pr> bool exist_if(It begin, It end, Pr pred) {
  return find_if(begin, end, pred) != end;
}

template <class T> bool between(T val, T l, T r) {
  return (val >= l) && (val <= r);
}

lint extGCD(lint a, lint b, lint &x, lint &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  lint d = extGCD(b, a % b, y, x);
  y -= a / b * x;
  return d;
}

template <class It> auto carr(It begin, It end) {
  vec c;
  c.push_back(1);
  auto before = *begin;
  for (auto it = begin + 1; it != end; it++) {
    if (before != *it) {
      c.push_back(0);
      before = *it;
    }
    c.back()++;
  }
  return c;
}

template <class T> struct nval {
  lint n;
  T val;
  nval() : n(0){};
  nval(lint _n, T _val) : n(_n), val(_val){};
};

template <class It> auto carr2(It begin, It end) {
  using T = nval<remove_reference_t<decltype(*begin)>>;

  vect<T> c;
  c.push_back(T(1, *begin));
  auto before = *begin;
  for (auto it = begin + 1; it != end; it++) {
    if (before != *it) {
      c.push_back(T(0, *it));
      before = *it;
    }
    c.back().n++;
  }
  return c;
}

template <class It, class... T> void sort2(It begin, It end, T... p) {
  using val_t = remove_reference_t<decltype(*begin)>;

  sort(begin, end, [p...](const val_t &a, const val_t &b) {
    bool neq[] = {(a.*p != b.*p)...};
    bool sg[] = {(a.*p < b.*p)...};

    rep(i, sizeof...(p)) {
      if (neq[i]) {
        return sg[i];
      }
    }
    return false;
  });
}

template <class It, class It2> auto spacel(It i, It2 end) {
  if (i + 1 == end) {
    return '\\n';
  } else {
    return ' ';
  }
}

bool match(string s, string r) { return regex_match(s, regex(r)); }

ostream &setp(ostream &ost) {
  cout << setprecision(60) << fixed;
  return ost;
}

#ifdef _LOCAL
auto &dbg = cout;
#else
struct dummy_cout {
  template <class T> dummy_cout &operator<<(T &&op) { return *this; }

  using endl_t = basic_ostream<char, char_traits<char>>;

  dummy_cout &operator<<(endl_t &(*)(endl_t &)) { return *this; }
};

dummy_cout dbg;
#endif

const ulint mod = 1000000007;
// const ulint mod = 998244353;
const ld eps = 0.0000001;
}; // namespace

struct mint {
  lint n;
  mint() { n = 0; }
  mint(lint a) { n = a % mod; }
  mint &operator+=(mint a) {
    n += a.n;
    n %= mod;
    return *this;
  }
  mint &operator-=(mint a) {
    n += mod;
    n -= a.n;
    n %= mod;
    return *this;
  }
  mint &operator*=(mint a) {
    n *= a.n;
    n %= mod;
    return *this;
  }
  mint &operator%=(mint a) {
    n %= a.n;
    return *this;
  }
  mint &operator++() {
    n++;
    n %= mod;
    return *this;
  }
  mint &operator--() {
    n += mod;
    n--;
    n %= mod;
    return *this;
  }
};

mint operator+(mint a, mint b) {
  a += b;
  return a;
}
mint operator-(mint a, mint b) {
  a -= b;
  return a;
}
mint operator*(mint a, mint b) {
  a *= b;
  return a;
}

mint powMod(mint x, lint y) {
  if (x.n <= 1) {
    return x;
  }
  if (y == 0) {
    return 1;
  } else if (y == 1) {
    return x;
  } else if (y % 2 == 0) {
    mint tmp = powMod(x, y / 2);
    return tmp * tmp;
  } else {
    mint tmp = powMod(x, y / 2);
    return tmp * tmp * x;
  }
}
mint modinv(mint n) { return powMod(n, mod - 2); }

mint dp[200010];

int main() {
  lint n, k;
  cin >> n >> k;

  vec a(n);
  rep(i, n) cin >> a[i];

  sort(rall(a), [](lint p, lint q) {
    if (abs(p) == abs(q))
      return p < q;
    return abs(p) < abs(q);
  });

  mint ans = 1;
  lint mn = 0, lm = -1, lp = -1, z = 0;
  rep(i, k) {
    if (a[i] == 0)
      z = 1;
    ans *= abs(a[i]);
    if (a[i] < 0)
      ++mn;

    if (a[i] > 0)
      lp = i;
    if (a[i] < 0)
      lm = i;
  }

  if (mn % 2 == 0) {
    cout << ans.n << endl;
    ret;
  }

  if (z || k == n) {
    if (mn % 2 == 1) {
      ans = 0 - ans;
    }
    cout << ans.n << endl;
    ret;
  }

  lint lm2 = -1, lp2 = -1;
  repi(i, lm + 1, n) {
    if (a[i] < 0) {
      lm2 = i;
      break;
    }
  }
  repi(i, lp + 1, n) {
    if (a[i] > 0) {
      lp2 = i;
      break;
    }
  }

  if (lm != -1 && lp2 != -1 && lp != -1 && lm2 != -1) {
    if (abs(a[lp2]) * abs(a[lp]) > abs(a[lm2]) * abs(a[lm])) {
      ans *= abs(a[lp2]);
      ans *= modinv(abs(a[lm]));
    } else {
      ans *= abs(a[lm2]);
      ans *= modinv(abs(a[lp]));
    }
    cout << ans.n << endl;
    ret;
  }

  if (lm != -1 && lp2 != -1 && (lp == -1 || lm2 == -1)) {
    ans *= abs(a[lp2]);
    ans *= modinv(abs(a[lm]));
    cout << ans.n << endl;
    ret;
  }
  if (lp != -1 && lm2 != -1 && (lm == -1 || lp2 == -1)) {
    ans *= abs(a[lm2]);
    ans *= modinv(abs(a[lp]));
    cout << ans.n << endl;
    ret;
  }

  if (lp2 == -1 && lm2 == -1) {
    cout << 0 << endl;
    ret;
  }

  if (exist(all(a), 0))
    cout << 0 << endl;
  else {
    sort(rall(a));
    ans = 1;
    rep(i, k) { ans *= abs(a[i]); }
    ans = 0 - ans;
    cout << ans.n << endl;
  }

  return 0;
}


Error: 0

Fixed submission:

#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;

#define rep(i, n) for (lint i = 0; i < n; i++)
#define repr(i, n) for (lint i = n - 1; i >= 0; i--)
#define repi(i, ini, n) for (lint i = ini; i < n; i++)
#define repir(i, ini, n) for (lint i = n - 1; i >= ini; i--)
#define repb(i, start, end) for (lint i = start; i <= end; i++)
#define repbr(i, start, end) for (lint i = end; i >= start; i--)

#define bit(n) (1LL << (n))

#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rg(v, ini, end) v.begin() + ini, v.begin() + end
#define rrg(v, ini, end) v.rbegin() + ini, v.rbegin() + end

#define ret return 0;
#define chmax(a, b) a = mmax(a, b)
#define chmin(a, b) a = mmin(a, b)

namespace {

using lint = long long;
using ulint = unsigned long long;
using ld = long double;
struct xy {
  lint x, y;
  xy() : x(0), y(0) {}
  xy(lint _x, lint _y) : x(_x), y(_y) {}
  xy operator+(const xy &p) const { return xy(x + p.x, y + p.y); }
  bool operator<(xy p) const {
    if (y == p.y)
      return x < p.x;
    return y < p.y;
  }
};
struct xyd {
  ld x, y;
  xyd() : x(0), y(0) {}
  xyd(long double _x, long double _y) : x(_x), y(_y) {}
};
using vec = vector<lint>;
using vecd = vector<ld>;
using vecs = vector<string>;
using vecp = vector<xy>;
template <class T> using vect = vector<T>;
class vec2 : public vector<vector<lint>> {
public:
  vec2() {}
  vec2(lint n) : vector(n) {}
  vec2(lint h, lint w) : vector(h, vector<lint>(w)) {}
  vec2(lint h, lint w, lint v) : vector(h, vector<lint>(w, v)) {}
};

template <class T> using priq = priority_queue<T>;
template <class T> using rpriq = priority_queue<T, vector<T>, greater<T>>;
template <class Key, class Val> using hashmap = unordered_map<Key, Val>;
template <class Key> using hashset = unordered_set<Key>;

mt19937 mtrand((random_device())());

const double pi = 3.141592653589793238462;
const lint intmax = 9223372036854775807;
const lint inf = 1100100100100100100LL;

template <class T> constexpr auto msum(T arg0) { return arg0; }

template <class T, class... Types> constexpr auto msum(T arg0, Types... args) {
  static_assert(sizeof...(args) > 0, "arg err");

  return arg0 + msum(args...);
}

template <class It> constexpr typename It::value_type mmax(It begin, It end) {
  return *max_element(begin, end);
}

template <class It> constexpr typename It::value_type mmin(It begin, It end) {
  return *min_element(begin, end);
}

template <class T> constexpr auto mmax(T arg) { return arg; }

template <class T, class... Types> constexpr auto mmax(T arg0, Types... args) {
  using promote_t = decltype(msum(arg0, args...));

  return max(static_cast<promote_t>(arg0),
             static_cast<promote_t>(mmax(args...)));
}

template <class T> constexpr auto mmin(T arg) { return arg; }

template <class T, class... Types> constexpr auto mmin(T arg0, Types... args) {
  using promote_t = decltype(msum(arg0, args...));

  return min(static_cast<promote_t>(arg0),
             static_cast<promote_t>(mmin(args...)));
}

template <class T> struct Mplus {
  T operator()(const T &a, const T &b) { return a + b; }

  const static T id = T(0);
};

template <class It, class T = typename It::value_type, class Monoid = Mplus<T>>
T acc(It begin, It end, Monoid f = Mplus<T>()) {
  return accumulate(begin, end, Monoid::id, f);
}

constexpr auto clamp(lint val, lint left, lint right) {
  return mmax(mmin(val, right), left);
}

constexpr lint div2(lint p, lint q) { return (p + q - 1) / q; }

#if (__cplusplus < 201703L)

lint gcd(lint a, lint b) {
  while (1) {
    if (a < b)
      swap(a, b);
    if (!b)
      break;
    a %= b;
  }
  return a;
}

lint lcm(lint a, lint b) { return a / gcd(a, b) * b; }

#endif

constexpr lint powInt(lint a, lint b) {
  if (b == 0) {
    return 1;
  }
  if (b == 1) {
    return a;
  }
  lint tmp = powInt(a, b / 2);
  return (b % 2 == 1 ? a * tmp * tmp : tmp * tmp);
}

template <class T> T sgn(T val) {
  if (val == T(0))
    return T(0);
  if (val < 0)
    return T(-1);
  if (val > 0)
    return T(1);
}

template <class T> constexpr auto modK_belowN(T k, T MOD, T n) {
  return (n + MOD - k - 1) / MOD;
}

template <class T, class Val> bool exist(const T &m, const Val &val) {
  return m.count(val) > 0;
}

template <class It, class T> bool exist(It begin, It end, const T &val) {
  return find(begin, end, val) != end;
}

template <class It, class Pr> bool exist_if(It begin, It end, Pr pred) {
  return find_if(begin, end, pred) != end;
}

template <class T> bool between(T val, T l, T r) {
  return (val >= l) && (val <= r);
}

lint extGCD(lint a, lint b, lint &x, lint &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  lint d = extGCD(b, a % b, y, x);
  y -= a / b * x;
  return d;
}

template <class It> auto carr(It begin, It end) {
  vec c;
  c.push_back(1);
  auto before = *begin;
  for (auto it = begin + 1; it != end; it++) {
    if (before != *it) {
      c.push_back(0);
      before = *it;
    }
    c.back()++;
  }
  return c;
}

template <class T> struct nval {
  lint n;
  T val;
  nval() : n(0){};
  nval(lint _n, T _val) : n(_n), val(_val){};
};

template <class It> auto carr2(It begin, It end) {
  using T = nval<remove_reference_t<decltype(*begin)>>;

  vect<T> c;
  c.push_back(T(1, *begin));
  auto before = *begin;
  for (auto it = begin + 1; it != end; it++) {
    if (before != *it) {
      c.push_back(T(0, *it));
      before = *it;
    }
    c.back().n++;
  }
  return c;
}

template <class It, class... T> void sort2(It begin, It end, T... p) {
  using val_t = remove_reference_t<decltype(*begin)>;

  sort(begin, end, [p...](const val_t &a, const val_t &b) {
    bool neq[] = {(a.*p != b.*p)...};
    bool sg[] = {(a.*p < b.*p)...};

    rep(i, sizeof...(p)) {
      if (neq[i]) {
        return sg[i];
      }
    }
    return false;
  });
}

template <class It, class It2> auto spacel(It i, It2 end) {
  if (i + 1 == end) {
    return '\\n';
  } else {
    return ' ';
  }
}

bool match(string s, string r) { return regex_match(s, regex(r)); }

ostream &setp(ostream &ost) {
  cout << setprecision(60) << fixed;
  return ost;
}

#ifdef _LOCAL
auto &dbg = cout;
#else
struct dummy_cout {
  template <class T> dummy_cout &operator<<(T &&op) { return *this; }

  using endl_t = basic_ostream<char, char_traits<char>>;

  dummy_cout &operator<<(endl_t &(*)(endl_t &)) { return *this; }
};

dummy_cout dbg;
#endif

const ulint mod = 1000000007;
// const ulint mod = 998244353;
const ld eps = 0.0000001;
}; // namespace

struct mint {
  lint n;
  mint() { n = 0; }
  mint(lint a) { n = a % mod; }
  mint &operator+=(mint a) {
    n += a.n;
    n %= mod;
    return *this;
  }
  mint &operator-=(mint a) {
    n += mod;
    n -= a.n;
    n %= mod;
    return *this;
  }
  mint &operator*=(mint a) {
    n *= a.n;
    n %= mod;
    return *this;
  }
  mint &operator%=(mint a) {
    n %= a.n;
    return *this;
  }
  mint &operator++() {
    n++;
    n %= mod;
    return *this;
  }
  mint &operator--() {
    n += mod;
    n--;
    n %= mod;
    return *this;
  }
};

mint operator+(mint a, mint b) {
  a += b;
  return a;
}
mint operator-(mint a, mint b) {
  a -= b;
  return a;
}
mint operator*(mint a, mint b) {
  a *= b;
  return a;
}

mint dp[200010];

int main() {
  lint n, k;
  cin >> n >> k;

  vec a(n);
  rep(i, n) cin >> a[i];

  if (n == k) {
    mint ans = 1;
    rep(i, n) {
      ans *= abs(a[i]);
      if (a[i] < 0)
        ans = 0 - ans;
    }

    cout << ans.n << endl;
    ret;
  }

  lint mn = 0, zn = 0, pn = 0;
  vec m, p;

  rep(i, n) {
    if (a[i] < 0) {
      mn++;
      m.push_back(abs(a[i]));
    } else if (a[i] > 0) {
      pn++;
      p.push_back(a[i]);
    } else
      zn++;
  }

  sort(rall(m));
  sort(rall(p));

  if (n - zn < k) {
    cout << 0 << endl;
    ret;
  }

  if (pn == 0) {
    if (k % 2 == 0) {
      mint ans = 1;
      rep(i, k) { ans *= m[i]; }
      cout << ans.n << endl;
    } else {
      if (zn > 0)
        cout << 0 << endl;
      else {
        reverse(all(m));
        mint ans = 1;
        rep(i, k) { ans *= m[i]; }
        ans = 0 - ans;
        cout << ans.n << endl;
      }
    }
    ret;
  }

  if (mn == 0) {
    mint ans = 1;
    rep(i, k) { ans *= p[i]; }
    cout << ans.n << endl;
    ret;
  }

  mint ans = 1;

  lint mp = 0, pp = 0;
  rep(i, k - 1) {
    if (mn - mp >= 2 && pn - pp >= 1 && m[mp] > p[pp] || pn - pp == 0) {
      ans *= m[mp];
      mp++;
    } else {
      ans *= m[pp];
      pp++;
    }
  }

  if (mp % 2 == 1) {
    ans *= m[mp];
  } else {
    ans *= p[pp];
  }

  cout << ans.n << endl;

  return 0;
}