【正文】 hird turtle is lying!Now in this problem you have n turtles crawling along a road. Some of them are crawling in a group, so that they do not see members of their group neither ahead nor behind them. Each turtle makes a statement of the form: “There are ai turtles crawling ahead of me and bi turtles crawling behind me.” Your task is to find the minimal number of turtles that must be lying. Let us formalize this task. Turtle i has xi coordinate. Some turtles may have the same coordinate. Turtle i tells the truth if and only if ai is the number of turtles such that xj xi and bi is the number of turtles such that xj xi. Otherwise, turtle i is lying.InputThe input contains several test cases. The first line of each case consists of a integer number n ( 1≤n≤1000). It is followed by n lines containing numbers ai and bi ( 0≤ai, bi≤1000) that describe statements of each turtle for i from 1 to n.OutputFor each input case, print one output line containing an integer number m the minimal number of turtles that must be lying, followed by m integers turtles that are lying. Turtles can be printed in any order. If there are different sets of m lying turtles, then print any of them.Sample Input32 00 22 250 20 32 11 24 0Sample Output1 32 1 4 ()USACO 2005 dec silverCleaning Shifts [Coaches, 2004]Farmer John39。s cows, pampered since birth, have reached new heights of fastidiousness. They now require their barn to be immaculate. Farmer John, the most obliging of farmers, has no choice but hire some of the cows to clean the barn.Farmer John has N (1 = N = 10,000) cows who are willing to do some cleaning. Because dust falls continuously, the cows require that the farm be continuously cleaned during the workday, which runs from second number M to second number E during the day (0 = M = E = 86,399). Note that the total number of seconds during which cleaning is to take place is EM+1. During any given second M..E, at least one cow must be cleaning.Each cow has submitted a job application indicating her willingness to work during a certain interval T1..T2 (where M = T1 = T2 = E) for a certain salary of S (where 0 = S = 500,000). Note that a cow who indicated the interval 10..20 would work for 11 seconds, not 10. Farmer John must either accept or reject each individual application。 he may NOT ask a cow to work only a fraction of the time it indicated and receive a corresponding fraction of the salary.Find a schedule in which every second of the workday is covered by at least one cow and which minimizes the total salary that goes to the cows.TIME LIMIT: secondsPROBLEM NAME: cleanINPUT FORMAT:Line 1: Three spaceseparated integers: N, M, and E.Lines 2..N+1: Line i+1 describes cow i39。s schedule with three spaceseparated integers: T1, T2, and S.SAMPLE INPUT (file ):3 0 40 2 33 4 20 0 1INPUT DETAILS:FJ has three cows, and the barn needs to be cleaned from second 0 to second 4. The first cow is willing to work during seconds 0, 1, and 2 for a total salary of 3, etc.OUTPUT FORMAT:Line 1: a single integer that is either the minimum total salary to get the barn cleaned or else 1 if it is impossible to clean the barn.SAMPLE OUTPUT (file ):5OUTPUT DETAILS:Farmer John can hire the first two cows.()CEOI 2004 tripsTripsDescriptionIn the forthing holiday season, a lot of people would like to go for an unforgettable travel. To mostly enjoy their journey, everyone wants to go with a group of friends. A travel agency offers several trips. A travel agency offers group trips, but for each trip, the size of the group is limited: the minimum and maximum number of persons are given. Every group can choose only one trip. Moreover, each trip can be chosen by only one group. The travel agency has asked you for help. They would like to organize as many trips as possible. Your task is to match groups of people and trips in such a way, that the maximum number of trips can be organized.TaskWrite a program TRIPS, that:reads the description of the groups and the trips from the standard input matches the groups and trips in such a way, that the maximum number of arranged trips is reached writes the result to standard output. If there are several possible solutions, your program should output anyone of them.CharacteristicsAvailable memory: 64MbMaximum running time: 3sInput fileThe first line of input file contains two integers: n and m separated by single space, 1=n=400000, 1=m=400000。 n is the number of groups and m is the number of trips. The groups are numbered from 1 to n, and the trips are numbered from 1 to m.The following n lines contain group sizes, one per line. Line i+1 contains integer si the size of the ith group, 1=s=109. The following m lines contain trip descriptions, one trip per line. Line n+j+1 contains two integers: lj and uj, separated by single space. lj is the minimum, and uj is the maximum size of a group for which the trip can be arranged (1=lj=uj=109)Output fileThe first line of output file should contain one integer k=0 the maximum number of trips that can be arranged. The following k lines should contain the description of the matching. Each of these lines should contain a pair of integers separated by single space: the number of a group and the number of a trip. There can be many answers and your program may print anyone of them.Example5 4546942156 620 502 87 2032 13 44 2()CEOI 2000 Enlightened LandscapeEnlightened landscapeConsider a landscape posed of connected line segments:Above the landscape, N light bulbs are hang at the same height T in various horizontal positions. The purpose of these light bulbs is to light up the entire landscape. A landscape point is considered lit if it can see a light bulb directly, that is, if the line segment which links the point with a bulb does not contain any other landscape segments p