#67254 (C++11) No.329 全射

提出ソース

結果

問題	No.329 全射
ユーザー	shimomire
提出日時	2015-12-20 01:56:52
言語	C++11 (gcc 11.4.0)
結果	AC
実行時間	219 ms / 2,000 ms
コード長	6,150 bytes
コンパイル時間	1,292 ms
コンパイル使用メモリ	134,020 KB
実行使用メモリ	12,800 KB
最終ジャッジ日時	2024-09-17 11:17:19
合計ジャッジ時間	6,123 ms
ジャッジサーバーID （参考情報）	judge2 / judge3

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	19 ms 11,776 KB
testcase_01	AC	18 ms 11,904 KB
testcase_02	AC	19 ms 11,776 KB
testcase_03	AC	19 ms 11,776 KB
testcase_04	AC	17 ms 11,776 KB
testcase_05	AC	17 ms 11,776 KB
testcase_06	AC	17 ms 11,776 KB
testcase_07	AC	17 ms 11,904 KB
testcase_08	AC	18 ms 11,904 KB
testcase_09	AC	18 ms 11,904 KB
testcase_10	AC	17 ms 11,904 KB
testcase_11	AC	18 ms 11,776 KB
testcase_12	AC	18 ms 11,904 KB
testcase_13	AC	202 ms 12,544 KB
testcase_14	AC	142 ms 11,904 KB
testcase_15	AC	128 ms 12,288 KB
testcase_16	AC	132 ms 12,800 KB
testcase_17	AC	160 ms 12,288 KB
testcase_18	AC	181 ms 12,672 KB
testcase_19	AC	219 ms 12,416 KB
testcase_20	AC	190 ms 12,416 KB
testcase_21	AC	161 ms 12,288 KB
testcase_22	AC	208 ms 12,160 KB
testcase_23	AC	68 ms 12,288 KB
testcase_24	AC	67 ms 12,288 KB
testcase_25	AC	113 ms 12,416 KB
testcase_26	AC	79 ms 12,032 KB
testcase_27	AC	29 ms 11,776 KB
testcase_28	AC	18 ms 11,776 KB
testcase_29	AC	26 ms 11,904 KB
testcase_30	AC	22 ms 11,776 KB
testcase_31	AC	18 ms 11,776 KB
testcase_32	AC	28 ms 11,776 KB
testcase_33	AC	145 ms 11,904 KB
testcase_34	AC	127 ms 11,776 KB
testcase_35	AC	160 ms 11,776 KB
testcase_36	AC	150 ms 11,776 KB
testcase_37	AC	126 ms 11,904 KB
testcase_38	AC	136 ms 11,776 KB
testcase_39	AC	139 ms 11,776 KB
testcase_40	AC	181 ms 11,776 KB
testcase_41	AC	131 ms 11,776 KB
testcase_42	AC	170 ms 11,776 KB

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

ソースコード

raw source code

#include <cassert>// c
#include <iostream>// io
#include <iomanip>
#include <fstream>
#include <sstream>
#include <vector>// container
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <stack>
#include <algorithm>// other
#include <complex>
#include <numeric>
#include <functional>
#include <random>
#include <regex>
using namespace std;

typedef long long ll;typedef unsigned long long ull;typedef long double ld;

#define ALL(c) c.begin(),c.end()
#define IN(l,v,r) (l<=v && v < r)
template<class T> void UNIQUE(T& v){v.erase(unique(ALL(v)),v.end());}
//debug
#define DUMP(x) cerr << #x <<" = " << (x)
#define LINE() cerr<< " (L" << __LINE__ << ")"

struct range{
	struct Iter{
		int v,step;
		Iter& operator++(){v+=step;return *this;}
		bool operator!=(Iter& itr){return v<itr.v;}
		int& operator*(){return v;}
	};
	Iter i, n;
	range(int i, int n,int step):i({i,step}), n({n,step}){}
	range(int i, int n):range(i,n,1){}
	range(int n):range(0,n){}
	Iter& begin(){return i;}
	Iter& end(){return n;}
};
struct rrange{
	struct Iter{
		int v,step;
		Iter& operator++(){v-=step;return *this;}
		bool operator!=(Iter& itr){return v>itr.v;}
		int& operator*(){return v;}
	};
	Iter i, n;
	rrange(int i, int n,int step):i({i-1,step}), n({n-1,step}){}
	rrange(int i, int n):rrange(i,n,1){}
	rrange(int n) :rrange(0,n){}
	Iter& begin(){return n;}
	Iter& end(){return i;}
};

