【hdu】Zipper (dfs)
来源:互联网 发布:xp查mac地址命令 编辑:程序博客网 时间:2024/05/17 06:23
Zipper
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 131072/65536K (Java/Other)
Total Submission(s) : 11 Accepted Submission(s) : 5
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
3cat tree tcraetecat tree catrteecat tree cttaree
Sample Output
Data set 1: yesData set 2: yesData set 3: no
注意visit数组标记,表示已经搜索过,否则超时! (dfs+visit标记 )
#include<cstdio>#include<cstring>char str1[210],str2[210],str[410],visit[210][210];int len1,len2,len,flag;void dfs(int a,int b,int c){ /* if(a==len1&&b==len2&&c==len){flag=1;return;} if(a>len1||b>len2) return; if(str[c]==str1[a])dfs(a+1,b,c+1); if(str[c]==str2[b])dfs(a,b+1,c+1); if(str[c]!=str1[a]||str[c]!=str2[b])return; */ if(c==len) {flag=1;return;} if(flag)return ; if(visit[a][b])return; visit[a][b]=1; if(str[c]==str1[a])dfs(a+1,b,c+1); if(str[c]==str2[b])dfs(a,b+1,c+1); if(str[c]!=str1[a]||str[c]!=str2[b])return; } int main(){ int n,i,j,t=0; scanf("%d",&n); while(n--) { getchar(); t++; memset(visit,0,sizeof(visit)); scanf("%s%s%s",str1,str2,str); len1=strlen(str1); len2=strlen(str2); len=len1+len2; flag=0; dfs(0,0,0); if(flag)printf("Data set %d: yes\n",t); else printf("Data set %d: no\n",t); }return 0;}
- 【hdu】Zipper (dfs)
- HDU 1501 Zipper(DFS)
- HDU 1501 Zipper (DFS)
- hdu 1501 Zipper(dfs)
- 【DFS(记忆化)】hdu 1501 Zipper
- Zipper(HDU 1501) —— DFS
- HDU:1501 Zipper(DFS+剪枝)
- hdu 1501 Zipper (DFS)
- HDU 1501 Zipper(DFS)
- HDU 1501 Zipper 【DFS】
- hdu dfs Zipper
- HDU 1501 Zipper(DFS)
- hdu 1501 Zipper(DFS)
- Hdu 1501 Zipper【dfs】
- HDU 1501 Zipper (DFS)
- HDU 1501 Zipper(DP,DFS)
- HDU 1501 Zipper(DP,DFS)
- HDU1501 Zipper(DFS)
- 角斗士(Blokus)博弈程序
- 【hdu】 Prime Ring Problem (深搜)
- c#调用存储过程,提供了参数老是提示“没有提供该参数”
- 读书笔记之内核数据结构一链表
- PTES Technical Guidelines
- 【hdu】Zipper (dfs)
- Body Transformer for Nokia N9
- Server 2003安全脚本[转]
- JAVA中Applet的生命周期
- 设计模式php实例:适配器模式
- 【aoj 】 幂集(回溯)
- WEB渗透技术流程(收集)
- 机器人挖金矿的动态规划算法
- STM32菜鸟成长记录---1