結果

問題 No.1463 Hungry Kanten
コンテスト
ユーザー stoq
提出日時 2021-04-09 19:31:17
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 285 ms / 2,000 ms
コード長 4,773 bytes
コンパイル時間 2,052 ms
コンパイル使用メモリ 206,192 KB
実行使用メモリ 19,968 KB
最終ジャッジ日時 2025-06-20 01:36:18
合計ジャッジ時間 3,558 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 24
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define MOD_TYPE 1

#pragma region Macros

#include <bits/stdc++.h>
using namespace std;

#if 0
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using Int = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
#endif
#if 1
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;

constexpr ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);
constexpr int INF = (int)1e9 + 10;
constexpr ll LINF = (ll)4e18;
constexpr ld PI = acos(-1.0);
constexpr ld EPS = 1e-9;
constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};

#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)
#define repi(i, n) REPI(i, 0, n)
#define MP make_pair
#define MT make_tuple
#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"
#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"
#define possible(n) cout << ((n) ? "possible" : "impossible") << "\n"
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n"
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << "\n";

struct io_init
{
  io_init()
  {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << setprecision(30) << setiosflags(ios::fixed);
  };
} io_init;
template <typename T>
inline bool chmin(T &a, T b)
{
  if (a > b)
  {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
inline bool chmax(T &a, T b)
{
  if (a < b)
  {
    a = b;
    return true;
  }
  return false;
}
inline ll CEIL(ll a, ll b)
{
  return (a + b - 1) / b;
}
template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val)
{
  fill((T *)array, (T *)(array + N), val);
}
template <typename T, typename U>
constexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept
{
  is >> p.first >> p.second;
  return is;
}
template <typename T, typename U>
constexpr ostream &operator<<(ostream &os, pair<T, U> &p) noexcept
{
  os << p.first << " " << p.second;
  return os;
}
#pragma endregion

// --------------------------------------

struct Hash
{
  static constexpr ll M1 = (1LL << 61) - 1;
  static constexpr ll M2 = (1LL << 31) - 1;
  ll val1, val2;

  constexpr Hash(ll val = 0) noexcept
      : val1(val), val2(val % M2)
  {
    if (val1 >= M1)
      val1 -= M1;
  }

  constexpr Hash(ll val1, ll val2) noexcept
      : val1(val1), val2(val2 % M2)
  {
    if (val1 >= M1)
      val1 -= M1;
  }

  constexpr Hash operator-() const noexcept
  {
    return Hash(val1 ? M1 - val1 : 0, val2 ? M2 - val2 : 0);
  }
  constexpr Hash operator+=(const Hash &h) noexcept
  {
    val1 += h.val1;
    if (val1 > M1)
      val1 -= M1;
    val2 += h.val2;
    if (val2 > M2)
      val2 -= M2;
    return *this;
  }
  constexpr Hash operator-=(const Hash &h) noexcept
  {
    val1 -= h.val1;
    if (val1 < 0)
      val1 += M1;
    val2 -= h.val2;
    if (val2 < 0)
      val2 += M2;
    return *this;
  }
  Hash operator*=(const Hash &h) noexcept
  {
    __int128 t;
    t = val1;
    t *= h.val1;
    t = (t >> 61) + (t & M1);
    if (t >= M1)
      t -= M1;
    val1 = ll(t);
    val2 *= h.val2;
    val2 = (val2 >> 31) + (val2 & M2);
    if (val2 >= M2)
      val2 -= M2;
    return *this;
  }
  constexpr Hash operator+(const Hash &h) const noexcept
  {
    return Hash(*this) += h;
  }
  constexpr Hash operator-(const Hash &h) const noexcept
  {
    return Hash(*this) -= h;
  }
  Hash operator*(const Hash &h) const noexcept
  {
    return Hash(*this) *= h;
  }
  constexpr bool operator==(const Hash &h) const noexcept
  {
    return val1 == h.val1 and val2 == h.val2;
  }
  constexpr bool operator!=(const Hash &h) const noexcept
  {
    return !(*this == h);
  }
  constexpr bool operator<(const Hash &h) const noexcept
  {
    return val1 == h.val1 ? val2 < h.val2 : val1 < h.val1;
  }
  friend ostream &operator<<(ostream &os, const Hash &h) noexcept
  {
    return os << "(" << h.val1 << ", " << h.val2 << ")";
  }
};

void solve()
{
  int n, k;
  cin >> n >> k;
  vector<int> a(n);
  rep(i, n) cin >> a[i];
  set<Hash> st;
  rep(msk, 1 << n)
  {
    if (__builtin_popcount(msk) < k)
      continue;
    Hash sum = 0, prod = 1;
    rep(i, n)
    {
      if (!((1 << i) & msk))
        continue;
      sum += a[i];
      prod *= a[i];
    }
    st.insert(sum);
    st.insert(prod);
  }
  cout << st.size() << "\n";
}

int main()
{
  solve();
}
0