当前位置:网站首页>2022/8/3 Exam Summary
2022/8/3 Exam Summary
2022-08-03 23:09:00 【misty rain】
时间安排
7:30~8:00
先看了一遍题,It doesn't feel like one,非常自闭.
8:00~9:00
写了T2的暴力.
9:00~9:20
写T3的暴力
9:20~10:00
写T3the second and third gears,But somehow the answer is always big.
于是就放弃了
10:00~11:00
T1It can be done after Stirling split power,But don't know why the answer is always wrong.自闭.
11:00~12:00
想了想T2的 O ( n 2 ) O(n^2) O(n2),Finished writing a large sample.
考后总结
T1
It is the routine of using Stirling number to divide the power,into a composite meaning,Then proceed through tolerance and exclusiondp,All in all, it's very tricky.
I made a typo during the exam,导致挂了.
T2
O ( n l o g 3 n ) O(nlog^3n) O(nlog3n)
dsu on tree,Then use the tree chain to divide the statistics d [ y ] − 2 ∗ c n t [ x ] [ y ] d[y]-2*cnt[x][y] d[y]−2∗cnt[x][y]
复杂度 O ( n l o g 3 n ) O(nlog^3n) O(nlog3n),But the constant is not big.But very good.
O ( n l o g 3 n ) O(nlog^3n) O(nlog3n)
Merge maintenance with segment tree,Then there is the tree chain segmentation,不过空间是 O ( n l o g 2 n ) O(nlog^2n) O(nlog2n),很危险.
So each heavy chain shares a segment tree,So the spacelog.
T3
就是dp,It's just that the author did better.
待upd.
边栏推荐
- 2022-08-03 Oracle executes slow SQL-Q17 comparison
- Recognized by International Authorities | Yunzhuang Technology was selected in "RPA Global Market Pattern Report, Q3 2022"
- 【LeetCode】最长公共子序列(动态规划)
- Storage engine written by golang, based on b+ tree, mmap
- 图论-虚拟节点分层建图
- P1449 后缀表达式
- 走迷宫 BFS
- 创建函数报错,提示DECLARE定义语法问题
- Pytest learn-setup/teardown
- 代码随想录笔记_动态规划_416分割等和子集
猜你喜欢
随机推荐
完全二叉树问题
Redis persistence method
The salary of soft testers at each stage, come to Kangkang, how much can you get?
UVa 437 - The Tower of Babylon (White Book)
什么是memoization,它有什么用?
BMN: Boundary-Matching Network for Temporal Action Proposal Generation Reading Notes
Diazo Biotin-PEG3-DBCO | Diazo Compound Modified Biotin-Tripolyethylene Glycol-Dibenzocyclooctyne
RPA power business automation super order!
牛客2022 暑期多校3 H Hacker(SAM + 线段树查询区间内部最大子段和)
Embedded systems: overview
The sword refers to the offer question 22 - the Kth node from the bottom in the linked list
藏宝计划TreasureProject(TPC)系统模式开发技术原理
[2022安恒夏令营] 5个小题
The principle and use of AOSP CameraLatencyHistogram
OPC UA 与IEC61499 深度融合(1)
AOSP CameraLatencyHistogram的原理与使用
为什么我们需要回调
Republish the lab report
Storage engine written by golang, based on b+ tree, mmap
逆波兰表达式求值









