#879410 (C++17) No.2345 max(l,r)

提出ソース

結果

問題	No.2345 max(l,r)
ユーザー	そすうぽよ
提出日時	2023-06-09 23:26:41
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	362 ms / 2,000 ms
コード長	7,545 bytes
コンパイル時間	2,649 ms
コンパイル使用メモリ	231,108 KB
実行使用メモリ	15,320 KB
最終ジャッジ日時	2024-06-10 14:34:35
合計ジャッジ時間	7,996 ms
ジャッジサーバーID （参考情報）	judge1 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	6 ms 6,816 KB
testcase_01	AC	85 ms 6,940 KB
testcase_02	AC	61 ms 6,940 KB
testcase_03	AC	65 ms 6,944 KB
testcase_04	AC	64 ms 6,940 KB
testcase_05	AC	63 ms 6,940 KB
testcase_06	AC	64 ms 6,944 KB
testcase_07	AC	62 ms 6,944 KB
testcase_08	AC	63 ms 6,940 KB
testcase_09	AC	63 ms 6,940 KB
testcase_10	AC	62 ms 6,940 KB
testcase_11	AC	63 ms 6,944 KB
testcase_12	AC	63 ms 6,948 KB
testcase_13	AC	64 ms 6,940 KB
testcase_14	AC	62 ms 6,944 KB
testcase_15	AC	62 ms 6,940 KB
testcase_16	AC	63 ms 6,940 KB
testcase_17	AC	64 ms 6,944 KB
testcase_18	AC	62 ms 6,944 KB
testcase_19	AC	64 ms 6,940 KB
testcase_20	AC	64 ms 6,940 KB
testcase_21	AC	65 ms 6,944 KB
testcase_22	AC	68 ms 15,256 KB
testcase_23	AC	71 ms 15,320 KB
testcase_24	AC	22 ms 9,000 KB
testcase_25	AC	28 ms 6,940 KB
testcase_26	AC	27 ms 6,940 KB
testcase_27	AC	26 ms 6,940 KB
testcase_28	AC	15 ms 7,296 KB
testcase_29	AC	23 ms 7,168 KB
testcase_30	AC	11 ms 6,944 KB
testcase_31	AC	31 ms 7,808 KB
testcase_32	AC	16 ms 6,940 KB
testcase_33	AC	19 ms 7,168 KB
testcase_34	AC	6 ms 6,944 KB
testcase_35	AC	10 ms 6,944 KB
testcase_36	AC	12 ms 6,940 KB
testcase_37	AC	16 ms 7,040 KB
testcase_38	AC	36 ms 7,808 KB
testcase_39	AC	59 ms 8,704 KB
testcase_40	AC	44 ms 7,936 KB
testcase_41	AC	36 ms 7,808 KB
testcase_42	AC	42 ms 8,064 KB
testcase_43	AC	39 ms 7,936 KB
testcase_44	AC	56 ms 8,576 KB
testcase_45	AC	81 ms 11,544 KB
testcase_46	AC	75 ms 10,284 KB
testcase_47	AC	43 ms 8,064 KB
testcase_48	AC	20 ms 6,944 KB
testcase_49	AC	21 ms 6,940 KB
testcase_50	AC	22 ms 6,944 KB
testcase_51	AC	21 ms 6,940 KB
testcase_52	AC	21 ms 6,940 KB
testcase_53	AC	20 ms 6,944 KB
testcase_54	AC	21 ms 6,944 KB
testcase_55	AC	20 ms 6,944 KB
testcase_56	AC	22 ms 6,940 KB
testcase_57	AC	22 ms 6,940 KB
testcase_58	AC	36 ms 6,944 KB
testcase_59	AC	35 ms 6,940 KB
testcase_60	AC	35 ms 6,944 KB
testcase_61	AC	34 ms 6,940 KB
testcase_62	AC	36 ms 6,940 KB
testcase_63	AC	35 ms 6,940 KB
testcase_64	AC	36 ms 6,940 KB
testcase_65	AC	36 ms 6,944 KB
testcase_66	AC	36 ms 6,940 KB
testcase_67	AC	36 ms 6,944 KB
testcase_68	AC	362 ms 6,944 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>

#include <variant>

