#388301 (C++14) No.243 出席番号(2)

提出ソース

結果

問題	No.243 出席番号(2)
ユーザー	fumiphys
提出日時	2019-10-10 01:16:35
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	1,032 ms / 2,000 ms
コード長	5,413 bytes
コンパイル時間	1,616 ms
コンパイル使用メモリ	172,688 KB
実行使用メモリ	6,820 KB
最終ジャッジ日時	2024-11-18 11:54:10
合計ジャッジ時間	13,473 ms
ジャッジサーバーID （参考情報）	judge3 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,820 KB
testcase_01	AC	1 ms 6,816 KB
testcase_02	AC	2 ms 6,816 KB
testcase_03	AC	40 ms 6,820 KB
testcase_04	AC	44 ms 6,816 KB
testcase_05	AC	40 ms 6,820 KB
testcase_06	AC	40 ms 6,820 KB
testcase_07	AC	16 ms 6,820 KB
testcase_08	AC	164 ms 6,816 KB
testcase_09	AC	165 ms 6,816 KB
testcase_10	AC	161 ms 6,820 KB
testcase_11	AC	155 ms 6,820 KB
testcase_12	AC	82 ms 6,820 KB
testcase_13	AC	371 ms 6,820 KB
testcase_14	AC	369 ms 6,816 KB
testcase_15	AC	342 ms 6,816 KB
testcase_16	AC	365 ms 6,816 KB
testcase_17	AC	258 ms 6,816 KB
testcase_18	AC	671 ms 6,816 KB
testcase_19	AC	652 ms 6,816 KB
testcase_20	AC	663 ms 6,820 KB
testcase_21	AC	641 ms 6,820 KB
testcase_22	AC	542 ms 6,820 KB
testcase_23	AC	1,022 ms 6,816 KB
testcase_24	AC	1,009 ms 6,816 KB
testcase_25	AC	1,015 ms 6,816 KB
testcase_26	AC	961 ms 6,816 KB
testcase_27	AC	1,032 ms 6,816 KB
testcase_28	AC	2 ms 6,820 KB
testcase_29	AC	2 ms 6,820 KB
testcase_30	AC	2 ms 6,816 KB
testcase_31	AC	2 ms 6,820 KB
testcase_32	AC	2 ms 6,820 KB

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

ソースコード

raw source code

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

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define bit(n) (1LL<<(n))
// functions
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(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;

template <typename T>
T power(T a, T n, T mod) {
  T res = 1;
  T tmp = n;
  T curr = a;
  while(tmp){
    if(tmp % 2 == 1){
      res = (T)(res * curr % mod);
    }
    curr = (T)(curr * curr % mod);
    tmp >>= 1;
  }

  return res;
}

struct Factorial{
  int n = 0;
  static const long long mod_default = 1e9 + 7;
  long long MOD = mod_default;
  vector<long long> fac;
  vector<long long> inv_;
  explicit Factorial(){}
  explicit Factorial(int n, long long mod_=mod_default): n(n), MOD(mod_){
    assert(MOD > 0 && n < MOD);
    fac.resize(n + 1);
    inv_.resize(n + 1);
    calc_factorial();
    calc_inv();
  }
  void calc_factorial(){
    fac[0] = 1;
    for(int i = 1; i <= n; i++){
      fac[i] = i * fac[i-1] % MOD;
    }
  }
  void calc_inv(){
    inv_[n] = power<long long>(fac[n], MOD - 2, MOD);
    for(int i = n - 1; i >= 0; i--){
      inv_[i] = (i + 1) * inv_[i+1] % MOD;
    }
  }
  long long& operator[](size_t i){
    if((int)i > n){
      cerr << "list index out of range" << endl;
      abort();
    }
    return fac[i];
  }
  long long inv(size_t i){
    if((int)i > n){
      cerr << "list index out of range" << endl;
      abort();
    }
    return inv_[i];
  }
  long long comb(int n, int k){
    if(n < 0 || k < 0 || n < k)return 0;
    long long res = fac[n];
    res = res * inv_[n-k] % MOD;
    res = res * inv_[k] % MOD;
    return res;
  }
  long long perm(int n, int k){
    if(n < 0 || k < 0 || n < k)return 0;
    long long res = fac[n];
    res = res * inv_[n-k] % MOD;
    return res;
  }
  long long h(int n, int k){
    if(n == 0 && k == 0)return 1;
    return comb(n + k - 1, k);
  }
};

ll dp[2][5010];
int cnt[5010];

int main(int argc, char const* argv[])
{
  Factorial fac(5010);
  int n; cin >> n;
  int c = 0;
  rep(i, n){
    int a; cin >> a;
    cnt[a]++;
    if(a >= n)c++;
  }

  dp[0][c] = 1;
  int curr = c;
  rep(i, n){
    rep(j, n + 1)dp[(i+1)&1][j] = 0;
    rep(j, curr + 1){
      int k = cnt[i];
      (dp[(i+1)&1][j+k] += dp[i&1][j]) %= mod;
      if(j > 0)(dp[(i+1)&1][j+k-1] += dp[i&1][j] * j % mod) %= mod;
      FOR(l, 1, min(k, i + j - curr) + 1){
        (dp[(i+1)&1][j+k-l] += (dp[i&1][j] * fac.comb(i+j-curr, l) % mod) * fac.perm(k, l) % mod) %= mod;
        if(j > 0)(dp[(i+1)&1][j+k-l-1] += ((dp[i&1][j] * j % mod) * fac.comb(i+j-curr, l) % mod) * fac.perm(k, l) % mod) %= mod;
      }
    }
    curr += cnt[i];
  }
  /*rep(i, n + 1){
    rep(j, n + 1){
      cerr << i << " " << j << " " << dp[i][j] << endl;
    }
    }*/
  cout << dp[n&1][0] << endl;
  return 0;
}

yukicoder

結果

テストケース

ソースコード