Problem p02616 (C++)

Buggy submission (status: Runtime Error):
#pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
#define int long long
#define all(a) (a).begin(), (a).end()
#define fs first
#define sc second
#define xx first
#define yy second.first
#define zz second.second
#define H pair<int, int>
#define P pair<int, pair<int, int>>
#define Q(i, j, k) mkp(i, mkp(j, k))
#define rng(i, s, n) for (int i = (s); i < (n); i++)
#define rep(i, n) rng(i, 0, (n))
#define mkp make_pair
#define vec vector
#define vi vec<int>
#define pb emplace_back
#define siz(a) (int)(a).size()
#define crdcomp(b)                                                             \
  sort(all((b)));                                                              \
  (b).erase(unique(all((b))), (b).end())
#define getidx(b, i) lower_bound(all(b), (i)) - (b).begin()
#define ssp(i, n) (i == (int)(n)-1 ? "\n" : " ")
#define ctoi(c) (int)(c - '0')
#define itoc(c) (char)(c + '0')
#define cyes printf("Yes\n")
#define cno printf("No\n")
#define cdf(n)                                                                 \
  int quetimes_ = (n);                                                         \
  rep(qq123_, quetimes_)
#define gcj printf("Case #%lld: ", qq123_ + 1)
#define readv(a, n)                                                            \
  a.resize(n, 0);                                                              \
  rep(i, (n)) a[i] = read()
#define found(a, x) (a.find(x) != a.end())
// #define endl "\n"
constexpr int mod = 1e9 + 7;
constexpr int Mod = 998244353;
constexpr ld EPS = 1e-10;
constexpr ll inf = 3 * 1e18;
constexpr int Inf = 15 * 1e8;
constexpr int dx[] = {-1, 1, 0, 0}, dy[] = {0, 0, -1, 1};
template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
ll read() {
  ll u, k = scanf("%lld", &u);
  return u;
}
string reads() {
  string s;
  cin >> s;
  return s;
}
H readh(bool g = 0) {
  H u;
  int k = scanf("%lld %lld", &u.fs, &u.sc);
  if (g)
    u.fs--, u.sc--;
  return u;
}
bool ina(H t, int h, int w) {
  return 0 <= t.fs && t.fs < h && 0 <= t.sc && t.sc < w;
}
bool ina(int t, int l, int r) { return l <= t && t < r; }
ll gcd(ll i, ll j) { return j ? gcd(j, i % j) : i; }
ll popcount(ll x) {
  int sum = 0;
  for (int i = 0; i < 60; i++)
    if ((1ll << i) & x)
      sum++;
  return sum;
}
class mint {
public:
  ll v;
  mint(ll v = 0) { s(v % mod + mod); }
  constexpr static int mod = 1e9 + 7;
  constexpr static int fn_ = 3e5 + 5;
  static mint fact[fn_], comp[fn_];
  mint pow(int x) const {
    mint b(v), c(1);
    while (x) {
      if (x & 1)
        c *= b;
      b *= b;
      x >>= 1;
    }
    return c;
  }
  inline mint &s(int vv) {
    v = vv < mod ? vv : vv - mod;
    return *this;
  }
  inline mint inv() const { return pow(mod - 2); }
  inline mint operator-() const { return mint() - *this; }
  inline mint &operator+=(const mint b) { return s(v + b.v); }
  inline mint &operator-=(const mint b) { return s(v + mod - b.v); }
  inline mint &operator*=(const mint b) {
    v = v * b.v % mod;
    return *this;
  }
  inline mint &operator/=(const mint b) {
    v = v * b.inv().v % mod;
    return *this;
  }
  inline mint operator+(const mint b) const { return mint(v) += b; }
  inline mint operator-(const mint b) const { return mint(v) -= b; }
  inline mint operator*(const mint b) const { return mint(v) *= b; }
  inline mint operator/(const mint b) const { return mint(v) /= b; }
  friend ostream &operator<<(ostream &os, const mint &m) { return os << m.v; }
  friend istream &operator>>(istream &is, mint &m) {
    int x;
    is >> x;
    m = mint(x);
    return is;
  }
  bool operator<(const mint &r) const { return v < r.v; }
  bool operator>(const mint &r) const { return v > r.v; }
  bool operator<=(const mint &r) const { return v <= r.v; }
  bool operator>=(const mint &r) const { return v >= r.v; }
  bool operator==(const mint &r) const { return v == r.v; }
  bool operator!=(const mint &r) const { return v != r.v; }
  explicit operator bool() const { return v; }
  explicit operator int() const { return v; }
  mint comb(mint k) {
    if (k > *this)
      return mint();
    if (!fact[0])
      combinit();
    if (v >= fn_) {
      if (k > *this - k)
        k = *this - k;
      mint tmp(1);
      for (int i = v; i >= v - k.v + 1; i--)
        tmp *= mint(i);
      return tmp * comp[k.v];
    }
    return fact[v] * comp[k.v] * comp[v - k.v];
  } // nCk
  mint perm(mint k) {
    if (k > *this)
      return mint();
    if (!fact[0])
      combinit();
    if (v >= fn_) {
      mint tmp(1);
      for (int i = v; i >= v - k.v + 1; i--)
        tmp *= mint(i);
      return tmp;
    }
    return fact[v] * comp[v - k.v];
  }
  static void combinit() {
    fact[0] = 1;
    for (int i = 1; i < fn_; i++)
      fact[i] = fact[i - 1] * mint(i);
    comp[fn_ - 1] = fact[fn_ - 1].inv();
    for (int i = fn_ - 2; i >= 0; i--)
      comp[i] = comp[i + 1] * mint(i + 1);
  }
};
mint mint::fact[fn_], mint::comp[fn_];
//--------------------------------------------------------------

