_kiko

摘要： 网络流24题 这几天就慢慢把网络流补一补吧，慢慢更新 1.餐巾计划问题 "🔗" 主要考虑建图 1.第一天其实就可以把所有需要买的餐巾全买了，$S\rightarrow 1, cap = INF, fee = p$ 2.每天都需要消耗餐巾，控制流量，$i\rightarrow T, cap = r_ 阅读全文

摘要： ACM ICPC 2018 焦作赛区网络预赛 $A. Magic Mirror$ 签到 $C. Password$ $D. Sequence$ $E. Jiu Yuan Wants to Eat$ 如果只有$1,2,4$操作那就是树剖的模板题了，现在多了一个操作$3$ 其实还是模板题，因为是对$2^ 阅读全文

摘要： Acesrc and String Theory Problem Description Acesrc is a famous string theorist at Nanjing University second to none. He insists that we should always 阅读全文

摘要： Problem E. Split The Tree Problem Description You are given a tree with n vertices, numbered from 1 to n. ith vertex has a value wi We define the weig 阅读全文

摘要： Problem E. TeaTree Problem Description Recently, TeaTree acquire new knoledge gcd (Greatest Common Divisor), now she want to test you. As we know, Tea 阅读全文

摘要： Boring counting Problem Description In this problem we consider a rooted tree with N vertices. The vertices are numbered from 1 to N, and vertex 1 rep 阅读全文

摘要： Query on A Tree Problem Description Monkey A lives on a tree, he always plays on this tree. One day, monkey A learned about one of the bit operations, 阅读全文

摘要： 2019 ICPC Asia Yinchuan Regional $A. Girls Band Party$ $B. So Easy$ 给$n$行$n$列分别加上一个$\ge 0$的数，已知其他位置的数，求$x$行$y$列处的数是多少 每行每列全都减去当前行或列最小的那个数，第$x$行减去的值和第$ 阅读全文

摘要： Luogu P6139【模板】广义后缀自动机（广义SAM） 模板题，把所有串加进去，计算不同子串的数量即可 cpp // pragma GCC optimize("O3") // pragma comment(linker, "/STACK:1024000000,1024000000") inclu 阅读全文

摘要： 2017 2018 ACM ICPC Northern Eurasia (Northeastern European Regional) Contest (NEERC 17) A.Archery Tournament 假设当前询问为$x,y$，那么能包含它的圆必然是其左边第一个直径$\ge y$的或 阅读全文