結果

問題 No.329 全射
ユーザー kei
提出日時 2018-10-14 15:27:55
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 35 ms / 2,000 ms
コード長 3,171 bytes
コンパイル時間 1,696 ms
コンパイル使用メモリ 170,760 KB
実行使用メモリ 14,312 KB
最終ジャッジ日時 2024-10-12 18:18:10
合計ジャッジ時間 3,868 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 40
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; }
template<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " "
    ;} return out; }
template<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out 
    << Mat[i];} return out; }
template<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << 
    it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; }
/*
 <url:https://yukicoder.me/problems/no/329>
 問題文============================================================
 =================================================================
 解説=============================================================
 ================================================================
 */
const ll MAX_N = 1e5 + 10;
const ll MOD = 1e9+7;
ll Inv[MAX_N];
ll fact[MAX_N];
ll factInv[MAX_N];
void Inv_init(){
    Inv[1] = 1;
    for(int i = 2; i < MAX_N; i++) {
        Inv[i] = Inv[MOD%i] * (MOD - MOD/i) % MOD;
    }
}
void fact_init(){
    fact[0] = fact[1] = factInv[0] = factInv[1] = 1;
    for(int i = 2; i < MAX_N; i++){
        fact[i] = (fact[i-1] * i) % MOD;
        factInv[i] = (factInv[i-1] * Inv[i])%MOD;
    }
}
// a^b % MOD;
ll powmod(ll a,ll b) {ll res=1;a%=MOD; for(;b;b>>=1){if(b&1)res=res*a%MOD;a=a*a%MOD;}return res;}
const ll MAXNM = 1010;
//i個の物を、j個の区別できる箱に、最低1個ずつ入れる入れ方
ll I2J[MAXNM][MAXNM]; // Ai -> Ajへの全射の数
void I2J_init(){
    I2J[0][0] = 1;
    for(int i = 1; i < MAXNM; i++){
        for(int j = 1; j < MAXNM; j++){
            I2J[i][j] += I2J[i-1][j] * j %MOD;
            I2J[i][j] += I2J[i-1][j-1] * j %MOD;
            I2J[i][j] %= MOD;
        }
    }
}
void init(){
    Inv_init();
    fact_init();
    I2J_init();
}
ll G[300][300];
ll solve(){
    init();
    ll res = 0;
    ll N,M; cin >> N >> M;
    vector<ll> w(N); for(auto& in:w) cin >> in;
    if(M == 0){
        for(int i = 0; i < N;i++) (res += fact[w[i]])%=MOD;
        return res;
    }
    for(int i = 0; i < N;i++) G[i][i] = w[i];
    for(int i = 0; i < M;i++){
        int I,J; cin >> I >> J; I--; J--;
        G[I][J] = min(w[I],w[J]);
    }
    for(int i = 0; i < N;i++){
        for(int j = 0; j < N;j++){
            for(int k = 0; k < N;k++){
                G[j][k] = max(G[j][k],min(G[j][i],G[i][k]));
            }
        }
    }
    for(int i = 0; i < N;i++){
        for(int j = 0; j < N;j++){
            if(G[i][j] >= w[j]){
                (res += I2J[w[i]][w[j]])%=MOD;
            }
        }
    }
    return res;
}
int main(void) {
    cin.tie(0); ios_base::sync_with_stdio(false);
    cout << solve() << endl;
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0