//---------------------------------------------------------------------
int n, k, gg;
mint solve(vi pos, vi neg) {
  vi v;
  rep(i, siz(neg) / 2) v.pb(neg[i * 2] * neg[i * 2 + 1]);

  int l = 0, r = 0;
  mint res = 1;
  while (l + r * 2 < k) {
    if ((l + r * 2) + 2 <= k && l + 1 < siz(pos) && r < siz(v)) {
      if (pos[l] * pos[l + 1] < v[r]) {
        res *= v[r++];
      } else {
        res *= pos[l++];
        res *= pos[l++];
      }
    } else if (l < siz(pos)) {
      res *= pos[l++];
    } else {
      res *= v[r++];
      res /= pos[--l];
    }
  }
  return res;
}
mint solve2(vi pos, vi neg) {

  mint res = 1;
  vi v;
  for (auto g : pos)
    v.pb(g);
  for (auto g : neg)
    v.pb(-g);
  // どうせ負になるんだから絶対値を最小にする
  sort(all(v));
  rep(i, k) res *= v[i];
  return res * -1;
}

vi a;
mt19937 rnd;
mint ans;
void generate() {
  a.clear();
  n = rnd() % 10 + 1;
  k = rnd() % n + 1;
  rep(i, n) a.pb((ll)rnd() % 30 - 10);
  int res = 1, r = -inf;
  rep(i, 1 << n) {
    res = 1;
    int sum = 0;
    rep(j, n) {
      if ((i >> j) & 1) {
        res *= a[j];
        sum++;
      }
    }
    if (sum == k)
      chmax(r, res);
  }
  ans = r;
}

signed main() {
  while (1) {
    // generate();
    cin >> n >> k;
    vi neg, pos;
    rep(i, n) {
      int v = read();
      if (v < 0)
        neg.pb(v);
      else if (v > 0)
        pos.pb(v);
    }

    mint res;

    if (siz(pos) + siz(neg) < k) {
      res = 0;
    } // 0を選ばざるを得ない
    else {
      sort(all(pos), greater<int>());
      sort(all(neg));

      if (((siz(pos) == 0 && k % 2) ||
           (siz(pos) + siz(neg) == k && siz(neg) % 2))) {
        if (siz(pos) + siz(neg) < n) {
          res = 0;
        } else
          res = solve2(pos, neg);
      } else {
        // 大きい順、小さい順で選んでいきまっせ
        res = solve(pos, neg);
      }
    }
    cout << res << endl;
    return 0;
    if (ans != res) {
      cout << n << " " << k << endl;
      rep(i, n) cout << a[i] << ssp(i, n);
      cout << ans << " " << res << endl;
      return 0;
    }
  }
}

