poj 1699 Best<script type=

 

Best Sequence

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 2718		Accepted: 1062

Description

The twenty-first century is a biology-technology developing century. One of the most attractive and challenging tasks is on the gene project, especially on gene sorting program. Recently we know that a gene is made of DNA. The nucleotide bases from which DNA is built are A(adenine), C(cytosine), G(guanine), and T(thymine). Given several segments of a gene, you are asked to make a shortest sequence from them. The sequence should use all the segments, and you cannot flip any of the segments. 

For example, given 'TCGG', 'GCAG', 'CCGC', 'GATC' and 'ATCG', you can slide the segments in the following way and get a sequence of length 11. It is the shortest sequence (but may be not the only one). 

Input

The first line is an integer T (1 <= T <= 20), which shows the number of the cases. Then T test cases follow. The first line of every test case contains an integer N (1 <= N <= 10), which represents the number of segments. The following N lines express N segments, respectively. Assuming that the length of any segment is between 1 and 20.

Output

For each test case, print a line containing the length of the shortest sequence that can be made from these segments.

Sample Input

1
5
TCGG
GCAG
CCGC
GATC
ATCG

Sample Output

11

Source

POJ Monthly--2004.07.18

 

 

/* 纯DFS搜索版本，需要提前算出incre[][], incre[i][j]表示在地i个单词后面增加 第j个单词后增加的长度 */ #include <iostream> #include <string> #include <cmath> #define minv(a, b) ((a) <= (b) ? (a) : (b)) #define MAX_N 10 using namespace std; string input[MAX_N + 1]; int expv[10], minLen = INT_MAX, n, finalState; int incre[10][10]; bool used(int state, int which) { if(state & expv[which]) return true; else return false; } int set(int state, int which) { return state | expv[which]; } int getIncre(const string &str, const string &strs) { int len1 = str.length(), len2 = strs.length(); int p1 = len1 - 1, p2 = 0; int l = minv(len1, len2); for(int p = len1 - l; p < len1; p++) { if(str.substr(p, len1 - p) == strs.substr(0, len1 - p)) { return len2 - len1 + p; //return str + strs.substr(len1 - p, len2 - len1 + p); } } //return str + strs; return len2; } void dfs(int depth, int curLen, int curState, int last) { if(depth > n) { if(curLen < minLen) minLen = curLen; return; } if(curLen > minLen) return; int p; for(p = 0; p < n; p++) { if(used(curState, p)) continue; int newLen; if(last == -1) newLen = input[p].length(); else newLen = curLen + incre[last][p]; dfs(depth + 1, newLen, set(curState, p), p); } } int main() { int i, j, caseNum; expv[0] = 1; for(i = 1; i < 10; i++) expv[i] = expv[i - 1] * 2; cin>>caseNum; while(caseNum--) { minLen = INT_MAX; cin>>n; int k = n; n = 0; for(i = 0; i < k; i++) { cin>>input[n++]; for(j = 0; j < i; j++) if(input[i] == input[j]) { n--; break; } } for(i = 0; i < n; i++) { for(j = 0; j < n; j++) { if(i == j)continue; incre[i][j] = getIncre(input[i], input[j]);   } } dfs(1, 0, 0, -1); cout<<minLen<<endl; } return 0; } /* 动态规划版本，利用二进制表示状态，第i位为1表示 第i个单词被使用 dp[i][j]表示状态i下以第j个单词结尾所能取得的最短长度 dp[i][j] = min{dp[i'(take j off from i)][for all state k in i'] + incre[j][k]} */ #include <iostream> #include <string> #include <cmath> #define minv(a, b) ((a) <= (b) ? (a) : (b)) #define MAX_N 10 #define MAX_S 1024 using namespace std; string input[MAX_N + 1]; int expv[10], minLen = INT_MAX, n; int incre[10][10]; //incre[i][j]表示在单词i后面添加单词j可以增加的长度 int finalState; int dp[MAX_S + 5][MAX_N + 1]; bool v[MAX_S + 5]; bool used(int state, int which) { if(state & expv[which]) return true; else return false; } int set(int state, int which) { return state | expv[which]; } int unset(int state, int which) { return state - expv[which]; } int getIncre(const string &str, const string &strs) { int len1 = str.length(), len2 = strs.length(); int p1 = len1 - 1, p2 = 0; int l = minv(len1, len2); for(int p = len1 - l; p < len1; p++) if(str.substr(p, len1 - p) == strs.substr(0, len1 - p)) return len2 - len1 + p; return len2; } void dpCall(int state) { for(int i = 0; i < n; i++) { if(!used(state, i)) continue; int lstate = unset(state, i); if(lstate == 0){ dp[state][i] = input[i].length(); break; } int minl = INT_MAX; for(int j = 0; j < n; j++) { if(!used(lstate, j)) continue; minl = minv(minl, dp[lstate][j] + incre[j][i]); } if(dp[state][i] == 0 || dp[state][i] > minl) dp[state][i] = minl; } } //state表示当前的使用状态, curLen表示当前一共有多少单词被使用 void dfsDp(int state, int curLen) { if(v[state]) return; if(curLen == 0) return; else { for(int i = 0; i < n; i++) { if(!used(state, i)) continue; dfsDp(unset(state, i), curLen - 1); } dpCall(state); v[state] = true; } } int main() { int i, j, caseNum; expv[0] = 1; for(i = 1; i < 10; i++) expv[i] = expv[i - 1] * 2; cin>>caseNum; while(caseNum--) { minLen = INT_MAX; cin>>n; int k = n; n = 0; memset(dp, 0, sizeof(dp)); memset(v, 0, sizeof(v)); finalState = 0; for(i = 0; i < k; i++) { cin>>input[n++]; bool use = true; for(j = 0; j < i; j++) if(input[i] == input[j]) { n--; use = false; break; } if(use) finalState += expv[n - 1]; } for(i = 0; i < n; i++) { for(j = 0; j < n; j++) { if(i == j) continue; incre[i][j] = getIncre(input[i], input[j]); } } dfsDp(finalState, n, n); for(i = 0; i < n; i++) minLen = minv(minLen, dp[finalState][i]); cout<<minLen<<endl; } return 0; }