F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

DNA Sequence

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others)
Total Submission(s): 186    Accepted Submission(s): 17


Problem Description
Deoxyribonucleic acid (DNA) is a nucleic acid that contains the genetic instructions used in the development and functioning of all known living organisms and some viruses. The main role of DNA molecules is the long-term storage of information. DNA is often compared to a set of blueprints or a recipe, or a code, since it contains the instructions needed to construct other components of cells, such as proteins and RNA molecules. The DNA segments that carry this genetic information are called genes, but other DNA sequences have structural purposes, or are involved in regulating the use of this genetic information.

DNA structure can be described as DNA sequence, which can only be those consist of following four nucleotides named Adenine, Guanine, Cytosine and Thymine (We can address them A, G, C, T for simplicity). Property varies while the combination of nucleotide changes, thus even a tiny change in the chain of DNA sequence may lead to completely different appearance.

Prof. Adam C. Murphy is now working on a kind of DNA sequence that has more restrictions than ordinary ones. If a sequence¡¯s substring matches any one of set {¡®AA¡¯, ¡®CC¡¯, ¡®GG¡¯, ¡®TT¡¯,¡®AC¡¯, ¡®CA¡¯, ¡®CG¡¯, ¡®GC¡¯, ¡®GT¡¯, ¡®TG¡¯}, the sequence is considered illegal.

Besides, an extra restriction comes: diving all the position of the sequence in groups as the sets indicate, every nucleotide must be unique in its set. For example, for given set {{1, 5, 11}, {2, 4}}, the nucleotide in position 1, 5 and 11 must be different for each pair. So is position 2 and 4.

Professor Adam C. Murphy wonders, with so many kinds of restrictions, whether a legal DNA sequence exists.
 

Input
There are several cases in the input.

For each case:

* The first line: two integers, N (1=<N<=100000) and M (1<=M<=1000). N represents the length of a DNA sequence; M represents the number of restrictions of the second kind.

* Line 2 to line M+1: each line contains one restriction. An integer ki (ki<=100), followed by ki integers a1,a2¡­aki,(1<=aki<=N) describing a set we mentioned above.



The position of nucleotides is numbered from 1, and all the numbers are separated by a space.
 

Output
If such a required sequence exists, print ¡®Yes¡¯, otherwise print ¡®No¡¯.
 

Sample Input
7 2 3 1 2 4 4 2 4 5 7
 

Sample Output
Yes
 

Hint

Hint

ATAGATC is a legal DNA sequence for the sample.
 

Source
 

Statistic | Submit | Discuss | Note
Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-04-27 06:30:18, Gzip enabled