poj 2192 Zipper(DFS+剪枝)

原创 2015年07月07日 21:29:18

Zipper
Time Limit: 1000MS   Memory Limit: 65536K
Total Submissions: 16825   Accepted: 5998

Description

Given three strings, you are to determine whether the third string can be formed by combining the characters in the first two strings. The first two strings can be mixed arbitrarily, but each must stay in its original order. 

For example, consider forming "tcraete" from "cat" and "tree": 

String A: cat 
String B: tree 
String C: tcraete 

As you can see, we can form the third string by alternating characters from the two strings. As a second example, consider forming "catrtee" from "cat" and "tree": 

String A: cat 
String B: tree 
String C: catrtee 

Finally, notice that it is impossible to form "cttaree" from "cat" and "tree". 

Input

The first line of input contains a single positive integer from 1 through 1000. It represents the number of data sets to follow. The processing for each data set is identical. The data sets appear on the following lines, one data set per line. 

For each data set, the line of input consists of three strings, separated by a single space. All strings are composed of upper and lower case letters only. The length of the third string is always the sum of the lengths of the first two strings. The first two strings will have lengths between 1 and 200 characters, inclusive. 

Output

For each data set, print: 

Data set n: yes 

if the third string can be formed from the first two, or 

Data set n: no 

if it cannot. Of course n should be replaced by the data set number. See the sample output below for an example. 

Sample Input

3
cat tree tcraete
cat tree catrtee
cat tree cttaree

Sample Output

Data set 1: yes
Data set 2: yes
Data set 3: no

Source


题目链接:http://poj.org/problem?id=2192


题目大意:问完全使用两个字符串A,B的字母,能否组成字符串C,组成C串的字母顺序遵从在A,B中的顺序。


解题思路:这题的正解是DP或者记忆化搜索,我用的是DFS+剪枝。两个DFS,一个搜A串,搜索成功后用另一个搜B串。剪枝:1.搜B串时是这样的情况,如果有解,则C串中剩余未搜的字母个数与顺序应该与B串一样,所以第二个搜索不是深搜,而是直接线性判断B,C串对应字母是否一样。2.判断C串最后一个字母是否为A或B串最后一个字母,若不是,直接判断为no。


代码如下:

#include <cstdio>
#include <cstring>
char a[205],b[205],s[410];
int ns,na,nb;
bool q;
void dfsb()
{
	int n=0;
	for(int i=0;i<ns;i++)
	{
		if(s[i]=='0')
			continue;
		if(s[i]!=b[n])
			return;
		n++;
	}
	q=true;
}
void dfsa(int n,int st)
{
	if(q)
		return;
	if(na==n)
	{
		dfsb();
		return ;
	}
	for(int i=st;i<ns;i++)
	{
		if(s[i]==a[n])
		{
			int t=s[i];
			s[i]='0';
			dfsa(n+1,i+1);
			if(q)
				return;
			s[i]=t;
		}
	}
}
int main()
{
	freopen("in.txt","r",stdin);
	int t;
	scanf("%d",&t);
	for(int ca=1;ca<=t;ca++)
	{
		q=false;
		scanf("%s%s%s", a,b,s);
		ns=strlen(s),na=strlen(a),nb=strlen(b);
		if(ns!=nb+na||s[ns-1]!=a[na-1]&&s[ns-1]!=b[nb-1])
		{
			printf("Data set %d: no\n",ca);
			continue;
		}
		dfsa(0,0);
		if(q)
			printf("Data set %d: yes\n",ca);
		else
			printf("Data set %d: no\n",ca);
	}
	return 0;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

POJ 2192 Zipper [dfs+剪枝 || dp]

题意: 给定三个字符串,如果前两个可以拼装成第三个,则输出yes,否则输出no。 思路: 1: DFS: 最直观的思路是可以用dfs去搜,从第三个字符串为目标串去dfs(0,0,0)...

POJ2192 Zipper(DP||DFS)

题意: 输入三个字符串,看前两个字符串能否组成第三个字符串,要求前两个字符串各自的字母顺序在第三个字符串中保持不变 要点: 可以用dp或dfs做,下面是dp的思路: 首先用定义一个数组dp[i][j]...

HDU-1501 (POJ-2192) Zipper (DFS||DP)

要不是放在dp专题里面,我还一直以为只能dfs做 看到一个dp的解法,才明白如何进行状态转移 设dp[i][j]表示串a的前i个字符与串b的前j个字符是否能形成串c的前i+j个字符, 若dp[i-1...

YTU 2896/POJ 2192 Zipper dfs

2896: J--Zipper Time Limit: 1 Sec  Memory Limit: 128 MB Submit: 25  Solved: 11 [Submit][Status][Web ...

poj 2192 DFS+剪枝

题意:在不改变前两个字符串原始顺序的情况下,看能否组成第三个字符串。 思路:DFS+剪枝。递归三个字符串的下标,如果第三个字符串中的字符和前两个字符串中的字符有相等的,那么继续搜索,直到搜索到第一二...

poj2192(Zipper)

题目链接:http://poj.org/problem?id=2192          题意:给你三个字符串,问第三个字符串能否由前两个字符串按顺序组成(第三字符串的长度等于前两个字符串长度之和)...

POJ---2192-Zipper

A - Zipper Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u ...

POJ2192(Zipper)

DescriptionGiven three strings, you are to determine whether the third string can be formed by combi...

poj2192 Zipper(dp)

Zipper Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 17961 Accepte...

POJ-2192-Zipper

这个题要求求出C字符串能否由A字符串和B字符串组成 类似LCS,将字符串进行分别进行状态转移即可         dp[i][j]=max(dp[i-1][j],dp[i][j-1]);  ...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)