﻿ Fuzhou University OnlineJudge ﻿
Problem 1864 Christmas Machine

## Problem Description

As Christmas come,members in Fzu ACM Lab all want to have a rest.But they must face a lots of pending jobs which haven’t been completed by their judging machines.They want to finish them as soon as possible.

As we all know, machine scheduling is a very classical problem in computer science and has been studied for a very long history. Scheduling problems differ widely in the nature of the constraints that must be satisfied and the type of schedule desired. Here we consider a 2-machine scheduling problem.

There are two judging machines A and B in the Lab. Machine A has n kinds of working modes, which is called mode_0, mode_1, …, mode_n-1, likewise machine B has m kinds of working modes, mode_0, mode_1, … , mode_m-1. At the beginning they are both work at mode_0.

For k jobs given, each of them can be processed in either one of the two machines in particular mode. For example, job 0 can either be processed in machine A at mode_3 or in machine B at mode_4, job 1 can either be processed in machine A at mode_2 or in machine B at mode_4, and so on. Thus, for job i, the constraint can be represent as a triple (i, x, y), which means it can be processed either in machine A at mode_x, or in machine B at mode_y.

Note that the jobs must be processed in order and the job with lower index comes first.

Obviously, to accomplish all the jobs, we need to change the machine's working mode from time to time, but unfortunately, the machine's working mode can only be changed by restarting it manually. By assigning each job to a suitable machine,they want to minimize the times of restarting machines.

## Input

The first line contains an integer T representing the number of configuration. Then following T configurations.

The first line of one configuration contains three positive integers: n, m (0 < n, m < 50) and k (k < 500). The following k lines give the constrains of the k jobs, the ith line contains two integers x,y,thus (i,x,y) reperesents a triple as described above.

There may be several blank lines between each input cases.

## Output

The output should be one integer per line, which means the minimal times of restarting machine.

## Sample Input

1 2 2 3 0 1 1 0 1 1

1

## Source

FOJ有奖月赛-2009年12月

Submit  Back  Status  Discuss
﻿