Description: Description of laquo:
Suppose you want to arrange a batch of events in enough venues and want to use as few venues as possible. Design an effective one
The greedy algorithm is arranged. The problem is actually a famous coloring problem. If you take each activity as one of the graphs
Vertex, incompatible activities are connected by edges. To minimize the number of colors of the adjacent vertices with different colors
The number of venues.
« programming tasks:
For a given k's scheduled activity, the programming calculation USES the minimum time schedule for the meeting.
« data input:
Input data is given by input.txt. The first row has 1 positive integer k, which represents the activity of k. Pick up
In the k line, each row has two positive integers, representing the start time and end time of the activity of k. time
It starts at 0.
« result output:
Outputs the minimum number of sessions that are programmed into the file output.txt.
File list (Check if you may need any files):
Download