結果

問題 No.1825 Except One
ユーザー stoqstoq
提出日時 2022-01-28 22:13:55
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 2,662 ms / 3,000 ms
コード長 5,855 bytes
コンパイル時間 4,054 ms
コンパイル使用メモリ 274,860 KB
実行使用メモリ 426,340 KB
最終ジャッジ日時 2024-06-10 11:21:05
合計ジャッジ時間 48,253 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 529 ms
426,208 KB
testcase_01 AC 526 ms
426,084 KB
testcase_02 AC 587 ms
426,208 KB
testcase_03 AC 2,662 ms
426,332 KB
testcase_04 AC 1,756 ms
426,204 KB
testcase_05 AC 1,185 ms
426,208 KB
testcase_06 AC 704 ms
426,208 KB
testcase_07 AC 2,556 ms
426,208 KB
testcase_08 AC 2,620 ms
426,208 KB
testcase_09 AC 685 ms
426,204 KB
testcase_10 AC 2,156 ms
426,080 KB
testcase_11 AC 1,383 ms
426,208 KB
testcase_12 AC 1,804 ms
426,208 KB
testcase_13 AC 1,499 ms
426,336 KB
testcase_14 AC 470 ms
426,204 KB
testcase_15 AC 618 ms
426,332 KB
testcase_16 AC 638 ms
426,208 KB
testcase_17 AC 509 ms
426,208 KB
testcase_18 AC 468 ms
426,136 KB
testcase_19 AC 586 ms
426,080 KB
testcase_20 AC 610 ms
426,204 KB
testcase_21 AC 535 ms
426,208 KB
testcase_22 AC 555 ms
426,012 KB
testcase_23 AC 549 ms
426,284 KB
testcase_24 AC 1,308 ms
426,196 KB
testcase_25 AC 1,414 ms
426,340 KB
testcase_26 AC 804 ms
426,164 KB
testcase_27 AC 2,111 ms
426,148 KB
testcase_28 AC 2,335 ms
426,220 KB
testcase_29 AC 804 ms
426,148 KB
testcase_30 AC 826 ms
426,224 KB
testcase_31 AC 1,132 ms
426,204 KB
testcase_32 AC 2,457 ms
426,208 KB
testcase_33 AC 725 ms
426,156 KB
testcase_34 AC 2,297 ms
426,152 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define MOD_TYPE 2

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

#include <atcoder/all>
//#include <atcoder/modint>
//#include <atcoder/lazysegtree>
//#include <atcoder/segtree>

using namespace atcoder;

#if 0
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using Int = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
#endif

#if 0
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace __gnu_pbds;
using namespace __gnu_cxx;
template <typename T>
using extset =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#endif

#if 1
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif

#pragma region Macros

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>>;

#if MOD_TYPE == 1
constexpr ll MOD = ll(1e9 + 7);
#else
#if MOD_TYPE == 2
constexpr ll MOD = 998244353;
#else
constexpr ll MOD = 1000003;
#endif
#endif

using mint = static_modint<MOD>;
constexpr int INF = (int)1e9 + 10;
constexpr ll LINF = (ll)4e18;
constexpr double PI = acos(-1.0);
constexpr double EPS = 1e-11;
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 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";
#define UNIQUE(v) v.erase(unique(all(v)), v.end())

struct io_init {
  io_init() {
    cin.tie(nullptr);
    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>
vector<T> compress(vector<T> &v) {
  vector<T> val = v;
  sort(all(val)), val.erase(unique(all(val)), val.end());
  for (auto &&vi : v) vi = lower_bound(all(val), vi) - val.begin();
  return 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;
}
ostream &operator<<(ostream &os, mint m) {
  os << m.val();
  return os;
}
ostream &operator<<(ostream &os, modint m) {
  os << m.val();
  return os;
}
template <typename T>
constexpr istream &operator>>(istream &is, vector<T> &v) noexcept {
  for (int i = 0; i < v.size(); i++) is >> v[i];
  return is;
}
template <typename T>
constexpr ostream &operator<<(ostream &os, vector<T> &v) noexcept {
  for (int i = 0; i < v.size(); i++)
    os << v[i] << (i + 1 == v.size() ? "" : " ");
  return os;
}
template <typename T>
constexpr void operator--(vector<T> &v, int) noexcept {
  for (int i = 0; i < v.size(); i++) v[i]--;
}

random_device seed_gen;
mt19937_64 engine(seed_gen());

struct BiCoef {
  vector<mint> fact_, inv_, finv_;
  BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
    fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
    for (int i = 2; i < n; i++) {
      fact_[i] = fact_[i - 1] * i;
      inv_[i] = -inv_[MOD % i] * (MOD / i);
      finv_[i] = finv_[i - 1] * inv_[i];
    }
  }
  mint C(ll n, ll k) const noexcept {
    if (n < k || n < 0 || k < 0) return 0;
    return fact_[n] * finv_[k] * finv_[n - k];
  }
  mint P(ll n, ll k) const noexcept { return C(n, k) * fact_[k]; }
  mint H(ll n, ll k) const noexcept { return C(n + k - 1, k); }
  mint Ch1(ll n, ll k) const noexcept {
    if (n < 0 || k < 0) return 0;
    mint res = 0;
    for (int i = 0; i < n; i++)
      res += C(n, i) * mint(n - i).pow(k) * (i & 1 ? -1 : 1);
    return res;
  }
  mint fact(ll n) const noexcept {
    if (n < 0) return 0;
    return fact_[n];
  }
  mint inv(ll n) const noexcept {
    if (n < 0) return 0;
    return inv_[n];
  }
  mint finv(ll n) const noexcept {
    if (n < 0) return 0;
    return finv_[n];
  }
};

// BiCoef bc(500010);

#pragma endregion

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

ll dp[51 * 101][101][52];   // sum,max,cnt
ll nxt[51 * 101][101][52];  // sum,max,cnt

void solve() {
  int n;
  cin >> n;
  vector<int> a(n);
  cin >> a;
  dp[0][0][0] = 1;
  sort(all(a));
  auto b = a;
  b.insert(b.begin(), 0);
  UNIQUE(b);
  int s = 0;
  repi(i, n) {
    repi(j, s + a[i] + 1) repi(k, min(i + 2, int(b.size()))) repi(l, i + 2)
        nxt[j][b[k]][l] = 0;
    repi(j, s + 1) repi(k, min(i + 1, int(b.size()))) repi(l, i + 1) {
      nxt[j][b[k]][l] += dp[j][b[k]][l];
      nxt[j + a[i]][max(b[k], a[i])][l + 1] += dp[j][b[k]][l];
    }
    s += a[i];
    swap(dp, nxt);
  }
  ll ans = 0;
  repi(j, 51 * 101) repi(k, b.size()) REPI(l, 2, n + 1) {
    if (j % (l - 1) != 0 or b[k] > j / (l - 1)) continue;
    ans += dp[j][b[k]][l];
  }
  cout << ans << "\n";
}

int main() { solve(); }
0