Not a provincial travel recordJust an excuse to get mad
2.21
Let's summarize some simulation competition
Save the flow: 100+10+5=115pts -> 52+10+0=62pts I feel so angry
T2 Expectation Question T3 is very abstract structure. It will be about 1h of the beginning. I thought that only leaves would be thrown away. So I should just play it by hand.
So a single log can be merged by heap/line segment tree, a double log set/pq+heuristic merging can be done casually. I wrote a left-sided tree. It's still too late.
As a result, because I didn't have the habit of encapsulating the fa into the structure, I forgot to double it, so I hang up 50pts. Or because I saved the elements that came out of the maximum and sub-maximum values each time, I didn't reuse this position. In short, the positive solution becomes a violent fraction.
Then T2, who had been thinking for a long time, I missed the size of the point set, enumerated the roots of the tree, and then traversed the method of using sz to statistic answers. I found that I couldn't do it at all. I was stupid.
So I opened T3 first. At this time, there are about 1.5h~2h left. I can't remember it very clearly. It took a long time to determine the question of T3. What should I do if the two grids are the same? So I asked if I could construct 0. I came to the conclusion. So the case of n=1 is to determine the isomorphism of a loop.
So the funniest thing is coming. The structure must be a positive integer, but people didn't say that the number of operations cannot be 0. . .
There is still 1h left in the future. I tried to save $n^3$ and failed. It seems that I have lost the chance to get along with T2's 45pts. I quickly touched the enumeration method. I opened a bitset to maintain data volume of 15. Later, I felt that running 0.9s was too limiting. In the end, I changed my normal state and pressed it on.
Summary: The steps for answering questions are too irregular. You must implement sop. This kind of array is a pure Tang poem. If you open a small card with 50pts, you will lose all the questions.
After listening to the topic, I found that there are many things to do in PBDS. I learned it, technology!
I met a senior kitten after dinner and fed a grilled sausage to the senior. When the senior was eating the grilled sausage, he was ridiculed by his passing classmates, "Why is this cat so fat and can't walk?"
The fat little dumpling is the cutest
2.22
CUHK yau Day1! Wish lxj rp++! Will definitely win!
I'm still happy to be off-site this year. I might be on the court next year. I'm a little afraid.
Let's summarize some simulation competition
Save the flow: 100+0+0=100pts -> 49+0+0=49pts It is not a complete sense of slap. The things I wrote in T1 are indeed very abstract, and I don’t have time to write the beat. The seven examples are completely without intensity. If you consider less of one situation, you can get over the big examples.
T1 first thought it was a graph topic, and then found out that it was a data structure. Then he understood the route of managing $a->b$ as managing all sites in the $[a,b]$ interval. It seemed that it took a long time to correct this understanding.
I read all the T2T3 at the beginning, it's a mysterious structure again. I feel like T1 can do it
So I came back to promote the contribution. The question was a little confused. There were two dimensions that needed maintenance. I found that it was impossible to move l and r to one side at the same time, and either move one side at the fixed side or l and r to expand the fixed side outward at the same time. It is easy to deal with the situation of scanning lines twice on the front and back to maintain the chairman tree, and then stuck on the situation of expanding at the same time at both ends.
As we all know, chestnuts are masters who hit the wall and will work hard to repair the pot on their hands in a dead end, which is difficult to get around. So I missed an abstract thing about the chairman tree maintenance sequence + balance tree maintenance answer, because even if I made the scanning line, my contribution was still difficult to count.
Obviously, based on experience, this thing is abstractly fake. Obviously, I can't write such a ghost thing during the game. Half of the time has passed, and the score is 0. So I continued to start and deal with all extremely small legal intervals first. As long as one of them is included as a sub-interval, it must be legal. I found that the good nature is that the left and right end points of these intervals are monotonous! So I found that what can contribute to the expansion of both ends at the same time is a continuous interval! Then you only need to get the minimum value of the interval length of this section!
The final result is that I still wrote it for a long time, and the click was adjusted. The reason for the hangup was that $l<r$ /yun was not judged before. It was not enough to consider the details. I didn't expect that this would be the case if the range that can be expanded at the same time would be exaggerated.
T2 can get 60pts if it has no solution. It's so amazing, but there's no time left
Summary: I feel that the main reason for the score is that I am not capable of being able to do it. It is not easy to write this question from thinking about it. I feel that the probability of cutting it in the exam is almost 0. If you want to train, please
It is worth mentioning that T1 is half written, like my local compiler, the computer room is really invincible, and it is like changing position and adding 10 minutes to overtime, so in fact, I finished T1 with the overtime point, so OJ bursts out of zero.
Dinner is amazing. I first run two meals and then one meal. When I saw it, I found that it was three meals. Can qhzx not make the canteen light sign so bright as if it was turned on. It is really not friendly to us blind people/ll
There is also a number-choice class in the evening, so there is no holiday this week. Last week, I did a preset condition for homework and no one found out about it. How could it be?
The teachers who are assigned to the new leaders in the school look amazing! And the lectures are friendly to the people! The methodology is very good, less than 10 times "Love Mathematics"
2.23
CUHK yau Day2! The lxj group theory must turn the tables!
Oh, don’t forget to bring the tablet, but my number-point lecture notes are on the tablet! So I could only take notes in the morning
The online class speed is quite fast, and I tend to count paper notes in the future. Although the characters are ugly, they are fast.
In the afternoon xmoj, let’s summarize some training match
Actually, there is a little Tang poetry scene. T1 random answer is just two points, quick
T2 looks at the line segment tree to maintain the matrix. I did a little bit of maintenance of square terms, and wasted 3 minutes, and then it was successfully pushed out and threw the matrix onto the line segment tree. The sample was stuck in the boundary special judgment, and the other ones were passed.
Take T1, corner case is offended, and a small pot repair, it takes about 1h
T3 first glance like Tetris data structure, which scared me and thought I had encountered the Tetris difficulty problem again. The meaning of the conversion question: add interval, find the number of new >h numbers after each operation. Alas, it's not broken, why didn't I have seconds? How can I implement the operation of an interval for a number of >h -inf, touch the fish, think about it for a moment, and I'm defining it, and I'm trying to strengthen the question again. It's so stupid. Obviously, each number is operated at most once, maintaining the most value and position.
Open T4, Oh my God, it’s a familiar question, but how do it do it! The classmate said that after the mx test, why is there no partial marks in this question? There is a way out.
There are still 40 minutes to 50 minutes left, so I went back and hung a beat for T2T3 first. Oh, why can't I take T2? Oh, why can't I take the limit data? Oh, why can't I take the matrix multiplication? How can I take less modulus!
I looked at the mx question as counting, which is completely different from this question /yun, so I planned to give up T4. Due to some of the disgusting characteristics of xmoj, I went back to check the codes of the first three questions.
Summary: The biggest problem is that T3 has inexplicably reduced intelligence, which leads to the 2.5h time allocation is not so reasonable. Others are OK, and they have not adjusted the code much, and the touch is good.
Yao Shen talks about T4, balance tree optimization DP, why is there no idea in the field?
Afterword, I flipped through the notes on the 24th and found that T4 had been told about S Meow during the winter vacation last year! ! ! It's warm. I didn't write this question on the homework sheet a year ago. There is still no field cut after a year of simulation competition. I think I should reflect deeply.
Suddenly I wanted to eat ice cream, but I thought that I was scolded by TAOI collectively when I didn't eat supper last time, so the canteen started
Seeing the crowds of people in the basketball court and the pairs of badminton people, I was stunned for a moment and looked a little alive.
After a walk around the playground, I found that there was no mountain cover here and the sunset was full of sunset. The sun was about -6° altitude angle, which was the blues moment of YT.
Stop in the noise of the people, and feel a little touching. It would be great if we were in the same school.
Actually, I think this material is good, why don’t you write it again in a different style?
I still couldn't help but order ice cream at night (it's a bit swaying
2.24
About being moved to their blog park by a classmate in the computer room,
Name it herezyb_123andzyb_txdy
I originally said that I would move to the blog park myself, so I don't have to work now
Want to play badminton, want to play badminton, want to play badminton, want to play badminton, want to play badminton, want to play badminton, want to play badminton, want to play badminton, want to play badminton, want to play badminton
Why are there no badminton people in the computer room?
2.25
Some accident happened early in the morning, it was against the will of heaven, and it couldn't be handled
Things have become even more amazing, and the computer room is very confused
Down in the evening, hard controlled by sunset for 10 minutes
The number-point exercise class asked me why the whole class couldn’t figure out the results of a certain exercise last week, but the teacher did make a lot of mistakes in the class last week, which is difficult to evaluate.
Things cannot be properly resolved
Big fire
Want to play the National Youth Model League, want to play the model league in the English market
2.26
The more I get to the provincial selection, the more I put it on. After all, my buddy
Suddenly I remembered that the last flag was unspoken on the last day of the deadline. The reason was mysterious. Now it seems that I can also say that I have a little divine gold. Anyway, I have been in a hurry and crazy way like a crazy person.
This led to my little dreaming love not buying it!
Decided to set up a new flag: It is now 2.26 at 17:30. From tomorrow to the day before your birthday, you will not show off your bad luck and do not wander around and watch the rape. At least two USACO questions will be completed. The provincial selection scores can be accepted by yourself. You have good quality and less scolding. You should try to stabilize your mental state. After completing the purchase of the Snowstorm for yourself.
Take this as a proof
A certain chestnut was very brave and openly put on the playground alone. He completed the 20-minute sunset shooting. Unfortunately, the effect was not as good as I thought.
2.28&3.1&3.2
As the title is, it is not a travelogue. It is pure and scattered and has no actual value. It will be transferred to private ownership in a few days and will not pollute my classmates' eyes.
Trying to insert the eyes of the cyber blog, but failed.
So I made a bad score in two days + a few points (?
3.3
Go back to him unexpectedly and deal with something.
【Data Delete】
I didn't expect that I would go home in such a state of mind
How to do a counting score on the high-speed rail? I feel sick all the way. Why did Chuanxi still faint in the train? I didn't keep it tight
There is still a good thing, not all bad things
3.4
Xiaobing, but was secretly taken out by my brother to celebrate his birthday at night
The golden crow is bright and the peony is dyed red. It is as bright as a lamp, and the beauty is as dream.
Excerpt from Shenghe, I like this sentence the most
It's not open for birthday this year, maybe you can add a mix-and-match plog in two days
Oh yes, flag is not completed
3.5
The characteristics of the half-day equation cannot be solved by the number-partition homework. The poet holds it
The poet holds the topic "Seeking the perfect item and then doing something randomly".
Start the text
Save money: The fight was very anthropomorphic, and it was less than the public score in two days.
Day1
Difficulties, read the three questions in 30 minutes, and the background of the T2 question is good (fog)
T1, consider how to check whether a number x is legal. We found that we greedy to choose as many as possible for all x, and try to choose as few others as possible. Just judge whether it is a median. You can log the data structure at any time to check. I found that there are many points.
I started to think about whether I could check one by one. I played with my hands and found that the legal number must be a continuous interval, which is precisely continuous after discreteization. So I found the left and right endpoints of the legal interval in two-part and then took it together with all the intervals given.
So I started to anthropomorphize and wanted to upload the online segment tree to maintain the interval. After reflecting on the order, I just scan it directly.
So I continued to anthropomorphize and wrote the above-mentioned check to check whether a number is legal to binary. It is obvious that the smallest x should actually be binary so that there is a legal median in the numbers less than or equal to x and the largest x so that there is a legal median in the numbers greater than or equal to x.
If I'm not a buddy, why should I be hard-controlled by T1 for 2.5h+? The poet holds it
Start T2 and find that DAG connectivity is related. First throw a bitset, and then it will only be violent.
Start T3 and play with the question. Is there a continuous segment in the subtree? Expanding to the forest, it was found to be fake, and it was not very good at certifying trees. Why is there almost no time? I'm anxious to fight for violence first? What I wrote is like? I clicked on the examples and checked them a little, and I didn't have time to compete for the nature of the
I wrote a data point divisionif(type==1 || type==0) solve1();Go up.
128pts -> 124pts
Day2
Reading the question, no, why are you so sleepy when you start the show every day and are about to go bankrupt, so you go to bed
Thinking about T1, my mind is not very clear, and I found that it is definitely not bad to do it in the order of t from small to large. Then I wanted to throw it on the value range line tree to maintain it. I don’t know how to do this, so I considered selecting a box to move every time, and I needed to maintain the position of the box. Oh, I basically know, something that is shaped like an interval covering an arithmetic sequence, but I feel a little troublesome. I thought that when I talked about LIS before, there was a strict non-strict trick, so I directly $a_i=a_i-i$ $b_i=b_i-i$, and I found that since the contribution form is $a-b$, $-i$ was eliminated directly, which is very elegant
Therefore, the segment tree maintains the interval flattening, the interval sum, and the segment tree can be divided into two parts.
Hey, how do I put the example? Is there any problem with this approach? Repair, my mentality is a bit explosive
I output intermediate variables one by one to the small sample examples, but I can't call it out. I wonder if I have any problems with my statistical contribution, so I started to reconstruct it, convert it from $a_i-i$ to the original position and then count the answer.
Oh, why do I write less update! This can pass all the small examples! ! The Tang is over! ! ! So I have two codes that can be used for different practices.
Why are I hard-controlled by T1 for 3h? The poet holds it
Open T2 T3, there is not much time left. I don’t know how to ask for the smallest tree chart. It’s a bad thing. I didn’t hold it back. I tried a hash violence for T3 and I regret to leave the market.
After the game, I found out that T2 violence is actually not used to find the smallest tree chart without Zhu Liu's algorithm. I'm so stupid
108pts -> 108pts
postscript
124+108=232pts
Some are happy and some are sad
A junior UB died a whole question and condolenced silently
Our school should have three teams, congratulations to the men,
With such strength, how can NOIP2025 win next year?