#349310 (C++14) No.329 全射

提出ソース

結果

問題	No.329 全射
ユーザー	fumiphys
提出日時	2019-05-28 21:03:06
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	29 ms / 2,000 ms
コード長	5,919 bytes
コンパイル時間	1,492 ms
コンパイル使用メモリ	175,768 KB
実行使用メモリ	11,708 KB
最終ジャッジ日時	2024-09-17 15:51:19
合計ジャッジ時間	3,605 ms
ジャッジサーバーID （参考情報）	judge3 / judge1

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	8 ms 11,160 KB
testcase_01	AC	8 ms 11,308 KB
testcase_02	AC	8 ms 11,336 KB
testcase_03	AC	8 ms 11,308 KB
testcase_04	AC	9 ms 11,296 KB
testcase_05	AC	9 ms 11,204 KB
testcase_06	AC	8 ms 11,168 KB
testcase_07	AC	9 ms 11,444 KB
testcase_08	AC	9 ms 11,292 KB
testcase_09	AC	9 ms 11,280 KB
testcase_10	AC	9 ms 11,288 KB
testcase_11	AC	9 ms 11,176 KB
testcase_12	AC	9 ms 11,328 KB
testcase_13	AC	29 ms 11,572 KB
testcase_14	AC	19 ms 11,472 KB
testcase_15	AC	19 ms 11,540 KB
testcase_16	AC	21 ms 11,708 KB
testcase_17	AC	23 ms 11,580 KB
testcase_18	AC	25 ms 11,620 KB
testcase_19	AC	29 ms 11,632 KB
testcase_20	AC	25 ms 11,444 KB
testcase_21	AC	22 ms 11,616 KB
testcase_22	AC	29 ms 11,500 KB
testcase_23	AC	12 ms 11,460 KB
testcase_24	AC	12 ms 11,392 KB
testcase_25	AC	16 ms 11,544 KB
testcase_26	AC	15 ms 11,460 KB
testcase_27	AC	9 ms 11,400 KB
testcase_28	AC	9 ms 11,232 KB
testcase_29	AC	10 ms 11,296 KB
testcase_30	AC	9 ms 11,388 KB
testcase_31	AC	9 ms 11,300 KB
testcase_32	AC	10 ms 11,324 KB
testcase_33	AC	12 ms 11,512 KB
testcase_34	AC	12 ms 11,516 KB
testcase_35	AC	13 ms 11,496 KB
testcase_36	AC	13 ms 11,380 KB
testcase_37	AC	12 ms 11,440 KB
testcase_38	AC	13 ms 11,312 KB
testcase_39	AC	13 ms 11,456 KB
testcase_40	AC	15 ms 11,476 KB
testcase_41	AC	12 ms 11,468 KB
testcase_42	AC	12 ms 11,356 KB

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

ソースコード

raw source code

// includes
#include <bits/stdc++.h>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#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 vrep(v, i) for(int i = 0; i < (v).size(); i++)
#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 FI first
#define SE second
#define dump(a, n) for(int i = 0; i < n; i++)cout << a[i] << "\n "[i + 1 != n];
#define dump2(a, n, m) for(int i = 0; i < n; i++)for(int j = 0; j < m; j++)cout << a[i][j] << "\n "[j + 1 != m];
#define bit(n) (1LL<<(n))
#define INT(n) int n; cin >> n;
#define LL(n) ll n; cin >> n;
#define DOUBLE(n) double n; cin >> n;
using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
typedef complex<double> cd;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};

// solve
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;}

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)((ll)res * curr % mod);
    }
    curr = (T)((ll)curr * curr % mod);
    tmp >>= 1;
  }
  return res;
}

struct Factorial{
  int n;
  const int MOD = 1e9 + 7;
  vector<long long> fac;
  vector<long long> inv_;
  Factorial(int n): n(n){
    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(i < 0 || i > n){
      cerr << "list index out of range" << endl;
      abort();
    }
    return fac[i];
  }
  long long inv(size_t i){
    if(i < 0 || i > n){
      cerr << "list index out of range" << endl;
      abort();
    }
    return inv_[i];
  }
  long long comb(int n, int k){
    if(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 < 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);
  }
};

vector<int> edge[201];
ll dp[1001][1001];
int W[201][201];

int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  INT(n); INT(m);
  vector<int> w(n);
  cin >> w;
  rep(i, m){
    INT(u); INT(v);
    u--, v--;
    edge[u].pb(v);
  }
  Factorial fac(1001);
  dp[0][0] = 1;
  FOR(i, 1, 1001){
    FOR(j, 1, 1001){
      dp[i][j] = (dp[i-1][j-1] + j * dp[i-1][j] % mod) % mod;
    }
  }
  FOR(i, 1, 1001){
    FOR(j, 1, 1001){
      dp[i][j] = dp[i][j] * fac[j] % mod;
    }
  }
  rep(i, n){
    rep(j, n)W[i][j] = inf;
  }
  rep(i, n){
    W[i][i] = w[i];
    for(auto e: edge[i]){
      W[i][e] = w[e];
    }
  }
  for(int k = 0; k < n; k++){
    for(int i = 0; i < n; i++){
      for(int j = 0; j < n; j++){
        if(W[i][k] != inf && W[k][j] != inf){
          if(W[i][j] == inf)W[i][j] = -1;
          W[i][j] = max(W[i][j], min(W[i][k], W[k][j]));
          if(W[i][j] == -1)W[i][j] = inf;
        }
      }
    }
  }
  // rep(i, n){
    // rep(j, n)cout << W[i][j] << "\n "[j + 1 != n];
  // }
  ll res = 0;
  rep(i, n){
    rep(j, n){
      if(W[i][j] != inf && W[i][j] >= w[j])res = (res + dp[w[i]][w[j]]) % mod;
    }
  }
  cout << res << endl;
  return 0;
}

yukicoder

結果

テストケース

ソースコード