//input
template<typename T1,typename T2> istream& operator >> (istream& is,pair<T1,T2>& p){return is>>p.first>>p.second;}
template<typename T1> istream& operator >> (istream& is,tuple<T1>& t){return is >> get<0>(t);}
template<typename T1,typename T2> istream& operator >> (istream& is,tuple<T1,T2>& t){return is >> get<0>(t) >> get<1>(t);}
template<typename T1,typename T2,typename T3> istream& operator >> (istream& is,tuple<T1,T2,T3>& t){return is >>get<0>(t)>>get<1>(t)>>get<2>(t);}
template<typename T1,typename T2,typename T3,typename T4> istream& operator >> (istream& is,tuple<T1,T2,T3,T4>& t){return is >> get<0>(t)>>get<1>(t)>>get<2>(t)>>get<3>(t);}
template<typename T> istream& operator >> (istream& is,vector<T>& as){for(int i:range(as.size()))is >>as[i];return is;}
//output
template<typename T> ostream& operator << (ostream& os, const set<T>& ss){for(auto a:ss){if(a!=ss.begin())os<<" "; os<<a;}return os;}
template<typename T1,typename T2> ostream& operator << (ostream& os, const pair<T1,T2>& p){return os<<p.first<<" "<<p.second;}
template<typename K,typename V> ostream& operator << (ostream& os, const map<K,V>& m){bool isF=true;for(auto& p:m){if(!isF)os<<endl;os<<p;isF=false;}return os;}
template<typename T1> ostream& operator << (ostream& os, const tuple<T1>& t){return os << get<0>(t);}
template<typename T1,typename T2> ostream& operator << (ostream& os, const tuple<T1,T2>& t){return os << get<0>(t)<<" "<<get<1>(t);}
template<typename T1,typename T2,typename T3> ostream& operator << (ostream& os, const tuple<T1,T2,T3>& t){return os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t);}
template<typename T1,typename T2,typename T3,typename T4> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4>& t){return os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t)<<" "<<get<3>(t);}
template<typename T> ostream& operator << (ostream& os, const vector<T>& as){for(int i:range(as.size())){if(i!=0)os<<" "; os<<as[i];}return os;}
template<typename T> ostream& operator << (ostream& os, const vector<vector<T>>& as){for(int i:range(as.size())){if(i!=0)os<<endl; os<<as[i];}return os;}

// values
template<typename T> inline T INF(){assert(false);};
template<> inline int INF<int>(){return 1<<28;};
template<> inline ll INF<ll>(){return 1LL<<58;};
template<> inline double INF<double>(){return 1e16;};
template<> inline long double INF<long double>(){return 1e16;};

template<class T> inline T EPS(){assert(false);};
template<> inline int EPS<int>(){return 1;};
template<> inline ll EPS<ll>(){return 1LL;};
template<> inline double EPS<double>(){return 1e-8;};
template<> inline long double EPS<long double>(){return 1e-8;};

// min{2^r | n < 2^r}
template<typename T> T upper_pow2(T n){ T res=1;while(res<n)res<<=1;return res;}
// max{d | 2^d  <= n}
template<typename T> T msb(T n){ int d=62;while((1LL<<d)>n)d--;return d;}

template<typename T,typename U> T pmod(T v,U M){return (v%M+M)%M;}


template<class Cost> struct Edge{
    int to;Cost cost;
    Edge(int to,Cost cost):to(to),cost(cost){};
    bool operator<(Edge r) const{ return cost<r.cost;}
    bool operator>(Edge r) const{ return cost>r.cost;}
};
template<class Cost> ostream& operator << (ostream& os, const Edge<Cost>& e){ return os<<"(->"<<e.to <<","<<e.cost<<")";}
template<class Cost> using Graph = vector<vector<Edge<Cost>>>;

template<class Cost> vector<Cost> dijkstra(const Graph<Cost>& g,const int s){
    vector<Cost> ds(g.size(),0);ds[s]=INF<ll>();
    priority_queue<pair<Cost,int>,vector<pair<Cost,int>>> que;que.push({INF<ll>(),s});
    while(!que.empty()){
        Cost c;int v;tie(c,v)=que.top();que.pop();
        for(const Edge<Cost>& e:g[v]){
            Cost nxtc= min(c,e.cost);
            if(nxtc > ds[e.to]){
                ds[e.to]=nxtc;
                que.push({nxtc,e.to});
            }
        }
    }
    return ds;
}


ll MOD = 1e9+7;
class Main{
	public:
	void run(){
		int N,M;cin >> N >> M;
		vector<ll> ws(N);cin >> ws;
		vector<pair<int,int>> ps(M); cin >> ps;
		for(int i:range(M))ps[i].first--,ps[i].second--;

		Graph<ll> g(2*N);
		for(int i:range(N)) g[i].push_back({i+N,ws[i]});
		for(int i:range(M)){
			int f,t;tie(f,t)=ps[i];
			g[f+N].push_back({t,INF<ll>()});
		}

		vector<vector<ll>> dp(1050,vector<ll>(1050));
		dp[0][0] = 1;
		for(int i:range(1,1050))for(int j:range(0,1050)){
			// i-1個で既に全射 or i個目で新たに全射
			dp[i][j] = (j*(dp[i-1][j] + dp[i-1][j-1])%MOD)%MOD;
		}
		ll res = 0;
		for(int i:range(N)){
			vector<ll> ds = dijkstra(g,i);
			cerr << ds << endl;
			for(int j:range(N))if( ds[j+N] == ws[j]){
				res = (res + dp[ws[i]][ws[j]])%MOD;
			}
		}
		cout << res << endl;
	}
};

int main(){
	cout <<fixed<<setprecision(20);
	cin.tie(0);
	ios::sync_with_stdio(false);
	Main().run();
	return 0;
}

yukicoder

結果

テストケース

ソースコード