Feedback | | If you notice incorrect translations in Contester, please let author know.
|
|
Time limit 2000/4000/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb.
Question by Ibrahim Mesecan.
Distance
In bioinformatics, sequence alignment is a way of
arranging the sequences of DNA, RNA, or protein to
identify regions of similarity. For easy processing,
you have numbered all proteins. If two proteins are in
the same positions, the distance is 0. Otherwise,
the difference in the positions is the distance of these
two proteins.
Question:
You are given two sequences and you want to compare
and find out how similar these two sequences are.
Write a program that is going to read two DNA sequence
information. Then, your program will print the total
distance of all proteins. Note: if
a number is not in the other sequence, then their
distance is taken as the number of elements
in the sequence (n).
Input specification
You will be given an integer (n) the length of DNA
sequences where 0 ≤ n ≤ 2000.
Then, in the following two lines you will be given
two comma separated DNA sequences with the
length n (n integers where each of the numbers
is less than 1e6).
Output specification
Show the total distance of these sequences.
Sample Input I
6
1, 5, 3, 4, 7, 2,
6, 5, 2, 3, 7, 4,
|
Sample Output I
12
|
Explanation:
- 1 is not in the second list: distance is 6
- 5 and 7 are in the same positions: distance is 0
- 3 is in the third position in the first list and it's in position 4th in the second list: distance is 1
- For 4, distance is 2
- For 2, distance is 3
Thus, the total distance is 6 + 0 + 0 + 1 + 2 + 3 = 12.
Для отправки решений необходимо выполнить вход.
|