Submission #873624

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define all(c) c.begin(),c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
using namespace std;
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){return o<<"("<<p.fs<<","<<p.sc<<")";}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){o<<"sz = "<<vc.size()<<endl<<"[";for(const T& v:vc) o<<v<<",";o<<"]";return o;}
int N,M,C,D,A[2][20];
bool no[20][20];
int dp[1<<20][2][20];
int inf=1e9;
bool B(int x,int y){return (x>>y)&1;}
int bc(int x){
	if(x==0) return 0;
	return __builtin_popcount(x);
}
bool ok[1<<20][20];
int main(){
	cin>>N>>M>>C>>D;
	rep(i,N) cin>>A[0][i]>>A[1][i];
	rep(i,M){
		int x,y;
		cin>>x>>y;
		x--,y--;
		no[x][y]=1;
	}
	rep(i,1<<N) rep(j,N){
		if(B(i,j)){
			ok[i][j]=0;
		}else{
			ok[i][j]=1;
			rep(k,N) if(!B(i,k)&&no[k][j]) ok[i][j]=0;
		}
	}
	rep(i,1<<N) rep(p,2) rep(a,N) dp[i][p][a]=inf;
	dp[0][0][0]=dp[0][1][0]=0;
	rep(i,1<<N){
		rep(p,2){
			int MX=bc(i);
			rep(a,MX+1) if(dp[i][p][a]!=inf){
				rep(x,N) if(ok[i][x]){
					chmin(dp[i|(1<<x)][p][a],dp[i][p][a]+A[p][x]);
					chmin(dp[i|(1<<x)][1-p][a+1],dp[i][p][a]+A[p][x]+C*a+D);
				}
			}
		}
	}
	int ans=inf;
	rep(p,2) rep(a,N) chmin(ans,dp[(1<<N)-1][p][a]);
	cout<<ans<<endl;
}

Submission Info

Judge Result