結果
問題 | No.329 全射 |
ユーザー |
![]() |
提出日時 | 2019-11-11 13:52:05 |
言語 | C++11(廃止可能性あり) (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 562 ms / 2,000 ms |
コード長 | 5,096 bytes |
コンパイル時間 | 2,671 ms |
コンパイル使用メモリ | 178,432 KB |
実行使用メモリ | 50,176 KB |
最終ジャッジ日時 | 2024-09-15 05:13:46 |
合計ジャッジ時間 | 28,249 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge6 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 40 |
ソースコード
#include "bits/stdc++.h"#include<vector>#include<iostream>#include<queue>#include<algorithm>#include<map>#include<set>#include<iomanip>#include<assert.h>#include<unordered_map>#include<unordered_set>#include<string>#include<stack>#include<complex>#pragma warning(disable:4996)using namespace std;using ld = long double;template<class T>using Table = vector<vector<T>>;const ld eps=1e-9;#define WHATS(var)cout<<__LINE__<<' '<<#var<<"="<<var<<endl;template<class S, class T> ostream& operator <<(ostream &os, const pair<S, T> v){os << "( " << v.first << ", " << v.second << ")"; return os;}template<class T> ostream& operator <<(ostream &os, const vector<T> &v){for(int i = 0; i < v.size(); i++){if(i > 0){os << " ";} os << v[i];} return os;}template<class T> ostream& operator <<(ostream &os, const vector<vector<T>> &v){for(int i = 0; i < v.size(); i++){if(i > 0){os << endl;} os << v[i];} return os;}template<class T> ostream& operator <<(ostream &os, const vector<set<T>> &v){for(int i = 0; i < v.size(); i++){if(i > 0){os << endl;} os << v[i];} return os;}template<class T> ostream& operator <<(ostream &os, const set<T> &v){int i=0;for(auto it:v){if(i > 0){os << ' ';}os << it;i++;}return os;}/*1 2 3 4 5 6 7 8 9 10 11 12 13 1412 1 1113 3 1014 5 915 7 816 2 1417 4 1318 6 121-1211 1 1012 3 913 5 813 6 714 2 1215 4 11*/const int MAX_X=2220;using ll=long long ;const int mod = 1000000007;struct Mod {public:int num;Mod() : Mod(0) { ; }Mod(long long int n) : num((n % mod + mod) % mod) {static_assert(mod<INT_MAX / 2, "mod is too big, please make num 'long long int' from 'int'");}Mod(int n) : Mod(static_cast<long long int>(n)) { ; }operator int() { return num; }};Mod operator+(const Mod a, const Mod b) { return Mod((a.num + b.num) % mod); }Mod operator+(const long long int a, const Mod b) { return Mod(a) + b; }Mod operator+(const Mod a, const long long int b) { return b + a; }Mod operator++(Mod &a) { return a + Mod(1); }Mod operator-(const Mod a, const Mod b) { return Mod((mod + a.num - b.num) % mod); }Mod operator-(const long long int a, const Mod b) { return Mod(a) - b; }Mod operator--(Mod &a) { return a - Mod(1); }Mod operator*(const Mod a, const Mod b) { return Mod(((long long)a.num * b.num) % mod); }Mod operator*(const long long int a, const Mod b) { return Mod(a)*b; }Mod operator*(const Mod a, const long long int b) { return Mod(b)*a; }Mod operator*(const Mod a, const int b) { return Mod(b)*a; }Mod operator+=(Mod &a, const Mod b) { return a = a + b; }Mod operator+=(long long int &a, const Mod b) { return a = a + b; }Mod operator-=(Mod &a, const Mod b) { return a = a - b; }Mod operator-=(long long int &a, const Mod b) { return a = a - b; }Mod operator*=(Mod &a, const Mod b) { return a = a * b; }Mod operator*=(long long int &a, const Mod b) { return a = a * b; }Mod operator*=(Mod& a, const long long int &b) { return a = a * b; }Mod operator^(const Mod a, const int n) {if (n == 0) return Mod(1);Mod res = (a * a) ^ (n / 2);if (n % 2) res = res * a;return res;}Mod mod_pow(const Mod a, const int n) {if (n == 0) return Mod(1);Mod res = mod_pow((a * a), (n / 2));if (n % 2) res = res * a;return res;}Mod inv(const Mod a) { return a ^ (mod - 2); }Mod operator/(const Mod a, const Mod b) {assert(b.num != 0);return a * inv(b);}Mod operator/(const long long int a, const Mod b) {return Mod(a) / b;}Mod operator/=(Mod &a, const Mod b) {return a = a / b;}#define MAX_MOD_N 1024000Mod fact[MAX_MOD_N], factinv[MAX_MOD_N];void init(const int amax = MAX_MOD_N) {fact[0] = Mod(1); factinv[0] = 1;for (int i = 0; i < amax - 1; ++i) {fact[i + 1] = fact[i] * Mod(i + 1);factinv[i + 1] = factinv[i] / Mod(i + 1);}}Mod comb(const int a, const int b) {return fact[a] * factinv[b] * factinv[a - b];}int main() {init();ios::sync_with_stdio(false);int N,M;cin>>N>>M;vector<int>szs(N);for(int i=0;i<N;++i)cin>>szs[i];vector<vector<int>>graph(N);for(int i=0;i<M;++i){int u,v;cin>>u>>v;u--;v--;graph[u].push_back(v);}vector<vector<int>>pluss(MAX_X+1,vector<int>(MAX_X+1));for(int start=0;start<N;++start){vector<int>maxs(N,-1);maxs[start]=szs[start];priority_queue<pair<int,int>>que;que.emplace(szs[start],start);maxs[start]=szs[start];while(!que.empty()){auto p=que.top();int now=p.second;que.pop();if(p.first!=maxs[now])continue;for(auto e:graph[now]){int n_sz=min(maxs[now],szs[e]);if(maxs[e]<n_sz){maxs[e]=n_sz;que.emplace(n_sz,e);}}}for(int i=0;i<N;++i){if(maxs[i]>=szs[i]){pluss[szs[start]][szs[i]]++;}}}//WHATS(pluss)vector<vector<Mod>>dp(MAX_X+1,vector<Mod>(MAX_X+1));dp[1][1]=Mod(1);for(int y=2;y<=MAX_X;++y){for(int x=1;x<=y;++x){dp[y][x]=dp[y-1][x-1]+dp[y-1][x]*x;}}//WHATS(dp)Mod answer=0;for(int i=0;i<=MAX_X;++i){for(int j=0;j<=MAX_X;++j){Mod aanswer=dp[i][j]*Mod(pluss[i][j])*fact[j];answer+=aanswer;}}cout<<answer.num<<endl;return 0;}