zoukankan      html  css  js  c++  java
  • HDU 1501

    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,'',sizeof(res));  //我调试了快半个小时了,才发现假设用0的话数组不能全然清空
            memset(res,0,sizeof(vis));
            dfs(0,0);
            printf("Data set %d:",cnt1++);
            if(flag)
                printf(" yes
    "); //注意空格
            else
                printf(" no
    ");
        }
        return 0 ;
    }
    

  • 相关阅读:
    [Luogu 2261] CQOI2007 余数求和
    [Luogu 3178] HAOI2013 树上操作
    「模板」 树链剖分 HLD
    「模板」 线段树——区间乘 && 区间加 && 区间求和
    [Luogu 2221] HAOI2012 高速公路
    [Luogu 3973] TJOI2015 线性代数
    「模板」 01 Trie实现平衡树功能
    [Luogu 1640] SCOI2010 连续攻击游戏
    [Luogu 1402] 酒店之王
    [Luogu 1963] NOI2009 变换序列
  • 原文地址:https://www.cnblogs.com/zhchoutai/p/6851650.html
Copyright © 2011-2022 走看看