GALAXY OJ NOIP2019 2- universal Joint Test Group

Overview:

　　Today, more than a game, pretty water, but less than ideal.

topic:

　　Problem: Tao Tao grab apples

　　　　Went to the harvest season, the trees end up with a lot of Tao Tao, wrong, a lot of apples, there are many small Tao Tao came to pick apples. Each Tao Tao wants the greatest apple, so had an argument, in order to solve their conflicts, the question of man - a special rule, according to the size of the weight given order, each round is the first by fat first pick (to take care of fat), each of Tao Tao is very smart, do not miss the largest apple eyes. Now the question is, a total of apples n, m a Tao Tao, you want to order the original Tao Tao can grab the output of Apple's total size of each.

　　　　Resolution:

　　　　This question seems to be water, fight violence, no losers!

　　

　　Problem: Opening Dance

　　　　

In looking forward to people around the world, the 2008 Beijing Olympic Games finally held a grand!

To demonstrate the fine traditional culture of the Chinese nation profound, who is responsible for orchestrating the opening ceremony of the opening dance meticulous, and strive to perfect every detail. On the team problem is the use of "Tianyuan" array or "place" array, we discuss seven days and nights, still no results. So, they want to help the computer to calculate the cost of two kinds of formation.

The teams are arranged in a two-dimensional plane, and to be (0,0) such that the center point of symmetry on keeping the United States. "Day round" is a circular array, and "place" is a front side parallel to the axis of the square. Due to some factors, the formation claims cover some point (the edge can).

Your task is to calculate the formation of two kinds of minimum area capable of covering these points.

　　　　

　Resolution:

　　　　This question is also very water simulation on the line

 　　

　　　Problem: set up a telephone line

 　　

 Farmer John going to the telephone line to lead his farm, but his telecommunications company does not intend to provide free services. So, FJ need to pay a fee to the telecommunications company.

    FJ farm around the distribution N (1 <= N <= 1,000) root by 1..N numbered sequentially discarded telephone poles, telephone poles between any two telephone lines are not connected. Total P (1 <= P <= 10,000) can be pulled on between the telephone line of a telephone pole, those due to the remaining separated too far and can not be connected.

    I-two endpoints of a telephone pole are A_i, B_i, the distance between them is L_i (1 <= L_i <= 1,000,000). To ensure that the data appear at most each pair {A_i, B_i} 1 times. Telephone poles numbered 1 has access to a national telephone network, a telephone line are all whole farm is connected to the N number on telephone poles. In other words, FJ's task is to find a path only the No. 1 and No. N telephone poles connected together and the rest of the telephone poles is not necessarily connected to the telephone network.

    After negotiations, the telecommunications company finally agreed to free FJ link K (0 <= K <N) specified by FJ telephone pole pairs. In addition to those for the telephone line, the cost of pay FJ need thereof, wherein the length equal to the longest of the telephone line (telephone line connecting each of a single pair of telephone poles). If the total expenditure of telephone poles that require no more than K pair, FJ is zero.

    Please you do the math, FJ least how much money to spend on the telephone line.

　　　　This question should be a lot of people know

　Resolution:

　　Here we recommend two ways: binary and spfa

　　　　spfa thinking more like dp

　　　　Half the words: half the answer, if it is larger than the mid then be free to operate. . . . . .

　　　Problem: Fruit Shop

 　　　　

In a market, for there are a lot of open space and residential. Now, the city opened a new fruit shop, in order to say hello to urban residents, fruit shop decided to send two courier to send a box of fruit to every house. Due to the large weight of a box of fruit, so you can only deliveryman carrying a box of fruit.

    You can think of this city as a chessboard N rows M columns, each grid is either open space or residential, or a fruit shop. If the grid is a space, then use 0..9 to represent the height of the space; if it is residential, then use $ to represent, if a fruit shop, then use X to represent. Into another from a lattice grid, lattice if and only if two adjacent, i.e. share an edge.

    If two cells in a residential or fruit shop, it takes two minutes.

    If the grid are two open space, then press the height of discussion. If the height of the two open space of the same, the time it takes 1 minute; 1 if the difference in height between the two, it takes three minutes; if both the height is more than 1, then each can not enter.

    Now, the fruit shop owner wanted to know if the whole city of residence have received their fruits, how much time do the minimum required? If you never sent, please output -1.

　　　　The subject is so hard, will not

　Resolution:

　　　　Just thought it was a search

　　　　who knows

　　　　Really search

　　　　I really regret hit half to give up! ! ! ! !

 

 

　　　　　　　　　　　　　　　　　　　　　　　　End ~~~