6.30 simulation summary

The defense is broken The file name is wrong again Do this in the afternoon 1 minute （ No exaggeration ） There is nothing wrong with the reaction

Two day string question , Hang up steadily every day 50

If I don't hang up at all today 70 Just fine

Nothing can make me recover unless —— At noon, it was late to eat casserole , When buying beef casserole , Aunt gave me the leftover beef and crispy pork , A large bowl full of

It's not broken anymore ）

---

But here we need to reflect a more important issue

noi linux Open some big in/out When you file Very slow and daily collapse （ Carton The computer cannot click anything during loading , It can't be viewed smoothly in/out The contents of the document ）

This is very annoying in the final debugging

---

Make another statement I really didn't do it badly, didn't do it badly But to see that some questions are really empty ）

I feel I'm really good at algorithm fooling （ Like today's T2） This kind of problem with several skills I write very silky

But I'm really not good at that Push one-step nature to do one-step questions and imagination block questions

Time arrangement

7.30-9.00

（ Read the question roughly ） I found that I was not good at that kind ,1 It's black at a glance 2 It's almost an idea 3 Yes, a little confused

To avoid a crash like yesterday Ask yourself the time of each question direction 30min about

Wanted to think T1 What do you think n^3

And then go T2 Almost looked at it and thought $n(nlogn+lo{g}^{2}n)$ How to do it

（ And I still fought 20 Minutes of sleepiness I really don't understand I slept for eight hours yesterday ）

9.00-10.20

Write T2 It's written that I'm confused and won't deal with the details After thinking for a while, continue to write Then make data Stable 2000 I can't get in after a long time 5000 Abandoning treatment

（ Hehe, because today's file name is too simple, I typed it by hand and made a mistake

10.20-11.20

Facing T3 Think fiercely I thought about one n^2q Of dp Then think about that k=1

11.20-12.10

Suddenly it came back T3 The first step of is to divide Write hard At last I didn't transfer it out

Topic analysis

T1

Don't understand, Asking is $f[i,op]$ front $i$ Can characters become $op$

I always thought I was wrong （ Enumerate when transferring $j$ Re examination $i,j$ In the middle is n^3 Of ）

Then follow displace A chat

“ Why don't you $j$ Enumerate backwards ”

…（ Swearing ）

Found new problems The mock race is too urgent It's easy to dismiss your half formed idea as false

T2

consider sam Then put the suffix on the suffix tree , then dfs Heuristic merging , For what a dot represents len Two points check, Finally, you will get the length of the answer , And the number of several legal points

Consider how to get the answer , In fact, you can enumerate each point as a starting point Then go len Step to see which number it will get , See if it is in the legal number And the answer string min

T3

This made a mistake and T1 The same mistake I actually thought too much for a long time But it soon fell again

about k=1 Come on What is difficult to do is XOR and do 0 When

I rejected my idea at that time because “ After XOR sort The finished number is not monotonous ！”

Then think about If not, there will be No ） Before I check the number Sum the checked number with tag It's just an XOR ）

Finally, I was in a hurry Pieces only changed b（ Array used to sort ）, No change s（ Array used for assignment ）

15 I also have some ideas about that file

$f[i,j]$ Before presentation $i$ Can you spell the number $j$ （ Merge the front into s After merging the numbers in

however n^2q

Then I learned how others write

$s[i]$ Before presentation $i$ The XOR prefix of the number and

then In fact, we don't need to know whether we can spell anything

We consider the process of this division In fact, as long as we meet $[1,j]$ Can be divided $[j+1,i]\in S$ Then it's legal

So we think about $f[i]$ Before presentation $i$ Can characters form a legal division

Transfer consider enumerating this point and the previous number to form $k$ Which of the numbers

set up $mp[w]$ It means that dp In the process There is a prefix XOR value of $w$ The prefix of is legal

Then just check whether there is $mp[s[i]xora[k1]]$

$mpalong\; withthefmorenew$

This only uses nkq

---

So if you are calm today / If the foundation is more solid, there may be 90

I feel I need to do more derivation / Block question ）

Better is 20+50+35 To some qwq