图
NG KIM-BING
写给自己看的博客~
展开
-
K: LED-led Paths (2019湖南ACM多校第5场)
DescriptionIn a large city there are n junctions and m one-way streets connecting those junctions. It is known that one can’t walk along the streets infinitely, as there is no directed cycle of stree...原创 2019-04-22 14:12:13 · 782 阅读 · 0 评论 -
[生气!!&教训] D: Delete(Wannafly挑战赛2)(拓扑+Dijkstra+线段树)
D: Delete链接:https://ac.nowcoder.com/acm/contest/17/D来源:牛客网以下表情包来源(百度 http://www.baidu.com)Description给定一张n个点,m条边的带权有向无环图,同时给定起点S和终点T,一共有q个询问,每次询问删掉某个点和所有与它相连的边之后S到T的最短路,询问之间互相独立(即删除操作在询问结束之后会立即撤销...原创 2019-04-24 21:56:13 · 1250 阅读 · 0 评论 -
The Preliminary Contest for ICPC Asia Nanjing 2019 H. Holy Grail (图论,负权图)
As the current heir of a wizarding family with a long history,unfortunately, you find yourself forced to participate in the cruel Holy Grail War which has a reincarnation of sixty years.However,fortun...原创 2019-09-02 21:10:17 · 1489 阅读 · 0 评论 -
Codeforces Round #397 765E - Tree Folding
E. Tree Foldingtime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputVanya wants to minimize a tree. He can perform the following operation multipl...原创 2019-09-14 10:02:51 · 1556 阅读 · 0 评论 -
The Preliminary Contest for ICPC Asia Shenyang 2019 D.Fish eating fruit (容斥,点分治)
State Z is a underwater kingdom of the Atlantic Ocean. This country is amazing. There are nnn cities in the country and n−1n-1n−1 undirected underwater roads which connect all cities.In order to save ...原创 2019-09-14 22:10:29 · 1564 阅读 · 0 评论