Submission #1774392

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define N 19
#define mod 1000000007

int n,m,k,a[2*N][2*N],f[1<<N],g[1<<N];

void pls(int &x,int y){x=(x+y)%mod;}

int read(){
	int x=0,f=1;char ch=getchar();
	for (;!isdigit(ch);ch=getchar()) if (ch=='-') f=-f;
	for (;isdigit(ch);ch=getchar()) x=x*10+ch-'0';
	return x*f;
}
 
int main(){
	n=read()-1;m=read();k=read();
	memset(a,255,sizeof(a));
	for (int i=1;i<=k;i++){
		int x=read(),y=read()-1;
		a[x][y]=read();
	}
	for (int i=f[0]=1;i<=m;i++)
		for (int j=0;j<n;j++){
			memset(g,0,sizeof(g));
			for (int k=0;k<(1<<n);k++){
				if (a[i][j]!=1&&(k&(1<<j))==0) pls(g[k],f[k]);
				if (a[i][j]!=0) pls(g[k-(((k>>j)&-(k>>j))<<j)+(1<<j)],f[k]);
			}
			memcpy(f,g,sizeof(f));
		}
	int ans=0;
	for (int i=0;i<(1<<n);i++)
		pls(ans,f[i]);
	printf("%d\n",ans);
	return 0;
}

Submission Info

Judge Result