DAY 0:
In order to sleep more in the morning, I booked a hotel next to the school. The result seems to be a bit uncomfortable. I only fell asleep at 9:30 and 1:30. In addition to tossing and turning, I also experienced the poor sound insulation of the hotel next to the school. , just like in my own room, after listening to the movie next door, it seems to be very emotional... The sound insulation is so poor, there is no towel, how did you charge my 325 room fee =_=
DAY1:
Wake up in the morning by the alarm next door...
T1: Hey, this question seems to be equivalent to drawing a dividing line in the middle each time, so only two adjacent dividing lines can determine a point, then we just need to find how many positions have a dividing line on the left and right. Find the dividing line and sort it, and finally AC.
T2: It looks complicated and the code is hard to write... skip ahead.
T3: Well, when this question is added from top to bottom, we know the weight of each point, save it, and ask the lcp of two strings each time, I wrote it on my blog! The dictionary tree can be checked by lca. The following is the kth largest weight of the two points to their lca path, it must be the chairman tree, we build a chairman tree for the dictionary tree, and use its father as a template when building each point, When we query, it is similar to the method of difference on the tree. If we call the two strings of the query x, y, for each position, look at the chairman tree where x is located + the chairman tree where y is located - 2*lca where the chairman is The tree can be satisfied or not, although there is no problem with shooting, I don't know where the last 70 points were lost...
Then I went to the toilet and washed a bit to calm down. I suddenly touched the White Rabbit toffee given to me by the young lady in the math contest last week. Candy advertises), and then I feel that if I first add an edge with an edge weight of 0, and then add an edge with an edge weight of 1, this will ensure that the first one will not be updated when the bfs goes in, because the 0 edge can no longer be updated. It is impossible to reach the point where the 0 side is extended. It has already been added in the front, so if we are like bfs, it feels very superior. We code 300 lines, and then the sample runs for more than ten seconds, and then adds a little more. Optimization, but still gg, and the last 20 points is very touching. The correct solution is to hash out the state of the row * where the car No. 0 is located, and treat it as one, which can reduce a lot of states.
DAY2：
Continue to fall asleep..
T1: The game of edge deletion on the tree. For each interval, its father is the nearest left interval that can cover it. This is a bracket matching model, and it will be finished in 10 minutes. (Five minutes before the end, I found that multiple sets of data forgot to clear an array, but fortunately I found it)
T2: It seems to be a relatively simple shape pressure, and then I found that each position can be preprocessed first. The first position of this position can be matched when it is added for the first time, and then the dp state I set is For the top n of the big string, the match did not match, and it was not right to push and push, so I went to play T3.
T3: The first point, wow, I ask for the first five items of conscience in 1234567. The second point is for the first fifteen items in 1234567891929394959, which is still conscience. The fourth point is 123456789192939, um, it feels like the formula can be derived, (forgot to guess the sum of the zrx on-the-spot summation of the proportional series), the seventh point is 11111111, find the sum of the first 1e14 items %1000000123, so conscientious Well, I output 1e14%1000000123 without moving my mind. The latter points are similar. After the test, I found gg. Teacher He of Gaoxin No. 1 Middle School told us that the rule is that the sum of the digits of the first item is 1, and the i-th item is the sum of the digits. And those numbers that add up to i, this question is too clever, and finally the first two points are divided... The thinking ability is still touching.
When I came back to push T2, it was probably because there was a problem with the formula, and it was not released for an hour. I didn't sleep well at that time, and I was also a little dizzy. Suddenly my mind exploded, and I didn't think about changing the dp formula. There is only one hour left in the exam to play violent dfs. The complexity seems to be related to the answer. It is about 15*ans. There are just 40 points and the answer is less than or equal to 100000. The blast search is still very good, and it is over. The mental explosion couldn't be pushed, and 40 points rolled thick.
Waiting for the grades at the door after the exam is the most terrifying. I secretly heard that someone t1 understood differently from me, and spoke plausibly about its practice. Many people also said the same, the feeling of feeling gg is terrible, evaluation After playing the discussion, I found out that I understand the question correctly. It's just a matter of converting the model... Three people went in to see the results, I felt gg's self, looked at my name upside down, no, and then suddenly found myself in the fifth place, although not I'm very satisfied, the exam room is messed up, but it still seems to be in. There are two questions from the University of Technology who did not add cstring and lost 200% and got stuck by 1/3... In the end, because the evaluation forgot to ignore the space at the end of the line, I started to re-evaluate Now, another thrilling evaluation, my ranking has not changed, but one of my school's second graders came up and pushed Jiamu out of the provincial team...
So in the end, there were two immortals rk1, rk2, ranwen rk3 from Western Polytechnic University, and then another immortal from the University of Technology... But the results of TYZ were also okay. The second grade, the second grade, the third grade, and the second grade entered a provincial team, and the children in the second grade haven't Suspension of classes, taking the top five exams every time, and engaging in math competitions, so I just learned to learn and entered the provincial team, which is amazing. jiamu lost 40 points because the array space was too small, and was squeezed out. It seems to have given up. It's a pity... In the future, no one will eat and sleep with me in the computer room at noon. It seems that kh is going to buy class D. Determined not to be sluggish, and now I am installing noilinux. The big stone that has been pressing on my heart has finally ended, but just as the head teacher of the junior high school said, the end of one thing means the beginning of the next thing, the APIO below, the pkusc I hope to pass, and the final noi are also opened. Prelude, and I am still so weak, the provincial selection question has fully exposed my own problems. I joined the team by luck, and I hope I can work harder.
ZRX IS STILL HERE！