https://codeforc.es/contest/1051/problem/D
题意:给一个2*n的块,染黑白两种色;问颜色有k个联通块的方案数;
思路:dp[i][j][0,1,2,3]表示第i列有j个联通块且i列是00,01,10,11颜色结尾的方案数;然后递推;
总结:dp会定义后就觉得简单了,但怎么定义还是经验不够;
#include<algorithm>
#include<set>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<string>
#include<bits/stdc++.h>
using namespace std;
#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-16
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
const int maxn=1e6+9;
const int mod=998244353;
inline ll read()
{
ll f=1,x=0;
char ss=getchar();
while(ss<'0'||ss>'9')
{
if(ss=='-')f=-1;ss=getchar();
}
while(ss>='0'&&ss<='9')
{
x=x*10+ss-'0';ss=getchar();
} return f*x;
}
ll dp[1009][2010][6];
int main()
{
//FAST_IO;
//freopen("input.txt","r",stdin);
int n,k;
cin>>n>>k;
dp[1][1][0]=1;
dp[1][2][1]=1;
dp[1][2][2]=1;
dp[1][1][3]=1;
for(int i=2;i<=n;i++)
{
for(int j=1;j<=k;j++)
{
dp[i][j][0]+=dp[i-1][j][0];
dp[i][j][0]+=dp[i-1][j][1];
dp[i][j][0]+=dp[i-1][j][2];
dp[i][j][0]+=dp[i-1][j-1][3];
dp[i][j][0]%=mod;
dp[i][j][1]+=dp[i-1][j-1][0];
dp[i][j][1]+=dp[i-1][j][1];
if(j>=2)
dp[i][j][1]+=dp[i-1][j-2][2];
dp[i][j][1]+=dp[i-1][j-1][3];
dp[i][j][1]%=mod;
dp[i][j][2]+=dp[i-1][j-1][0];
if(j>=2)
dp[i][j][2]+=dp[i-1][j-2][1];
dp[i][j][2]+=dp[i-1][j][2];
dp[i][j][2]+=dp[i-1][j-1][3];
dp[i][j][2]%=mod;
dp[i][j][3]+=dp[i-1][j-1][0];
dp[i][j][3]+=dp[i-1][j][1];
dp[i][j][3]+=dp[i-1][j][2];
dp[i][j][3]+=dp[i-1][j][3];
dp[i][j][3]%=mod;
}
}
ll ans=0;
ans+=dp[n][k][0];
ans%=mod;
ans+=dp[n][k][1];
ans%=mod;
ans+=dp[n][k][2];
ans%=mod;
ans+=dp[n][k][3];
ans%=mod;
cout<<ans<<endl;
return 0;
}