2022/7/1

Time arrangement

7:30~8:00

I don't know the use of random data , Thought about the scan line for a while , Dismantle the dismantling formula , But there is no progress , So write T2 The violence of

8:00~8:30

T3 No idea , Write T3 The violence of

8:30~10:20

T1 The operation and weight of can be regarded as independent , So you can first dp Which nodes need to be operated , Then attach a point weight to each point randomly , In this case, the probability of conflict is very small , Complexity $O(n)$, The code is also very easy to write , But the sample is too watery , Worry about correctness .

10:20~10:40

Wrote a $O(2^n)$ Shape pressure counterpoint , No problem .

10:30~10:50

Yes T3n=1 The situation of

11:00~12:00

Want to discuss and write in categories n=2 The situation of , Finally, it didn't come out

A summary after the exam

T1, Random numbers are exploded by chrysanthemum cards , Only 75pts, However, it's wonderful not to interfere with each other according to the congruence structure .
T2, Conclusion :n There's a range of [0,m] The expected maximum value of the number between is m-m/n^2, So the answer to violent enumeration is right .
T3, During the exam, I always thought about interpolating the product of weight and area , The solution of the problem uses one step to transform, and only needs to calculate the interpolation of the area , I didn't expect to use the scanning line to find the area at a certain time .