結果
問題 | No.329 全射 |
ユーザー |
![]() |
提出日時 | 2015-12-27 19:35:43 |
言語 | C++11(廃止可能性あり) (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 23 ms / 2,000 ms |
コード長 | 2,416 bytes |
コンパイル時間 | 954 ms |
コンパイル使用メモリ | 108,348 KB |
実行使用メモリ | 13,888 KB |
最終ジャッジ日時 | 2024-09-19 07:30:09 |
合計ジャッジ時間 | 2,226 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 40 |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:100:37: warning: iteration 1110 invokes undefined behavior [-Waggressive-loop-optimizations] 100 | rep(i, COMBINATION_MAX) fact[i+1] = fact[i] * (i+1) % MOD; | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ main.cpp:24:33: note: within this loop 24 | #define REP(i,a,b) for(int i=a;i<(int)b;i++) | ^ main.cpp:25:18: note: in expansion of macro ‘REP’ 25 | #define rep(i,n) REP(i,0,n) | ^~~ main.cpp:100:3: note: in expansion of macro ‘rep’ 100 | rep(i, COMBINATION_MAX) fact[i+1] = fact[i] * (i+1) % MOD; | ^~~
ソースコード
#include <iostream>#include <algorithm>#include <cmath>#include <vector>#include <complex>#include <queue>#include <deque>#include <set>#include <map>#include <unordered_set>#include <unordered_map>#include <iomanip>#include <assert.h>#include <array>#include <cstdio>#include <cstring>#include <random>#include <functional>#include <numeric>#include <bitset>using namespace std;#define REP(i,a,b) for(int i=a;i<(int)b;i++)#define rep(i,n) REP(i,0,n)#define all(c) (c).begin(), (c).end()#define zero(a) memset(a, 0, sizeof a)#define minus(a) memset(a, -1, sizeof a)#define minimize(a, x) a = std::min(a, x)#define maximize(a, x) a = std::max(a, x)constexpr int inf = 1<<29;int const MOD = 1e9+7;typedef long long ll;namespace math { namespace combination { // experimental#define COMBINATION_MAX 1111namespace memorized { namespace stirling_number {enum { max_value = COMBINATION_MAX };bool __computed = false; inline bool computed() {if(__computed) { return true; } else { __computed = true; return false; }}ll dp[max_value][max_value];}}ll stirling_number(int N, int K) {using memorized::stirling_number::dp;if(memorized::stirling_number::computed()) { return dp[N][K]; }// Make stirling numbersusing memorized::stirling_number::max_value;REP(i, 1, max_value) { // undefined when i = 0dp[i][1] = dp[i][i] = 1;REP(j, 2, i) {dp[i][j] = dp[i-1][j-1] + j * dp[i-1][j];dp[i][j] %= MOD;}}return dp[N][K];}}}int N, M;vector<int> g[222];ll fact[COMBINATION_MAX];ll dp[300][300];int main() {cin >> N >> M;vector<ll> ws(N);rep(i, N) {cin >> ws[i];}rep(i, M) {int a, b; cin >> a >> b; a--, b--;g[a].push_back(b);}zero(dp);rep(i, N) {dp[i][i] = ws[i];rep(j, g[i].size()) {int tar = g[i][j];dp[i][tar] = min(dp[i][i], ws[tar]);}}rep(k, N) rep(i, N) rep(j, N) {maximize(dp[i][j], min(dp[i][k], dp[k][j]));}fact[0] = 1;rep(i, COMBINATION_MAX) fact[i+1] = fact[i] * (i+1) % MOD;// 異なるN個を異なるK個に振り分ける方法の数(全射の数) := S(N, K) * K!using math::combination::stirling_number;ll ans = 0;rep(i, N) rep(j, N) {if(dp[i][j] < ws[j]) { continue; }ans += stirling_number(ws[i], ws[j]) * fact[ws[j]] % MOD;ans %= MOD;}cout << ans << endl;return 0;}