当前位置:网站首页>2022/3/11 exam summary
2022/3/11 exam summary
2022-07-27 22:50:00 【Misty rain】
Match time arrangement
7:40~8:00
Read the question , Find out T3 It's the original question
Vaguely remember that polynomials accelerate the first kind of Stirling numbers
To be on the safe side, I wrote a violent calculation of the first kind of Stirling number
It's just a sample
Because there are lessons from the past , So I dare not write polynomials , Let's go to the first two questions
8:00~8:20
T2 Of k ≤ 3 k\leq3 k≤3 It's strange
k = 1 , k = 2 k=1,k=2 k=1,k=2 It's easy to do
however 3 There is no nature
A push , It is found that for a left endpoint , The change of the bitwise and of the continuous interval is O ( l o g a i ) O(loga_i) O(logai) Grade
Because if everyone becomes 0 It won't change
You can open a bucket for each binary bit , Looking for the first one after two points in the bucket will make the current from 1 become 0 The location of
Then the number of such intervals is O ( n log a ) O(n\log a) O(nloga) Of
And then when you check , Take the inquiry offline , Just use a segment tree to maintain
Then write quickly
8:30~9:00
Write T2
9:00~9:40
After you've written , A violent confrontation
There is no problem with the accuracy , But the constant is very large , ran 2.3s
Plus fast reading , Change the line segment tree into a tree array , Found that only ran 1.7s
But there is still the risk of being stuck
After testing, I found that the output actually lost 800ms
Change to quick write , Just run in 1s Within
9:40~10:10
T1 No idea , Wrote a O ( n m 2 ) O(nm^2) O(nm2) The practice of
Expected score 45pts
10:10~11:15
I quickly recalled how to find the first kind of Stirling number
It seems that only one is needed NTT And a multiplier
Just hurry , Take a picture after the yard , Then Kaka often , It shouldn't be a big problem
11:15~11:50
Check , Right beat
Summary of setting questions
T1
In fact, the essence is offline scanning line , Just keep adding , Become constantly deleted
however , It's the first time to see a trie The operation of merging the sons of trees
Then heuristic merge maintenance
It feels wonderful
T2T3 The train of thought is the same as the solution
边栏推荐
- catch all in one draft! Introduction to 10 data visualization software
- It is said that Huawei will cut the order again! Supply chain manufacturers are more difficult
- 解决ip地址访问末位奇数通偶数不通,或者偶数通奇数不通的问题(云加密机连接云服务器时遇到的问题,全程记录,希望能给大佬们灵感)
- 2022/6/9 考试总结
- PyQt5快速开发与实战 4.9 对话框类控件
- ConvNeXt:A ConvNet for the 2020s——模型简述
- 初中三年回忆录
- PyQt5快速开发与实战 4.10 窗口绘图类控件
- Uniswap集成sudoswap,能否拉开NFT流动性新序幕?
- 51单片机内部外设:实时时钟(SPI)
猜你喜欢

Understanding and use of third-party library

一篇搞定Redis中的BigKey问题

The follow-up is coming. Whether it's OK without reference, let's make it clear to everyone at once!

【无标题】

Build your own website (22)

SQL injection less26a (Boolean blind injection)

setContentView详解

智能家居浪潮来袭,如何让机器看懂世界 【结尾有资料】

Hill sort of seven sorts
DP traceability problem
随机推荐
基于MCU的二维码生成及在墨水屏上进行二维码显示
Setcontentview details
2022/3/22考试总结
US officials suggested trump prevent Infineon from acquiring cypress
云计算服务主要安全风险及应对措施
MediaTek and Samsung launched the world's first 8K TV that supports Wi Fi 6
Cy3荧光标记抗体/蛋白试剂盒 (10~100mg标记量)
PyQt5快速开发与实战 4.9 对话框类控件
[binary tree] count the number of good nodes in the binary tree
Kubernetes二进制部署——理论部分
Hc32f4a0 clock control
The epidemic has spread to 28 states in the United States: more than 100000 employees such as apple and Microsoft work from home, and iphone11 is almost out of stock!
Jumpserver learning
How to quickly pass the probation period for newly trained intermediate test engineers
SSM integration process
技术生涯10年,那些让我心动的技术书
可能导致索引失效的原因
[cloud native] deploy redis cluster in k8s
Uniswap集成sudoswap,能否拉开NFT流动性新序幕?
[NOI2018] 冒泡排序(组合+卡特兰数+dp+树状数组)