Fixed submission:
#pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
#define int long long
#define all(a) (a).begin(), (a).end()
#define fs first
#define sc second
#define xx first
#define yy second.first
#define zz second.second
#define H pair<int, int>
#define P pair<int, pair<int, int>>
#define Q(i, j, k) mkp(i, mkp(j, k))
#define rng(i, s, n) for (int i = (s); i < (n); i++)
#define rep(i, n) rng(i, 0, (n))
#define mkp make_pair
#define vec vector
#define vi vec<int>
#define pb emplace_back
#define siz(a) (int)(a).size()
#define crdcomp(b)                                                             \
  sort(all((b)));                                                              \
  (b).erase(unique(all((b))), (b).end())
#define getidx(b, i) lower_bound(all(b), (i)) - (b).begin()
#define ssp(i, n) (i == (int)(n)-1 ? "\n" : " ")
#define ctoi(c) (int)(c - '0')
#define itoc(c) (char)(c + '0')
#define cyes printf("Yes\n")
#define cno printf("No\n")
#define cdf(n)                                                                 \
  int quetimes_ = (n);                                                         \
  rep(qq123_, quetimes_)
#define gcj printf("Case #%lld: ", qq123_ + 1)
#define readv(a, n)                                                            \
  a.resize(n, 0);                                                              \
  rep(i, (n)) a[i] = read()
#define found(a, x) (a.find(x) != a.end())
// #define endl "\n"
constexpr int mod = 1e9 + 7;
constexpr int Mod = 998244353;
constexpr ld EPS = 1e-10;
constexpr ll inf = 3 * 1e18;
constexpr int Inf = 15 * 1e8;
constexpr int dx[] = {-1, 1, 0, 0}, dy[] = {0, 0, -1, 1};
template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
ll read() {
  ll u, k = scanf("%lld", &u);
  return u;
}
string reads() {
  string s;
  cin >> s;
  return s;
}
H readh(bool g = 0) {
  H u;
  int k = scanf("%lld %lld", &u.fs, &u.sc);
  if (g)
    u.fs--, u.sc--;
  return u;
}
bool ina(H t, int h, int w) {
  return 0 <= t.fs && t.fs < h && 0 <= t.sc && t.sc < w;
}
bool ina(int t, int l, int r) { return l <= t && t < r; }
ll gcd(ll i, ll j) { return j ? gcd(j, i % j) : i; }
ll popcount(ll x) {
  int sum = 0;
  for (int i = 0; i < 60; i++)
    if ((1ll << i) & x)
      sum++;
  return sum;
}
class mint {
public:
  ll v;
  mint(ll v = 0) { s(v % mod + mod); }
  constexpr static int mod = 1e9 + 7;
  constexpr static int fn_ = 3e5 + 5;
  static mint fact[fn_], comp[fn_];
  mint pow(int x) const {
    mint b(v), c(1);
    while (x) {
      if (x & 1)
        c *= b;
      b *= b;
      x >>= 1;
    }
    return c;
  }
  inline mint &s(int vv) {
    v = vv < mod ? vv : vv - mod;
    return *this;
  }
  inline mint inv() const { return pow(mod - 2); }
  inline mint operator-() const { return mint() - *this; }
  inline mint &operator+=(const mint b) { return s(v + b.v); }
  inline mint &operator-=(const mint b) { return s(v + mod - b.v); }
  inline mint &operator*=(const mint b) {
    v = v * b.v % mod;
    return *this;
  }
  inline mint &operator/=(const mint b) {
    v = v * b.inv().v % mod;
    return *this;
  }
  inline mint operator+(const mint b) const { return mint(v) += b; }
  inline mint operator-(const mint b) const { return mint(v) -= b; }
  inline mint operator*(const mint b) const { return mint(v) *= b; }
  inline mint operator/(const mint b) const { return mint(v) /= b; }
  friend ostream &operator<<(ostream &os, const mint &m) { return os << m.v; }
  friend istream &operator>>(istream &is, mint &m) {
    int x;
    is >> x;
    m = mint(x);
    return is;
  }
  bool operator<(const mint &r) const { return v < r.v; }
  bool operator>(const mint &r) const { return v > r.v; }
  bool operator<=(const mint &r) const { return v <= r.v; }
  bool operator>=(const mint &r) const { return v >= r.v; }
  bool operator==(const mint &r) const { return v == r.v; }
  bool operator!=(const mint &r) const { return v != r.v; }
  explicit operator bool() const { return v; }
  explicit operator int() const { return v; }
  mint comb(mint k) {
    if (k > *this)
      return mint();
    if (!fact[0])
      combinit();
    if (v >= fn_) {
      if (k > *this - k)
        k = *this - k;
      mint tmp(1);
      for (int i = v; i >= v - k.v + 1; i--)
        tmp *= mint(i);
      return tmp * comp[k.v];
    }
    return fact[v] * comp[k.v] * comp[v - k.v];
  } // nCk
  mint perm(mint k) {
    if (k > *this)
      return mint();
    if (!fact[0])
      combinit();
    if (v >= fn_) {
      mint tmp(1);
      for (int i = v; i >= v - k.v + 1; i--)
        tmp *= mint(i);
      return tmp;
    }
    return fact[v] * comp[v - k.v];
  }
  static void combinit() {
    fact[0] = 1;
    for (int i = 1; i < fn_; i++)
      fact[i] = fact[i - 1] * mint(i);
    comp[fn_ - 1] = fact[fn_ - 1].inv();
    for (int i = fn_ - 2; i >= 0; i--)
      comp[i] = comp[i + 1] * mint(i + 1);
  }
};
mint mint::fact[fn_], mint::comp[fn_];
//--------------------------------------------------------------

