2015 Asia Regional Competition Changchun Division network qualifiers

First play online game, the first game, overall is OK, but our team three people are not very good, mainly WA's more bar, the opening to see the last question is my habit, although it seems that the problem to hit half may have the team to do it, I saw the feeling like the previous days of training game to do a problem. The opening of the engraved disc to see 06, kai God opening 01. Then two minutes seniors found 07 water problem I followed the hair test instructions, to find the interval maximum, static, and then the data range is also very small, directly open the violence, four minutes of time, about 20 or so, that is our highest ranked 2333 ... Then I'm going to continue to study the next 13, the engraved disk tells me 06 is about the loop of the substring of the problem, may be the suffix array, let me think, Kai God basically on the 01, I would like to first knock down the suffix array of things, Xiaoxin told me 05 is a few days ago we trained to do, I can get down, And then I started my miserable journey ... Of course, that period of time is the best performance of our team, the senior team has quickly over three questions, and our team WA is very serious, 01 I do not know what the problem, Kaishin do very worried, WA and tle have, a lot of hair, carved in open 10, seems to be a number theory, and I in Tangled 05. I was changed really is physically and mentally exhausted, WA five, this time probably carved a plate of 8, Kai God 01 also seven or eight hair, an hour 20 minutes, seniors about five questions look like. And then 8 rounds, and then two minutes later, I changed it. Discover and check the initialization of 0~n-1 ... And then changed the ≤n on the ... Too sad to talk about, about 1.5 hours Kaishin also a 01, the team in WA penalty when the miserable cause we basically have the same number of the last one. Then we open the question separately, the engraved disk first opened the then people a little bit less 08, the remainder of the most than 02 left to the weaker I open, Kaishin turned to study more like a regular problem 03. Then I am not very clear in the case of WA 3 hair 02, highlighting a stupid, sincere state, later only to know that a single point is not connected block, more than two hours finally, and then after a period of time also put on the plate a dropped, this time 6 questions, the senior team is 6, but we are obviously worse than their punishment. Seniors have started to open 06, I also began to think about this problem, carved plate ready to do more difficult 12. Because it is the largest string dictionary, I think of the suffix array processing sa. And then decisively on the suffix array template, pros and cons of a round suffix array, and then the basic understanding of the practice, I am ready to find the first appearance of the dictionary sequence of the smallest long n string, with the seniors said, seniors also recognized my idea, but my practice is to prepare KMP match, seniors prepare string hash. And then I just keep trying, close to four hours ofTime finally in because rank and C + + internal name 1 CE after a dropped, 7 penalty when the last, seniors team in 6 penalty when the first, and then after a period of time they have too. About the last time, Kaishin is still looking for 03 of the solution, the engraved disc continues to open 12, I am ready to do 09. After the Kai God introduced the formula but the specific solution is still very tangled, and seniors exchanged a little thought after a period of time they will succeed AC. As for my tangled up 09 is the backpack or the flow of the end of the game. At last our team 160+.

Well, the first time to play such a particularly important online game is still very worried, although the smooth to get the spot, but it is clear that in the field more than the time, we can easily split up, especially today, WA will be very tangled, disorderly, may be a formal game this situation will be better. Then I am very poor in personal status, the whole team is not good. Today, my handling of the details is still very unsatisfactory, the details of the error resulted in more than WA, but overall it is the past, we all in AC, in addition to because the topic can be made more powerful so more time each A, the network race is relatively less joint a problem, but still mutual believe that the engraved disk will often stay water problems to my ang.

My personal words, more in the details of the treatment is very problematic, may be small errors or test instructions understanding of the less attention. Today is mainly a check-in water question 07, and then 02, 52 chart Theory, 61 strings, I am almost ready to play in the area before the main figure theory and string problems, for me to do the structure of the problem is very clear in these two aspects.

1001 Enkai God, I don't know what the problem is.

1002 The total weight of the odd number of non-direction graph to determine the ring, with a topological sort to identify the circle, mainly for the original map of the topological sequence, the point of 0 points into the queue to 1 points into the queue, the queue is marked, the topological sequence of the queue after the completion of each node has not been visited DFS The number of points to be reached and the weights, in the same connected block is the point on the circle of the original image, and then judge the points of parity. Only if there is a self-loop, a single point will also be treated as a connected circle, so the number of points to be determined after DFS is 1 is not added

1003 Kai God's conclusion, the specific situation is not very understanding

1004 Anti-AK, no team over the problem

1005 for an empty graph, travel inside, the cost of a two point is the minimum value of the maximum weight of all the paths between the two points, that is, the value of a path is the maximum weight of all the edges on this path, and the cost between two points is the minimum value of all paths. Then there are multiple queries asking how many points to meet the cost less than or equal to a certain value. In fact, and the minimum spanning tree, the first to the edge and the problem, each time to take the minimum edge, connect two and check set, the two and check set if not connected, then the two and check the points in the set of each other to reach the cost is the weight of this side, because the edge is from small to large, Then, in the process of updating and checking the set, by the way the ordered query assignment, the final output of all queries on the line. But I also wrote the initialization of the set < N,wa five methods ...

1006 to a string, the end is connected, you can start from any character clockwise or counterclockwise n characters, there are 2n strings, ask these strings in the dictionary of the largest one, if there are more than the same, priority starting position forward, the initial position is the same, the finite clockwise. My practice is to first copy a twice-fold long sequence string and a twice-fold inverse string, respectively, to do the suffix array to get the SA array (where the first few small string start position) and then only the valid first n string, take a dictionary of the largest string, in a twice-times long string to remove the string, and then the original string KMP Find the first occurrence of the string, and then compare the requirements, and finally get the results. Seniors in the back of the process with a string hash to find the first occurrence of the string. Is it said that others use minimal notation? Or what magical thing to do, I'm too low not to, only suffix array +kmp

1007 The most water problem, 1000 numbers, 1000 inquiries, ask the interval maximum, rmq do not have direct violence to find ...

1008 ticks, it is said to be the analog binary search tree interpolation value of what. Not too clear, the engraving said he was using splay operation, carved plate is a small expert tree, and sure enough to make him planted trees is not wrong!

1009 There are n kinds of donuts, m kinds of trucks, need Q energy, each kind of donut has the energy, occupy the volume, can carry the number, each kind of truck has to provide the volume, the cost, can be rented number, I initially think is two multiple backpack DP, and feel the multi-backpack space to explode, may be a stream, And then finally do not come out, I heard that is to do the backpack and maintenance of the monotonous queue, temporarily has not mended

1010 seems to be number theory, about the CRT, the carved plate made

1011 I did not read the question ...

1012 ticks I didn't look at it ...

10,131 people want to walk randomly in a diagram, but he has a sequence to go, and then ask the mathematical expectation of the number of steps to follow the sequence, beginning to feel like a previous training game, and then few people I did not study ...

2015 Asia Regional Competition Changchun Division network qualifiers