【Sicily】1035. DNA matching

原创 2016年06月01日 10:17:37

一、题目

1035. DNA matching

Constraints

Time Limit: 1 secs, Memory Limit: 32 MB

Description

DNA (Deoxyribonucleic acid) is founded in every living creature as the storage medium for genetic information. It is comprised of subunits called nucleotides that are strung together into polymer chains. DNA polymer chains are more commonly called DNA strands.

    There are four kinds of nucleotides in DNA, distinguished by the chemical group, or base attached to it. The four bases are adenine, guanine, cytosine and thymine, abbreviated as A, G, C and T(these letters will be used to refer to nucleotides containing these bases). Single nucleotides are linked together end-to-end to form DNA single strands via chemical reactions. For simplicity, we can use a string composed of letters A, T, C and G to denote a single strand, such as ATTCGAC, but we must also note that the sequence of nucleotides in any strand has a natural orientation, so ATTCGAC and CAGCTTA can not be viewed as identical strands.

    DNA does not usually exist in nature as free single strands, though. Under appropriate conditions single strands will pair up and twist around each other, forming the famous double helix structure. This pairing occurs because of a mutual attraction, call hydrogen bonding, that exists between As and Ts, and between Gs and Cs. Hence A/T and G/C are called complementary base pairs.

In the Molecular Biology experiments dealing with DNA, one important process is to match two complementary single strands, and make a DNA double strand. Here we give the constraint that two complementary single strands must have equal length, and the nucleotides in the same position of the two single strands should be complementary pairs. For example, ATTCGAC and TAAGCTG are complementary, but CAGCTTA and TAAGCTG are not,  neither are ATTCGAC and GTAAGCT.

As a biology research assistant, your boss has assigned you a job: given n single strands, find out the maximum number of double strands that could be made (of course each strand can be used at most once). If n is small, of course you can find the answer with the help of pen and paper, however, sometimes n could be quite large… Fortunately you are good at programming and there is a computer in front of you, so you can write a program to help yourself. But you must know that you have many other assignments to finish, and you should not waste too much time here, so, hurry up please!

Input

Input may contain multiple test cases. The first line is a positive integer T(T<=20), indicating the number of test cases followed. In each test case, the first line is a positive integer n(n<=100), denoting the number of single strands below. And n lines follow, each line is a string comprised of four kinds of capital letters, A, T, C and G. The length of each string is no more than 100.

Output

For each test case, the output is one line containing a single integer, the maximum number of double strands that can be formed using those given single strands.

Sample Input

23ATCGTAGCTAGG2AATTATTA

Sample Output

10

Problem Source

ZSUACM Team Member



二、题目的大意

DNA配对:输入若干条DNA链,找出其中配对的对数,其中A与T配对,C与G配对,并且是不重复配对。要求相配对的DNA链长度必须相同,并且对应位置上的字母俩俩配对



三、解题思路

主要用到string的知识点:对每条输入的DNA链给予两个属性,一个是length属性,一个是bool类型的used属性,length属性存放的是每条DNA链的长度,当DNA链匹配过了,其used属性为true,否则为true,每次匹配之前,先要判断两条链的长度是否相同,并且判断两条链是否已经使用过,如果两条链的长度相同,并且都没有使用过,则进一步判断两条链对应的位置上的字母是否俩俩相匹配,如果全部匹配,则说明这两条链是匹配的DNA链,则count的值+1,并且将匹配过的DNA链的used值设为true。

四、代码:

#include<iostream>
#include<string>
#include<algorithm>
using namespace std;

bool cmp(string a,string b){
 return a.size()>b.size();
}
bool match(string a,string b){ 
  for(int i=0;i<a.size();i++)
  {
   if(a[i]=='A'&&b[i]!='T')
    return false;
   if(a[i]=='T'&&b[i]!='A')
    return false;
   if(a[i]=='C'&&b[i]!='G')
    return false;
   if(a[i]=='G'&&b[i]!='C')
    return false;    
  }
 
 return true;
}

int main(){
 int n;
 cin>>n;
 int count;
 int n1=0;
 while(n--){
  int num; 
  cin>>num;
  string str[num];
  bool use[num];
  int len[num];
  //输入DNA链
  for(int i=0;i<num;i++)
  {
   cin>>str[i];
  }
  //对输入的DNA链进行排序,有利于减枝
  sort(str,str+num,cmp);
  //对每条string保存它的长度以及它的访问情况
  for(int i=0;i<num;i++){
   len[i]=str[i].length();
   use[i]=false;
  }
  //获取DNA配对数
  count=0;
  for(int i=0;i<num;i++)
  {   
   if(!use[i])
   {
    for(int j=i+1;j<num;j++){
     if(!use[j])
     {
      if(match(str[i],str[j])&&len[i]==len[j]){
       count++;
       use[i]=true;
       use[j]=true;
       break;
      }        
     }  
    }
   }
   
  }
  cout<<count<<'\n';
   
 }
 return 0;
}

版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

sicily--1035. DNA matching

水题用一个map 容器储存系统所给的“核苷酸链”,以及其出现的次数; 遍历map 容器, 要配对成功,则必须在系统给出的“核苷酸链”即我们的map 中有存在, 而可以组成最多的链数就要看这互补的两条链...

sicily 1035. DNA matching

1035. DNA matching Constraints Time Limit: 1 secs, Memory Limit: 32 MB Description DNA (Deoxyribon...

Sicily 1035 DNA matching

1035. DNA matching Sample Input 1035 DNA matching" TITLE="Sicily 1035 DNA matching" /> Copy sa.....

[sicily]1035. DNA matching

1035. DNA matching Constraints Time Limit: 1 secs, Memory Limit: 32 MB Description DNA (Deoxyribonu...

Sicily 1035. DNA matching题解

题目: 1035. DNA matching Constraints Time Limit: 1 secs, Memory Limit: 32 MB Description DNA ...

算法学习【9】—— 1035. DNA matching

题目:http://soj.me/1035 1035. DNA matching Description DNA (Deoxyribonucleic acid) is found...

SOJ 1035 DNA matching

#include #include unsigned int BKDRHash(char *str) { unsigned int seed = 131; unsigned i...

Sicily DNA matching

Sicily DNA matching Description: DNA (Deoxyribonucleic acid) is founded in every living ...

sicily DNA matching

题目要求为找到DNA匹配的个数。开始打算将DNA放到栈中,依次匹配并删除栈顶元素,后来在写的过程中发现无法删除栈内的匹配元素。在网上找了下相关答案,感觉用set容器的效果很好,可以对元素排序且删去重复...

DNA matching匹配问题

Description DNA (Deoxyribonucleic acid) is founded in every living creature as the storage medium...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)