CRSCNTRY - Cross-country

Agness, a student of computer science, is very keen on cross­country running, and she participates in races organised every Saturday in a big park. Each of the participants obtains a route card, which specifies a sequence of checkpoints, which they need to visit in the given order. Agness is a very atractive girl, and a number of male runners have asked her for a date. She would like to choose one of them during the race. Thus she invited all her admirers to the park on Saturday and let the race decide. The winner would be the one, who scores the maximum number of points. Agnes came up with the following rules:

  • a runner scores one point if he meets Agnes at the checkpoint,
  • if a runner scored a point at the checkpoint, then he cannot get another point unless he and Agnes move to the next checkpoints specified in their cards.
  • route specified by the card may cross the same checkpoint more than once,
  • each competitor must strictly follow race instructions written on his card.

Between two consecutive meetings, the girl and the competitors may visit any number of checkpoints. The boys will be really doing their best, so you may assume, that each of them will be able to visit any number of checkpoints whilst Agnes runs between two consecutive ones on her route.


Write a program which for each data set from a sequence of several data sets:

  • reads in the contents of Agnes' race card and contents of race cards presented to Tom,
  • computes the greatest number of times Tom is able to meet Agnes during the race,
  • writes it to output.


There is one integer d in the first line of the input file, 1 <= d <= 10. This is the number of data sets. The data sets follow. Each data set consists of a number of lines, with the first one specifying the route in Agnes' race card. Consecutive lines contain routes on cards presented to Tom. At least one route is presented to Tom. The route is given as a sequence of integers from interval [1, 1000] separated by single spaces. Number 0 stands for the end of the route, though when it is placed at the beginning of the line it means the end of data set. There are at least two and at most 2000 checkpoints in a race card.


The i-th line of the output file should contain one integer. That integer should equal the greatest number of times Tom is able to meet with Agnes for race cards given in the i-th data set.


Sample input:
1 2 3 4 5 6 7 8 9 0
1 3 8 2 0
2 5 7 8 9 0
1 1 1 1 1 1 2 3 0
1 3 1 3 5 7 8 9 3 4 0
1 2 35 0
1 3 5 7 0
3 7 5 1 0
1 2 1 1 0
1 1 1 0

Sample output:

hide comments
avik26091998: 2018-08-06 17:36:27

Just LCS!!

anikdutta10: 2018-07-03 10:56:49

Easy LCS. AC in second go!!!

tanmayak99: 2018-06-03 15:44:36

Simple LCS problem

viratian_070: 2017-06-27 06:19:28

used vector instead of in 0.00 sec

babur: 2017-06-12 06:57:09

Quite Easy...simple lcs

epsilonalpha: 2017-06-11 07:18:12

AC in one go. Good for practice. :)

da_201501181: 2017-05-18 18:49:49

New Algo..!! LCS ..Must for beginners in DP..!!
AC in one GO...!!!

Last edit: 2017-05-18 18:50:11
scube6897: 2017-05-03 10:13:12

Ac in first go!Easy game.

youssefifk: 2017-04-16 11:40:33

easy problem

Last edit: 2017-04-16 11:40:49
rohit9934: 2017-04-03 12:20:26

Quite amazed to see recursive approach giving TLE(time limit 5 sec) to same problem which again i solved by Iterative approach in 0.00 seconds. Anyway nice problem to start DP.Learn Longest Common Subsequence first.

Last edit: 2017-04-03 13:34:48

Added by:adrian
Time limit:5s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Resource:III Polish Collegiate Team Programming Contest (AMPPZ), 1998