zoukankan      html  css  js  c++  java
  • 搜索专题: HDU1501Zipper

    Zipper

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


    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
     

    Source

     
    Problem : 1501 ( Zipper )     Judge Status : Accepted
    RunId : 21249294    Language : G++    Author : hnustwanghe
    Code Render Status : Rendered By HDOJ G++ Code Render Version 0.01 Beta
    #include<iostream>
    #include<cstring>
    #include<cstdio>
    
    using namespace std;
    const int N = 200 + 5;
    char a[N],b[N],c[2*N];
    bool visit[N][N],can_find;
    
    void DFS(int i,int j,int k){
        if(can_find || visit[i][j]) return;
        if(c[k]==''){can_find = true;return;}
        visit[i][j] = true;
        if(a[i]!='' && a[i] == c[k])
            DFS(i+1,j,k+1);
        if(b[j]!='' && b[j] == c[k])
            DFS(i,j+1,k+1);
    }
    int main(){
        int T,cnt=0;
        scanf("%d",&T);
        while(T--){
            scanf("%s %s %s",a,b,c);
            memset(visit,0,sizeof(visit));
            can_find = false;
            DFS(0,0,0);
            printf("Data set %d: %s
    ",++cnt,can_find?"yes":"no");
        }
        return 0;
    }
    
  • 相关阅读:
    乐字节Java编程语言发展,面向对象和类
    乐字节Java编程之方法、调用、重载、递归
    乐字节Java循环:循环控制和嵌套循环
    乐字节Java反射之四:反射相关操作
    乐字节Java反射之三:方法、数组、类加载器和类的生命周期
    乐字节Java反射之二:实例化对象、接口与父类、修饰符和属性
    乐字节Java反射之一:反射概念与获取反射源头class
    Java变量与数据类型之三:数据类型与转义字符
    数论 N是完全平方数 充分必要条件 N有奇数个约数
    动态规划专题 01背包问题详解 HDU 2546 饭卡
  • 原文地址:https://www.cnblogs.com/Pretty9/p/7347711.html
Copyright © 2011-2022 走看看