#define rep2(i, k, n) for (i64 i = (i64)(k); i < (i64)(n); i++)
#define rep(i, n) rep2(i, 0, n)
#define all(x) begin(x), end(x)
#ifdef ENV_LOCAL
#define dump \
  if (1) cerr
#else
#define dump \
  if (0) cerr
#endif

using namespace std;
using namespace std::string_literals;

using i32 = int32_t;
using i64 = int64_t;
using f64 = double;
using f80 = long double;
using vi32 = vector<i32>;
using vi64 = vector<i64>;

/*
 * harudake::modint
 *
 * Copyright (c) 2021 prime number
 *
 * This software is released under the MIT license.
 * see https://opensource.org/licenses/MIT
 *
 */
namespace harudake {

template <typename base_t, base_t MOD>
class static_modint;

using modint_1000000007 = static_modint<uint64_t, 1'000'000'007>;
using modint_998244353 = static_modint<uint64_t, 998'244'353>;

template <typename base_t, base_t MOD>
static_modint<base_t, MOD> add(const static_modint<base_t, MOD> lhs,
                               const static_modint<base_t, MOD> rhs) {
  base_t tmp = lhs.val + rhs.val;
  if (tmp >= MOD) tmp -= MOD;
  return static_modint<base_t, MOD>::make_raw(tmp);
}

template <typename base_t, base_t MOD>
static_modint<base_t, MOD> sub(const static_modint<base_t, MOD> lhs,
                               const static_modint<base_t, MOD> rhs) {
  base_t tmp = lhs.val + MOD - rhs.val;
  if (tmp >= MOD) tmp -= MOD;
  return static_modint<base_t, MOD>::make_raw(tmp);
}

template <typename base_t, base_t MOD>
static_modint<base_t, MOD> mul(const static_modint<base_t, MOD> lhs,
                               const static_modint<base_t, MOD> rhs) {
  base_t tmp = lhs.val * rhs.val;
  tmp %= MOD;
  return static_modint<base_t, MOD>::make_raw(tmp);
}

// data types must be signed integer
inline int64_t inv(const int64_t a, const int64_t p) {
  return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
};

template <typename base_t, base_t MOD>
static_modint<base_t, MOD> div(const static_modint<base_t, MOD> lhs,
                               const static_modint<base_t, MOD> rhs) {
  base_t tmp = lhs.val * inv(rhs.val, MOD);
  tmp %= MOD;
  return static_modint<base_t, MOD>::make_raw(tmp);
}

template <typename base_t, base_t MOD>
static_modint<base_t, MOD> pow(const static_modint<base_t, MOD> base,
                               const uint64_t index) {
  if (index == 0) return static_modint<base_t, MOD>{1};
  if (index % 2 == 1) {
    return pow(base, index - 1) * base;
  } else {
    auto half = pow(base, index / 2);
    return half * half;
  }
}

template <typename base_t, base_t MOD>
class static_modint {
  using modint = static_modint;

 public:
  static constexpr base_t mod = MOD;
  static_modint() : val(0) {}
  static_modint(const base_t x) : val(x % MOD) {}
  static_modint(const modint&) = default;
  modint& operator=(const modint&) = default;
  modint& operator=(const base_t x) {
    val = x % MOD;
    return *this;
  }
  modint operator-() const { return val == 0 ? 0 : MOD - val; }
  explicit operator base_t() const { return val; }
  base_t get() const { return val; }
  constexpr base_t get_mod() const { return mod; }
  static modint make_raw(const base_t raw) {
    modint res;
    res.val = raw;
    return res;
  }