//---------------------------------------------------------------------
int n, k, gg;
mint solve(vi pos, vi neg) {
  vi v;
  rep(i, siz(neg) / 2) v.pb(neg[i * 2] * neg[i * 2 + 1]);

  int l = 0, r = 0;
  mint res = 1;
  while (l + r * 2 < k) {
    if ((l + r * 2) + 2 <= k && l + 1 < siz(pos) && r < siz(v)) {
      if (pos[l] * pos[l + 1] < v[r]) {
        res *= v[r++];
      } else {
        res *= pos[l++];
        res *= pos[l++];
      }
    } else if (l < siz(pos)) {
      res *= pos[l++];
    } else {
      res *= v[r++];
    }
  }
  while (r * 2 + l > k) {
    res /= pos[--l];
  }
  return res;
}
mint solve2(vi pos, vi neg) {

  mint res = 1;
  vi v;
  for (auto g : pos)
    v.pb(g);
  for (auto g : neg)
    v.pb(-g);
  // どうせ負になるんだから絶対値を最小にする
  sort(all(v));
  rep(i, k) res *= v[i];
  return res * -1;
}

vi a;
mt19937 rnd;
mint ans;
void generate() {
  a.clear();
  n = rnd() % 10 + 1;
  k = rnd() % n + 1;
  rep(i, n) a.pb((ll)rnd() % 30 - 10);
  int res = 1, r = -inf;
  rep(i, 1 << n) {
    res = 1;
    int sum = 0;
    rep(j, n) {
      if ((i >> j) & 1) {
        res *= a[j];
        sum++;
      }
    }
    if (sum == k)
      chmax(r, res);
  }
  ans = r;
}

signed main() {
  while (1) {
    // generate();
    cin >> n >> k;
    vi neg, pos;
    rep(i, n) {
      int v = read();
      if (v < 0)
        neg.pb(v);
      else if (v > 0)
        pos.pb(v);
    }

    mint res;

    if (siz(pos) + siz(neg) < k) {
      res = 0;
    } // 0を選ばざるを得ない
    else {
      sort(all(pos), greater<int>());
      sort(all(neg));

      if (((siz(pos) == 0 && k % 2) ||
           (siz(pos) + siz(neg) == k && siz(neg) % 2))) {
        if (siz(pos) + siz(neg) < n) {
          res = 0;
        } else
          res = solve2(pos, neg);
      } else {
        // 大きい順、小さい順で選んでいきまっせ
        res = solve(pos, neg);
      }
    }
    cout << res << endl;
    return 0;
    if (ans != res) {
      cout << n << " " << k << endl;
      rep(i, n) cout << a[i] << ssp(i, n);
      cout << ans << " " << res << endl;
      return 0;
    }
  }
}