Submission #3425909

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<vector>
#define p 1000000007
using namespace std;
int n,m,dp[330][330][330];
long long ans;
struct evol{int l,xi;};
vector<evol> v[303];
bool check(int x,int y,int z,int d)
{
	if(x&&x==y||y&&y==z||x&&x==z) return 0;
	if(x>y) swap(x,y);
	if(z<y) swap(z,y);
	if(y<x) swap(x,y);
	bool fl=1;
	for(int i=0;i<v[d].size();i++)
	{
		if(v[d][i].xi==1) fl&=(x<v[d][i].l)&&(y<v[d][i].l)&&(z>=v[d][i].l);
		if(v[d][i].xi==2) fl&=(x<v[d][i].l)&&(y>=v[d][i].l);
		if(v[d][i].xi==3) fl&=(x>=v[d][i].l);
	}
	return fl;
}
void add(int x,int y,int z,int k)
{
	(dp[k][y][z]+=dp[x][y][z])%=p;
	(dp[x][k][z]+=dp[x][y][z])%=p;
	(dp[x][y][k]+=dp[x][y][z])%=p;
}
int main()
{
	scanf("%d%d",&n,&m);
	for(int i=1;i<=m;i++)
	{
		int x,y,z;
		scanf("%d%d%d",&x,&y,&z);
		v[y].push_back((evol){x,z});
	}
	dp[1][0][0]=dp[0][1][0]=dp[0][0][1]=1;
	for(int k=1;k<n;k++)
		for(int i=0;i<=k;i++)
			for(int j=0;j<=k;j++)
			{
				if(check(i,j,k,k)) add(i,j,k,k+1);
				if(check(i,k,j,k)) add(i,k,j,k+1);
				if(check(k,i,j,k)) add(k,i,j,k+1);
			}
	for(int i=0;i<=n;i++)
		for(int j=0;j<=n;j++)
		{
			if(check(i,j,n,n)) (ans+=dp[i][j][n])%=p;
			if(check(i,n,j,n)) (ans+=dp[i][n][j])%=p;
			if(check(n,i,j,n)) (ans+=dp[n][i][j])%=p;
		}
	printf("%lld\n",ans);
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:33:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&m);
                     ^
./Main.cpp:37:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d",&x,&y,&z);
                           ^

Judge Result