POJ2192--Zipper(dp)
来源:互联网 发布:这两天手机网络怎么了 编辑:程序博客网 时间:2024/05/12 17:55
Do more with less
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: tcraeteAs 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: catrteeFinally, 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
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
思路
代码
#include<iostream>#include<cstdio>#include<cstring>using namespace std;int dp[300][300];struct zipper{ char a[210]; char b[210]; char c[420];}zip[1000];bool zips(struct zipper zip){ dp[0][0] = 1; int n = strlen(zip.a); int m = strlen(zip.b); // int nm = strlen(zip.c); for(int i = 0; i <= n; ++i) { for(int j = 0; j <= m; ++j) { if(i > 0 && (dp[i-1][j] == 1) && (zip.c[i+j-1] == zip.a[i-1])) { dp[i][j] = 1; } if(j > 0 && (dp[i][j-1] == 1) && (zip.c[i+j-1] == zip.b[j-1])) { dp[i][j] = 1; } } } if(dp[n][m]) return true; else return false;}int main(){ int n; scanf("%d",&n); for(int i = 1; i <= n; i ++) scanf("%s %s %s",zip[i].a,zip[i].b,zip[i].c); for(int i = 1; i <= n; i ++) { memset(dp,0,sizeof(dp)); if(zips(zip[i])) printf("Data set %d: yes\n",i); else printf("Data set %d: no\n",i); } return 0;}
- poj2192 Zipper(DP)
- POJ2192--Zipper(dp)
- POJ2192 Zipper(DP||DFS)
- POJ2192 Zipper(简单DP)
- POJ2192:Zipper(DP)
- poj2192 Zipper(dp)
- (DP)POJ2192—Zipper
- poj2192(Zipper)
- 【POJ2192】Zipper(动态规划)
- Zipper(poj2192)dfs+剪枝
- POJ2192 Zipper
- poj2192 - Zipper
- poj2192 Zipper
- POJ2192 Zipper
- POJ2192(Zipper)
- POJ2192(Zipper)
- poj2192 Zipper
- poj2192——Zipper(动态规划)
- spring学习笔记(自动装配)
- 什么情况下document.write会覆盖页面及覆盖原理解释
- BZOJ 2754: [SCOI2012]喵星球上的点名
- canvas的drawimage使图片失真变模糊的解决方法
- UDP程序设计
- POJ2192--Zipper(dp)
- 信号与槽在父子类之间传递以及执行顺序
- The content of element type "struts" must match "((package|include|bean|constant)*,unknown-handler-s
- elasticsearch 5.4映射类型语法变化
- 嵌入式Linux系统设计--第二章:嵌入式Linux系统设计
- hadf的常见命令
- ListView条目的多条删除
- C#网络编程(六、Socket文件传输)
- android 5.0以下系统Intent传递序列化对象的bug