Submission #40959341

---

Source Code Expand

#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define op(x) ((x&1)?x+1:x-1)
#define odd(x) (x&1)
#define even(x) (!odd(x))
#define lc(x) (x<<1)
#define rc(x) (lc(x)|1)
#define lowbit(x) (x&-x)
#define mp(x,y) make_pair(x,y)
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
using namespace std;
const int MAXN=15,MAXM=150,mod=1e9+7;
void add(int& x,int y){x=(x+y)%mod;}
void sub(int& x,int y){x=(x-y+mod)%mod;}
int addv(int x,int y){return (x+y)%mod;}
int subv(int x,int y){return (x-y+mod)%mod;}
int mypow(int a,int n){
	if(!n)return 1;
	int tmp=mypow(a,n/2);tmp=1ll*tmp*tmp%mod;
	if(n&1)tmp=1ll*tmp*a%mod;return tmp;
}

int n,m,G[MAXN][MAXN],ans;
int cnt[MAXN][1<<MAXN];

int u[MAXM],v[MAXM];

int fv[MAXN],gv[MAXN],dp[1<<MAXN];

int main(){
	cin>>n>>m;

	rep(i,0,n-1){fv[i]=(1<<i)-1;gv[i]=(1<<i);}

	rep(i,0,m-1){
		cin>>u[i]>>v[i];
		u[i]--;v[i]--;
	}
	ans=mypow(2,m);

	rep(i,0,m-1)G[u[i]][v[i]]=1;

	rep(i,0,n-1)rep(j,0,(1<<n)-1){
		rep(k,0,n-1)if((j>>k&1) && G[i][k])cnt[i][j]++;
	}

	dp[0]=1;

	rep(S,0,(1<<n)-1)if(dp[S]){
		int R=((1<<n)-1)^S;
		for(int T=R;T;T=(T-1)&R){
			if((T&1) != (T>>1&1))continue;
			int ways=1;
			rep(i,0,n-1)if(!(S>>i&1) && !(T>>i&1)){
				ways=1ll*ways*fv[cnt[i][T]]%mod;
			}
			rep(i,0,n-1)if(T>>i&1){
				ways=1ll*ways*gv[cnt[i][R^T]]%mod;
			}
			add(dp[S^T],1ll*dp[S]*ways%mod);
		}
	}

	sub(ans,dp[(1<<n)-1]);
	cout<<ans<<endl;;

    return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int mypow(int, int)’:
./Main.cpp:23:2: warning: this ‘if’ clause does not guard... [-Wmisleading-indentation]
   23 |  if(n&1)tmp=1ll*tmp*a%mod;return tmp;
      |  ^~
./Main.cpp:23:27: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘if’
   23 |  if(n&1)tmp=1ll*tmp*a%mod;return tmp;
      |                           ^~~~~~

Judge Result