Submission #1775619

---

Source Code Expand

#include<cstdio>
#include<cstring>
#include<algorithm>
#define N 1100000
#define mod 1000000007
using namespace std;
int n, m, k, bin[25], f[N], g[N][25], map[25][25], x, y, z, sum, LOG[N], ans, ff, L, last;
int main(){
	scanf("%d%d%d", &n, &m, &k);
	bin[0]=1; for(int i=1; i<=n; i++)bin[i]=bin[i-1]<<1;
	LOG[0]=-1; for(int i=1; i<=bin[n]; i++)LOG[i]=LOG[i>>1]+1;
	for(int i=1; i<=m; i++)
		for(int j=1; j<=n; j++)map[i][j]=2;
	for(int i=1; i<=k; i++){scanf("%d%d%d", &x, &y, &z); map[x][y]=z^1;}
	if(n==1){printf("1"); return 0;} n--;
	memset(g, 0, sizeof(g)); sum=1;
	for(int owo=1; owo<=m; owo++){
		memset(f, 0, sizeof(f));
		for(int s=0; s<=bin[n]-1; s++){
			ff=1;
			for(int i=1; i<=n; i++)if(((s&bin[n-i])?1:0)==map[owo][i]){ff=0; break;}
			if(!ff)continue;
			for(int i=1; i<=n; i++)if(!(s&bin[i-1])){
				f[s]+=g[((s+bin[i-1])>>(i-1))<<(i-1)][1]; if(f[s]>=mod)f[s]-=mod;
			}
			f[s]=sum-f[s]; if(f[s]<0)f[s]+=mod;
		}
		sum=0;
		for(int s=0; s<=bin[n]-1; s++){sum+=f[s]; if(sum>=mod)sum-=mod;}
		memset(g, 0, sizeof(g));
		for(int s=bin[n]-1; s; s--){
			L=n-LOG[s&(-s)]; g[s][L]=f[s];
			for(int i=1; i<=n-L; i++){g[s][L]+=g[s+bin[n-L-i]][L+i]; if(g[s][L]>=mod)g[s][L]-=mod;}
		}
		for(int s=1; s<=bin[n]-1; s++){
			L=n-LOG[s&(-s)]; last=n;
			for(int i=L-1; i; i--){
				g[s][i]=g[s][i+1];
				if(!(s&bin[n-L+i])){
					if(last==n)continue;
					g[s][i]+=g[s+bin[n-L+i]-bin[last]][i+1]; if(g[s][i]>=mod)g[s][i]-=mod;
				}else last=n-L+i;
			}
		}
	}
	ans=0; for(int i=0; i<=bin[n]-1; i++){ans+=f[i]; if(ans>=mod)ans-=mod;}
	printf("%d", ans);
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:9:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d", &n, &m, &k);
                             ^
./Main.cpp:14:53: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1; i<=k; i++){scanf("%d%d%d", &x, &y, &z); map[x][y]=z^1;}
                                                     ^

Judge Result