![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
cf
叶子心情你不懂
帅哥
展开
-
Round #512 (Div. 2) 1030D - Vasya and Triangle
D. Vasya and Triangletime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasya has got three integers nn, mm and kk. He'd like to fin...原创 2018-09-24 10:00:03 · 388 阅读 · 0 评论 -
Educational Codeforces Round 51 (Rated for Div. 2) D. Bicolorings
D. Bicoloringstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a grid, consisting of 22 rows and nn columns. Each c...原创 2018-09-21 20:52:38 · 298 阅读 · 0 评论 -
Educational Codeforces Round 54 (Rated for Div. 2) D.Edge Deletion
唉B没看见公告,wa惨了。这题让你把原来的图擦的只剩下k条边,要求剩下的边的好点尽量多。这题要求对最短路有个深刻的理解,单源最短路搜出来的其实是一棵以节点一为根的树,这是贪心性质决定的。然后就容易把好点尽量多转换成边尽量多,因为树里非根点和边一一对应。那么边尽量多就是贪心解决了,深搜前k个或者宽搜前k个都行应该,我写的宽搜。 #include <cstdio>...原创 2018-11-13 19:25:11 · 127 阅读 · 0 评论