2018-2019 ICPC Southwestern European Regional Programming Contest (SWERC 2018)(Gym102465)

2018-2019 ICPC Southwestern European Regional Programming Contest (SWERC 2018)(Gym102465)

C

题意：给两组字符串，填一个不大于4X4的网格，要求每一行（列）均选自对应组的字符串。
题解：将数量较多的一组字符串建Trie树，dfs较少的一组，并再Trie树上匹配。

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
const int N=2e3+10;
const int M=1e5+10;
char s[N][4];
int tree[M][26];
int ans,cnt;
void insert(char p[],int len)
{
	int now,i;
	now=0;
	for(i=0;i<len;i++)
	{
		if(!tree[now][p[i]-'a'])
			tree[now][p[i]-'a']=++cnt;
		now=tree[now][p[i]-'a'];
	}
}
void dfs(int dep,int n,int m,int A,int pos[])
{
	if(dep==n)
	{
		ans++;
		return;
	}
	int newpos[4],i,j,flag;
	for(i=1;i<=A;i++)
	{
		flag=1;
	
		for(j=0;j<m;j++)
		{
			if(!tree[pos[j]][s[i][j]-'a'])
			{
				flag=0;
				break;
			}
			newpos[j]=tree[pos[j]][s[i][j]-'a'];
		}
		if(flag)
		{
			dfs(dep+1,n,m,A,newpos);
		}
	}	
} 
int main()
{
	int pos[4],n,m,A,B,i;
	char ss[4];
	memset(pos,0,sizeof(pos));
	scanf("%d%d",&n,&A);
	scanf("%d%d",&m,&B);
	if(A<=B)
	{
		for(i=1;i<=A;i++)
			scanf("%s",s[i]);
		for(i=1;i<=B;i++)
		{
			scanf("%s",ss);
			insert(ss,m);
		}
	}
	else
	{
		for(i=1;i<=A;i++)
		{
			scanf("%s",ss);
			insert(ss,n);
		}
		for(i=1;i<=B;i++)
			scanf("%s",s[i]);
		swap(n,m);
		swap(A,B);
	}
	dfs(0,m,n,A,pos);
	printf("%d\n",ans);
	return 0;
}