 private:
  friend modint add<base_t, MOD>(const modint, const modint);
  friend modint sub<base_t, MOD>(const modint, const modint);
  friend modint mul<base_t, MOD>(const modint, const modint);
  friend modint div<base_t, MOD>(const modint, const modint);
  base_t val;
};

template <typename base_t, base_t MOD>
static_modint<base_t, MOD> operator+(const static_modint<base_t, MOD> lhs,
                                     const static_modint<base_t, MOD> rhs) {
  return add(lhs, rhs);
}
template <typename base_t, base_t MOD>
static_modint<base_t, MOD> operator-(const static_modint<base_t, MOD> lhs,
                                     const static_modint<base_t, MOD> rhs) {
  return sub(lhs, rhs);
}
template <typename base_t, base_t MOD>
static_modint<base_t, MOD> operator*(const static_modint<base_t, MOD> lhs,
                                     const static_modint<base_t, MOD> rhs) {
  return mul(lhs, rhs);
}
template <typename base_t, base_t MOD>
static_modint<base_t, MOD> operator/(const static_modint<base_t, MOD> lhs,
                                     const static_modint<base_t, MOD> rhs) {
  return div(lhs, rhs);
}
template <typename base_t, base_t MOD>
static_modint<base_t, MOD> operator^(const static_modint<base_t, MOD> lhs,
                                     const uint64_t rhs) {
  return pow(lhs, rhs);
}

template <typename base_t, base_t MOD>
static_modint<base_t, MOD>& operator+=(static_modint<base_t, MOD>& lhs,
                                       const static_modint<base_t, MOD> rhs) {
  return lhs = lhs + rhs;
}
template <typename base_t, base_t MOD>
static_modint<base_t, MOD>& operator-=(static_modint<base_t, MOD>& lhs,
                                       const static_modint<base_t, MOD> rhs) {
  return lhs = lhs - rhs;
}
template <typename base_t, base_t MOD>
static_modint<base_t, MOD>& operator*=(static_modint<base_t, MOD>& lhs,
                                       const static_modint<base_t, MOD> rhs) {
  return lhs = lhs * rhs;
}
template <typename base_t, base_t MOD>
static_modint<base_t, MOD>& operator/=(static_modint<base_t, MOD>& lhs,
                                       const static_modint<base_t, MOD> rhs) {
  return lhs = lhs / rhs;
}
template <typename base_t, base_t MOD>
static_modint<base_t, MOD>& operator^=(static_modint<base_t, MOD>& lhs,
                                       const uint64_t rhs) {
  return lhs = lhs ^ rhs;
}

}  // namespace harudake
using namespace harudake;
using modint = modint_998244353;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  i64 MAX_F = 200001;
  vector<modint> fact(MAX_F);
  fact[0] = modint(1);
  rep(i, MAX_F - 1) fact[i + 1] = fact[i] * modint(i + 1);
  vector<modint> invf(MAX_F);
  invf.back() = modint(1) / fact.back();
  rep(ri, MAX_F - 1) {
    i64 i = MAX_F - ri - 1;
    invf[i - 1] = invf[i] * modint(i);
  }
  auto comb = [&](i64 n, i64 k) { return fact[n] * invf[k] * invf[n - k]; };
  i64 t;
  cin >> t;
  rep(tnum, t) {
    i64 n, m;
    cin >> n >> m;
    vi64 a(n);
    rep(i, n) cin >> a[i];
    sort(all(a));
    map<i64, i64> hist;
    rep(i, n) { ++hist[a[i]]; }
    vector<pair<i64, i64>> vp;
    for (auto&& [x, y] : hist) {
      vp.emplace_back(x, y);
    }
    reverse(all(vp));
    map<tuple<i64, i64, bool>, modint> dp;
    dp[make_tuple(0, 0, true)] = modint(1);
    i64 total = 0;
    for (auto&& [x, y] : vp) {
      map<tuple<i64, i64, bool>, modint> nxt;
      for (auto&& [key, cnt] : dp) {
        auto [left, num, parity] = key;
        i64 right = total - left;
        rep(p, y + 1) {
          i64 q = y - p;
          if (total + p == n) continue;
          i64 llr = max(left, n - left - p);
          i64 rlr = max(right, n - right - q);
          if (p > 0 && llr != x) continue;
          if (q > 0 && rlr != x) continue;
          i64 new_num = num + 1;
          if (p > 0 && q > 0) ++new_num;
          nxt[make_tuple(left + p, new_num, parity && p == q)] +=
              cnt * comb(y, p);
        }
      }
      swap(dp, nxt);
      total += y;
    }
    modint ans = 0;
    for (auto&& [key, cnt] : dp) {
      auto [left, num, parity] = key;
      if (m < num) continue;
      modint tmp = cnt * comb(m, num);
      // if (parity) tmp /= modint(2);
      ans += tmp;
    }
    cout << ans.get() << endl;
  }
  return 0;
}

yukicoder

結果

テストケース

ソースコード