Submission #2945091


Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <cstring>
#include <queue>
#include <set>
#include <functional>
#include <map>
#include <cmath>
#define MX 2005
#define MOD 998244353

using namespace std;
typedef long long int ll;
typedef pair <int,int> P;

set <ll> st;
set <ll>::iterator it;
map <ll,int> mp;
queue <ll> que;
vector <int> to[MX];
ll nm[MX][MX];
ll mul[MX][MX];
ll cur[MX][MX];
ll now;
int W,H;
int sz;

void dfs(int S,int pos,int T)
{
	if(pos==W)
	{
		now|=1LL<<T;
	}
	else
	{
		if(!(S>>pos&1)) dfs(S,pos+1,T);
		else
		{
			if(pos==0||!(T>>(pos-1)&1))
			{
				dfs(S,pos+1,T|(1<<pos));
			}
			if(pos+1<W&&(S>>(pos+1)&1))
			{
				dfs(S,pos+2,T);
			}
		}
	}
}
void solve(ll t)
{
	if(t==1)
	{
		for(int i=0;i<sz;i++)
		{
			for(int j=0;j<sz;j++)
			{
				mul[i][j]=nm[i][j];
			}
		}
		return;
	}
	solve(t/2);
	for(int i=0;i<sz;i++)
	{
		for(int j=0;j<sz;j++)
		{
			cur[i][j]=0;
			for(int k=0;k<sz;k++)
			{
				cur[i][j]+=mul[i][k]*mul[k][j]%MOD;
				if(cur[i][j]>=MOD) cur[i][j]-=MOD;
			}
		}
	}
	for(int i=0;i<sz;i++)
	{
		for(int j=0;j<sz;j++)
		{
			mul[i][j]=cur[i][j];
		}
	}
	if(t%2==1)
	{
		for(int i=0;i<sz;i++)
		{
			for(int j=0;j<sz;j++)
			{
				cur[i][j]=0;
				for(int k=0;k<sz;k++)
				{
					cur[i][j]+=mul[i][k]*nm[k][j]%MOD;
					if(cur[i][j]>=MOD) cur[i][j]-=MOD;
				}
			}
		}
		for(int i=0;i<sz;i++)
		{
			for(int j=0;j<sz;j++)
			{
				mul[i][j]=cur[i][j];
			}
		}
	}
}
int main()
{
	scanf("%d %d",&W,&H);
	st.insert(1);
	sz=0;
	mp[1]=sz++;
	que.push(1);
	while(!que.empty())
	{
		ll v=que.front();
		que.pop();
		for(int S=0;S<1<<W;S++)
		{
			now=0;
			for(int T=0;T<1<<W;T++)
			{
				if((v>>T&1)&&((S|T)==S))
				{
					dfs(S-T,0,0);
				}
			}
			if(now>0)
			{
				if(st.count(now)==0)
				{
					st.insert(now);
					mp[now]=sz++;
					que.push(now);
				}
				nm[mp[v]][mp[now]]++;
			}
		}
	}
	solve(H);
	ll ret=0;
	for(it=st.begin();it!=st.end();it++)
	{
		ll S=*it;
		if(S>>0&1)
		{
			ret+=mul[0][mp[S]];
			if(ret>=MOD) ret-=MOD;
		}
	}
	printf("%lld\n",ret);
	return 0;
}

Submission Info

Submission Time
Task H - タイル張り
User yutaka1999
Language C++14 (GCC 5.4.1)
Score 1000
Code Size 2225 Byte
Status AC
Exec Time 7 ms
Memory 4480 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:110:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&W,&H);
                      ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1000 / 1000
Status
AC × 3
AC × 25
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, s1.txt, s2.txt, s3.txt
Case Name Status Exec Time Memory
01.txt AC 6 ms 4480 KB
02.txt AC 2 ms 4352 KB
03.txt AC 6 ms 4480 KB
04.txt AC 6 ms 4480 KB
05.txt AC 6 ms 4480 KB
06.txt AC 2 ms 4480 KB
07.txt AC 2 ms 4480 KB
08.txt AC 2 ms 4480 KB
09.txt AC 2 ms 4480 KB
10.txt AC 2 ms 4352 KB
11.txt AC 2 ms 4352 KB
12.txt AC 2 ms 4352 KB
13.txt AC 6 ms 4480 KB
14.txt AC 2 ms 4352 KB
15.txt AC 2 ms 4352 KB
16.txt AC 2 ms 4352 KB
17.txt AC 2 ms 4480 KB
18.txt AC 2 ms 4352 KB
19.txt AC 2 ms 4352 KB
20.txt AC 7 ms 4480 KB
21.txt AC 5 ms 4480 KB
22.txt AC 7 ms 4480 KB
s1.txt AC 2 ms 4352 KB
s2.txt AC 2 ms 4352 KB
s3.txt AC 3 ms 4480 KB