HDU 1501

原创 2015年07月11日 10:39:56
Zipper

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 7813    Accepted Submission(s): 2765

Problem 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

//本题主要思路根据第三个字符串dnf搜索从前两个字符串中查找,查找到的字符放入数组res中,当res与第三个字符串相等时搜索结

//束

#include <stdio.h>
#include <string.h>
char ss[420];
char s1[210];
char s2[210];
char res[420];
bool vis[210][210];   //用数组记录很重要不然会超时
int flag,cnt,len1,len2;
void dfs(int ini,int init)
{
    if(vis[ini][init]) return;
    vis[ini][init]=1;      
    if(strcmp(res,ss)==0)
    {
        flag=1;
        return;
    }
    else
    {
            if(s1[ini]==ss[cnt])  //当搜索到与第三字符串中的字符相等时记录下字符再递归搜索
            {
                res[cnt++]=s1[ini];
                dfs(ini+1,init);
                cnt--;
                if(flag)
                    return;
            }
         if(s2[init]==ss[cnt])
            {
                res[cnt++]=s2[init];
                dfs(ini,init+1);
                cnt--;
                if(flag)
                    return;

            }
    }
}

int main()
{
    int n;
    int cnt1=1;
    scanf("%d",&n);
    getchar();
    while(n--)
    {
        scanf("%s%s%s",s1,s2,ss);
        len1=strlen(s1);
        len2=strlen(s2);
        cnt=flag=0;
        memset(res,'\0',sizeof(res));  //我调试了快半个小时了,才发现如果用0的话数组不能完全清空
        memset(res,0,sizeof(vis));
        dfs(0,0);
        printf("Data set %d:",cnt1++);
        if(flag)
            printf(" yes\n"); //注意空格
        else
            printf(" no\n");
    }
    return 0 ;
}

相关文章推荐

hdu 1501 解题报告

题意: 给出两个字符串str1 和 str2,然后再给出一个字符串str3。问从串str3中去除掉str1后剩余的串和串str2是否相等。 分析:刚开始看到这道题的时候,觉得这是一个模拟题,从串s...

HDU-1501 Zipper DFS+记忆化搜索

博客园社区首页新随笔联系管理订阅 随笔- 649  文章- 10  评论- 54  HDU-1501 Zipper DFS+记忆化搜索    ...

Hdu 1501 Zipper

Zipper Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total S...

搜索专题: HDU1501Zipper

Zipper Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total S...

poj2192 | HDU1501 - Zipper(最长公共子序列)

Zipper Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 14117   Accepted: 4958 ...
  • yew1eb
  • yew1eb
  • 2013年05月25日 14:39
  • 1515

HDU:1501 Zipper(DFS+剪枝)

Zipper Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total S...
  • zugofn
  • zugofn
  • 2017年03月22日 19:20
  • 244

HDU1501 - Zipper - dfs

1.题目描述: Zipper Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Oth...

hdu 1501 Zipper 拉链

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1501 本题给出了A、B、C三个字符串,找出A、B字符串能否拼接成C字符串,并且C字符串中要保持A、B的...

HDU 1501 Zipper

Problem Description Given three strings, you are to determine whether the third string can be for...

hdu1501 Zipper(dfs && dp)

挺不错的题。第一反应是模拟字符串匹配,但第二个样例就否定了。 str1 = cat, str2 =  tree, str = catrtee,当主串匹配到第四个字符t时,问题来了,是匹配第一个的还是...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:HDU 1501
举报原因:
原因补充:

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