图论
小伙子开的什么车啊
这个作者很懒,什么都没留下…
展开
-
POJ1904-King's Quest(思维+强连通缩点)
King’s Quest Time Limit: 15000MS Memory Limit: 65536K Total Submissions: 9590 Accepted: 3551 Case Time Limit: 2000MS DescriptionOnce upon a time there lived a king and he had N sons. And原创 2018-01-21 22:28:54 · 285 阅读 · 0 评论 -
POJ3160-Father Christmas flymouse (强连通缩点+dfs)
Father Christmas flymouse Time Limit: 1000MS Memory Limit: 131072K Total Submissions: 3764 Accepted: 1245 DescriptionAfter retirement as contestant from WHU ACM Team, flymouse volunteere原创 2018-01-18 20:54:47 · 252 阅读 · 0 评论 -
HDU2767-Proving Equivalences(强连通+缩点+DGA性质)--Tarjan模板
Consider the following exercise, found in a generic linear algebra textbook. Let A be an n × n matrix. Prove that the following statements are equivalent: A is invertible. Ax = b has exactly one原创 2018-01-18 20:44:03 · 224 阅读 · 0 评论 -
POJ3228- Gold Transportation (并查集+kruskal)
Gold TransportationTime Limit: 2000MS Memory Limit: 65536K Total Submissions: 3547 Accepted: 1262 DescriptionRecently, a number of gold mines have been discovered in Zorr...原创 2018-01-18 20:29:13 · 213 阅读 · 0 评论 -
POJ1751-Highways(最小生成树+并查集)
Highways Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 17777 Accepted: 5213 Special Judge DescriptionThe island nation of Flatopia is perfectly flat. Unfortunately,原创 2018-01-18 19:47:27 · 211 阅读 · 0 评论 -
HDU1281-棋盘游戏(二分匹配)
Problem Description小希和Gardon在玩一个游戏:对一个N*M的棋盘,在格子里放尽量多的一些国际象棋里面的“车”,并且使得他们不能互相攻击,这当然很简单,但是Gardon限制了只有某些格子才可以放,小希还是很轻松的解决了这个问题(见下图)注意不能放车的地方不影响车的互相攻击。 所以现在Gardon想让小希来解决一个更难的问题,在保证尽量多的“车”的前提下,棋盘里有些原创 2018-01-18 19:31:53 · 159 阅读 · 0 评论 -
HDU5040-Instrusive (优先队列+BFS)
The legendary mercenary Solid Matt gets a classic mission: infiltrate a military base. The military base can be seen as an N * N grid. Matt’s target is in one of the grids and Matt is now in another原创 2018-01-17 20:43:44 · 248 阅读 · 0 评论