Day0
12:45p.m.
Before leaving the junior high school, I went back to class to visit my classmates and received a warm welcome(?)
13:15p.m.
On the way to Zhongshan, I originally wanted to use mac to watch fz on the road, but the ass subtitles failed to import, and my mind exploded*1; later I successfully obtained the xfz mobile phone hotspot, and the result was GG network after fifteen minutes, and my mind exploded*2; I feel that this is the face of tourist players A precursor to death, so began to sleep.
15:00 p.m.
Arriving in Zhongshan, I feel so fast... It's been less than 2 hours, and I haven't slept well. After training in the high school for a month, I have never seen the downtown area. There is a sense of seeing the poor children in the mountains entering the city, and they express their admiration and surprise when they see the tall (?) hotels. (I have a negative comment on the yellow T-shirt I sent this year)
16:00 p.m.
After arranging the room, obey the arrangement to sleep alone, and then start to wave... (Witch Forest is so difficult) Sleeping alone is a bit strange, but it feels very free 2333, but this room has no windows, so you can't get outside time.
17:00 p.m.
Gathered in the lobby and went to school for dinner, walked through the huge stadium and into a very small dining hall, and after the first bite I made a decision: I won't eat here again for the next few days. (Teacher Chen said at the provincial competition last year: "Donghua's meal is delicious! Or is it a buffet!" Then the cafeteria felt a mysterious power from the East? )
17:45p.m.
Wander around school after dinner and head back to the hotel. myh seems to have some bad impression of Zhongshan No.1? On the way, I discussed some mysterious data structure issues with myh (and was abused), and successfully obtained the achievement: discuss with the team leader before the provincial competition and increase RP.
18:10p.m.
Back at the hotel, I reviewed the mysterious DP and data structure with the dyh giant (and was abused), and received blessings (feng) from two classmates by the way.
19:40p.m.
R! N! G! Cattle! force!
(The factory manager is really old (fishing))
(The puppy is so cute (fog))
21:45p.m.
Hearthstone legend is really Nima... ah, don't hurry the film template. What time is it... woc, how about I kill the king?
:00 23:00 p.m.
After filming the template, wash and sleep. Before going to bed, I was very moved when I saw Bless all in the space full of screens.
Day1
05:45a.m.
? ? ? Didn't I set the alarm for 6:30? ? ?
06:15a.m.
? ? ? Why did the alarm clock go off again? ? ?
06:20a.m.
Okay, okay, take a shower, let's eat first
06:30a.m.
When I came to the restaurant, I found that there were only a few people... I was so scared that I thought I woke up late and everyone left. The porridge is delicious, and it is estimated that I am the only one who took a whole plate of bacon... After a while, the big guys came over, and lyy told us a supernatural (mistaken) story: myh four hours It took me an hour to go to the toilet, then swivel the chair in the toilet, and then AK hot! (Does the swivel chair have a mysterious relationship similar to RP?)
07:15a.m.
I walked to the exam room after eating, and I felt unwell on the way, so RP--
I re-filmed the template downstairs for the exam, and it felt even more empty = =
Before the exam started, I heard zmz blew a wave, and then we all said that he was stable
08:00a.m.
I entered the examination room, but I misread the location of the examination room, which caused my face to be confused. It took 2 minutes to react. . . a bad feeling
When I tested the machine, I coded KMP and suffix automaton, because I took a sip of GDOI before the test and liked the test string (there were really three last year!), and set up a big flag.
The keyboard and bench are super bad! ! ! And the right button of the mouse is fake, it feels like the year before...
08:30:a.m.
Exam officially started!
Unzip password: tiandihe_naiganyujunjue!66
The questioner showed a wave of Chinese proficiency?
Prior subject:
T1: Given n numbers, find the maximum number of groups that can be divided into equal and equal groups.
T2: There is a number string in the sense of modulo m. Each operation is to select an interval [l, r] with all +1 or -1. Find the minimum number of operations that can turn all numbers into 0.
T3: Give you a weighted tree with a root, and ask you to support four operations:
1. Set the root node weight to 0;
2. Move the weight of each point up one layer, that is, the weight of each point becomes the sum of the weights of each of its child nodes, and the weight of the leaf node becomes 0;
3. Change the weight of a point at time t;
4. Query the weight sum of a point subtree at time t.
T4: Given a competition graph (complete graph) and some known directed chains in it, find the expected number of connected components in the graph.
T1 stupid question, write it in 5 minutes.
T2 thought about the DP method at first, and found that the transfer was impossible, and suddenly found that 20% of the points n<=4, 2<=m<=10, and the remaining 25% of the points 2<=m<=3, suddenly Feeling very conscientious, ready to push violence. (tourists have no correct answer)
At first glance, T3 seems to be writing a tree section and a persistent line segment tree. After careful deduction, it is found that there is no need to be online. You can take the query offline and then maintain the subtree for the line segment tree. If you want to convert time into depth, then you need a The sum of the node weights within a range of depths in the node subtree. But I feel that there are many details and it is difficult to code, so I still give up...
T4 knew that it would definitely not, but the head iron pushed the formula for ten minutes, and the polynomial convolution structure appeared in the second step, which was decisively impossible.
I read the wrong question at the beginning of T2, thinking that I can add or subtract any size, and then I found that the violent dfs is 16^40, and suddenly lost the ideal. flew), but had no choice but to write T3 violence + special sentence. As a result, I wrote 40 minutes for the 10-point violence of T3, and another 30 minutes for the prefix sum of the 20-point special sentence, resulting in less than 40 minutes left after writing these. At this time, when I went back to look at T2, I found that I had read the wrong question extremely sb. I hurriedly played violent, and then continued to mess with m=3. I didn't construct a counterexample, and I just finished writing it. I was very nervous after the whole game, I was adjusting the code all the time, and four hours felt totally not enough.
12:45p.m.
After meeting with dyh and lzx, they decided not to eat in the dining hall and then went back to the hotel to find something to eat, so they turned around and went back to the hotel. After a friendly (mis)discussion on the road, I found the m=3 example, and the T3 did not open long long, and suddenly felt that the explosion on the spot became a reality. At 7-11, I discussed with Zhang Han Juxue and found that the algorithm of T1O(nsqrt(sum)) may explode. I feel like I can pack up and go back to Guangzhou tonight.
14:00 p.m.
After the lunch break, a group of people decided to go to the lecture hall to occupy a seat, and then decided on the road who would enter Day 3 and who would invite them to dinner (tourists said they earned blood).
15:00 p.m.
Before the lecture, the person who asked the question was blowing water every day (I can draw a portrait of Teacher Zuo's face...), zjt shared that he cut the first three questions in 1 hour, and then T4 did not finish it in three hours (Orz 300+ Team Master), and also Invite an AK(?) master to share (nue) and share (chang).
The lecture was finished in 30 minutes... There are more than 200 people in T1 AC. The questioner said that the data range of this question can be opened a lot, but it is not a question for sending points.
T2 seems to be more difficult than T3? The high-end DPs of all kinds of honey juices have been stuck by 60-90 points, and the number of ACs is less than that of T3... The correct solution is differential greed, I feel that this mysterious conclusion is more magical than last year's D1T2...myh's DP was released. The questioner has a hard point of 75 points.
T3 is CDQ divide and conquer + line segment tree scan line. The basic idea is similar to mine, but it is much more difficult to implement... It is probably to maintain the two dimensions of dfn order and dep and size, and then limit the dfn order of nodes in a node subtree As the side of the rectangle, it is maintained by the line segment tree scan line, and the outside is marked with the CDQ divide and conquer maintenance time. Myh's overall bisection + tree-like array maintains the prefix sum method. Hjw spent three hours coding a three-log line segment tree covering the chairman tree. Myh said that it would become a violent score? It seems that there is another giant who used the kd tree to get an RP score of 50-80 points?
T4 will only understand 20 points... that is to enumerate the number of edges at both ends of the chain after shrinking the point, multiply the force by 1/2 to the nth power, and the time complexity can be quadratic or cubic. More advanced construction polynomials. It seems that the people who went to the Jizhong training camp have done similar questions? The person who asked the question said that this year's question is slightly easier than last year, and someone may have AK. . .
This year, the transcript will be issued directly after the lecture. This year, I am afraid that I have used a high-end printer, and the speed is ++.
Result: 100+0+10+0=110
Feel this score is a violent mass score? T2WA hit the explosion, directly GG, and didn't even get the 30 points given... T3 only had 10 points for violence, and the WA was specially sentenced to be dropped, it should be an explosive int.
I walked around and found that many people are 100+, but our school does not seem to be very high, lzx130, dcxT1 two points WA lost only 130, hjwT3 exploded 60, dyh110, lzy85, wyh130 in the first year of junior high, I think I was still there Playing in the mud, I was successfully abused by my apprentice~
myh succeeded 275, zjt320, the two masters are stable. (OrzOrz) The evaluation of sk seems to be out of the pot, and T2T4 is confiscated and re-evaluated.
It feels like this year's Day 3 line will be 300+, so the tourist players are afraid to be determined. I think the probability of the two AC questions tomorrow is close to zero...Is it really a year is not as good as a year...I feel depressed
15:50p.m.
Walk back to the hotel with Mr. Chen, and discuss information issues happily on the way (fog)
16:05p.m.
Back to the hotel, review + decadent.
19:00 p.m.
Go downstairs for dinner and give five (ling) stars (cha) to the outsourced restaurant
19:45p.m.
After walking around the door, I came to the room dedicated to multimedia corruption in 821.
Play the mysterious double red and blue game with lyy (red and blue since ancient times...)
21:45p.m.
Back to the room, I was already lying down but couldn't sleep, Hearthstone Dafa is good
What about my phone? Regardless of the mysterious disappearance of the mobile phone, it should be RP++... I don't look for it anymore (it turns out that this decision made me GG directly)
23:30p.m.？
sleep? nonexistent
23:50p.m.
I can't help but sleep = =
Day2
08:45a.m.
Have you ever felt hopeless, boy?
08:55a.m.
Run from room to one in 10 minutes
Analysis: I lost my phone, so there was no alarm, and then the wake-up service didn't wake me up. Finally, the cleaning aunt rang the doorbell to wake me up. Conclusion: I became the only one in the provincial race to oversleep. I don't have the energy to regret or comment anymore.
09:00a.m.
When I sit down 50 minutes late, my mind goes blank.
Unzip password: easy?gdkoi2019_jian! (Roar from the organizer?)
T1: n points and m edges, the edge weight is calculated by the point weight, where p energy can be spent to reduce the weight of each edge by p, and the minimum amount of energy is required to make the shortest path from 1 to n less than or equal to t;
Does it seem conscientious? Sign in question is visual sense? A glance at SPFA+ two-point answer? Don't worry, let's see how the edge power is calculated: