QOJ.ac

QOJ

Time Limit: 2 s Memory Limit: 256 MB Total points: 100

#22440. Sequenciamento de DNA

Statistics

Farmer John estuda a genealogia do rebanho: $M$ touros ($1 \le M \le 20$), $F$ vacas ($1 \le F \le 20$), mas ignora os possíveis descendentes.

Conhece a sequência DNA única $DNA_{i}$ de cada um. $DNA_{i}$ tem comprimento $25$, só maiúsculas A, $C$, G, T. Busca filhos possíveis de cada casal touro/vaca.

Para cada casal imprima quantos outros bovinos podem ser filhos se:

  1. não são nenhum dos pais: vaca não é sua mãe nem touro seu pai;

  2. cada posição DNA coincide com ao menos um dos pais na mesma posição.

abc pode vir de (axx, xbc), não de (aaa, bbb).

Considere sequências de $3$ touros e $2$ vacas:

       Bull 1: GTTTTTTTTTTTTTTTTTTTTTTTT
       Bull 2: AATTTTTTTTTTTTTTTTTTTTTTT
       Bull 3: GATTTTTTTTTTTTTTTTTTTTTTT
       Cow 1:  TTTTTTTTTTTTTTTTTTTTTTTTT
       Cow 2:  ATTTTTTTTTTTTTTTTTTTTTTTT

Touro $2$ e vaca $1$ podem ser pais da vaca $2$:

       Bull 2: AATTTTTTTTTTTTTTTTTTTTTTT
       Cow 1:  TTTTTTTTTTTTTTTTTTTTTTTTT
       Cow 2:  ATTTTTTTTTTTTTTTTTTTTTTTT

Seu primeiro A pode vir do touro $2$, segundo T da vaca $1$, restante de qualquer um.

Crie a matriz de contagens de filhos possíveis para cada casal.

Entrada

  • Linha $1$: inteiros $M$ e $F$ separados por espaços.

  • Linhas $2..M+1$: a linha $i+1$ dá a sequência $DNA_{i}$ do touro $i$.

  • Linhas $M+2..M+F+1$: a linha $j+M+1$ dá a sequência $DNA_{j}$ da vaca $j$.

Saída

  • Linhas $1..M$: linha $i$, $F$ inteiros separados; o $j$-ésimo conta filhos possíveis do touro $i$ e vaca $j$.

Exemplos

Entrada 1

2 3
TGAAAAAAAAAAAAAAAAAAAAAAA
AGAAAAAAAAAAAAAAAAAAAAAAA
ATAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAA
TTAAAAAAAAAAAAAAAAAAAAAAA

Saída 1

2 1 0
0 0 2

Note

DNA de $2$ touros seguido pelo de $3$ vacas.

Considere touro $1$ e vaca $1$:

    b1: TGAAAAAAAAAAAAAAAAAAAAAAA
    c1: ATAAAAAAAAAAAAAAAAAAAAAAA

A parte importante é {T|A} seguida de {G|T}.

Testes de correspondência para touro $0$ e vaca $0$:

    b1: TGAAAAAAAAAAAAAAAAAAAAAAA -- parent, can't be offspring
    b2: AGAAAAAAAAAAAAAAAAAAAAAAA offspring! Matches [TA][GT]
    c1: ATAAAAAAAAAAAAAAAAAAAAAAA -- parent, can't be offspring
    c2: AAAAAAAAAAAAAAAAAAAAAAAAA -- second character is 'A'; must be G or T
    c3: TTAAAAAAAAAAAAAAAAAAAAAAA offspring! Matches [TA][GT]

Bull / Cow; parent, can't be offspring; offspring! Matches; second character is A; must be G or T: touro; vaca; pai, não pode ser descendente; descendente! Corresponde; segundo caractere A, deve ser G ou T

O primeiro elemento é $2$; os demais são semelhantes.

Autor do problema: Jacob Steinhardt, 2010

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0
No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.