2016 Zhejiang province roller coaster record

A day after the provincial race is really exciting, you can experience the thrill of continuous rolling .

Heard today is the birthday of the bird God, so the early morning made a big news, forced to the bird God poured a big mouth poison milk.

The warm-up writing simulation written to the end has not been transferred out, to the afternoon roll rough laid a solid foundation.

The race, open the topic, habitually first from the last question to see, so I found that the L problem is a check-in question, spend 1 minutes to knock finish, intend to rob FB.

is planning to hand in the time, the network card, brush for two or three minutes to refresh out, and then the L problem has been a piece.

Then the South God said I can do, so change him, but the first to submit WA, seems to be stuck test instructions.

I immediately changed to write a question, followed by the South God began enumerating I test instructions, fortunately the first time the enumeration was over.

Then the South God found that D is also a check-in question, but it takes some time to write, but there is no other written questions, so he began to knock D.

Adhering to the "come first to make $100000$" concept, I and bird God together to see the E, H, K this 3 data range is $100000$, E thought for a while, will only $n\leq1000$ practice, feel hopeless.

Then look at H, which allows you to maintain a sequence, a support interval plus a arithmetic progression with a positive tolerance, and then output the number of positions that are higher than the two sides after each operation.

in the face of this data structure problem, there must be pontificate. arithmetic progression doesn't seem to be doing so well, so I'm going to make the sequence differential, change the interval plus, and then query the number of positive and negative pairs.

"line tree do it!" " I was going to kick the South God down to write this problem, suddenly found that there seems to be a loophole, after marking the mark there is no way to maintain the new information." But notice that the tolerance is constant, and if and only when negative numbers become positive, it is possible to affect the answer, and each negative number will only become a positive once, so the maintenance interval the largest negative, and then the violence is good, averaging $o (n\log N) $.

Feeling this type of segment tree is not a special classic, I then made a flag: "This question is certainly not a few teams, we hurriedly spend 10 minutes off the crooked list!" ”。

Then the bird God Read K, found that the first question is the shortest, and the second is the shortest path to the shortest tree figure. "Finished, not $o (n\log N) $ for the smallest tree. "However, when the shortest-circuit diagram has no ring, the smallest tree-plot only needs to be greedy for the least cost of entering the edge."

Then the South God Lost D, and then the bird God ready to rob K's FB. As a result, he couldn't get through the example, I saw the program found him lazy to write in the shortest way,mdzz. When this problem is over, the FB is gone.

This is to see the list, C has a piece, is a big simulation, so the South God went up and followed off.

Then I hurried up to write H, write + tune for 20 minutes, feel very scientific, a look found this problem more than 20 submissions did not have an AC,"This SB problem I can WA?" "and then I had a hand, incredibly really fascinated by WA."

Then XJB changed a few possible errors, or WA, feeling very unscientific, carefully read through the entire program, or found no errors. Call the teammates to see together, word analysis, still did not find errors. So we decided to write the right shot.

Then the bird God stood up: "G is KMP then count, on one SB problem, I write." "Start writing g with confidence. Wrote for half an hour to find the sample to pass, and then found that there are many loopholes in the idea, tinkering for half an hour, still can't handle correctly.

During this period, I and the South God thought for a long time e, still do not do, and then read the B found is a tree slope optimization, tree division of the treatment is always able to do, but to write for a long period, but there is a risk can not be adjusted out. At this time to see the list, EF has been people, H has more than 40 submitted, still no one AC.

Bird God ready to put G down again, so the South God wrote the H problem of violence and data generator, began to shoot, took 10 minutes to shoot a group of error data. I removed the marker and the data was right, but I couldn't figure out what the reason was. To this set of data xjb for half an hour, finally think of a pit point: 0 becomes a positive effect will also affect the answer, so a few places added an equal sign, a turn, sure enough AC. Crooked list success.

At this time has 7 questions, but the penalty explosion, the highest team is also 7, F over a piece, E over two, b no one ever. The bird God came up with the method of F, finishing the details of G, "G is simpler than F, sure to be able to",flag, so continue to engage in G. 20 minutes to find out or something is wrong, and the code is fast 300 lines, it may be too low.

At this time there are 40 minutes left, to win the words need to have another question. I let the bird God to write F, the bird God was dizzy by G, the fork off their own F, so the hands only B can be engaged.

I opened the "Miscellaneous questions select", found that there is just NOI2014 purchase ticket code , so seize the hand speed, spend 30 minutes copy knocked out B, and over the example, a turn, WA. I quickly check whether the template is wrong, found that the tree divided into the treatment of the other sub-tree, change the end or WA.

Suddenly feel life lost hope, at this time from the end of the game only 7 minutes left. We 3 people together against the code of B, I checked the discovery of the tree division and convex hull are not written wrong, the bird God suddenly found that read into the side of the addition of a one-way edge, "This TM can also be a sample?" , after the change, the network happened at this time card,.

After brushing the submission page, it was already 4:57, which meant that it was our last chance, and I ordered it, and the bird God turned around: "I dare not look." "I also felt hopeless, but OJ returned to me with a red-red Accepted.

"Too!" said the man. "The three of us invariably put a aoe roar, 297 minutes of the lore of B."

The list has been sealed, but the AC number can still be seen, B and H only we have, f over a piece, we think 8 is not the problem.

Out of the examination room, we all ran over to say: "Film champion Ye." "Feeling very unscientific, obviously when the penalty exploded, the result is only two 8 teams, another team penalty when more explosion, so inexplicable on the championship, this roller coaster ride really cool."

Think about it, this game, that is, cut two data structure problems, the order of the problem is too strange, in the Icpccamp is also the same, every day by the only our team of data structure problem Force bully ranking. Everyday data structure write, life still have hope?

Finally celebrate the birthday of Win ~

Feel how crooked the list is:

2016 Zhejiang province roller coaster record