木子川 - 博客园

2019年9月9日

Invitation Cards POJ - 1511 最短路，SPFA+单向往返图

摘要： In the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this fact. They want to propagate 阅读全文

posted @ 2019-09-09 19:30 木子川阅读(224) 评论(0) 推荐(0)

Arbitrage POJ - 2240 最短路Bellman判断正环

摘要： Arbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency into more than one unit of the same currency. For 阅读全文

posted @ 2019-09-09 12:03 木子川阅读(225) 评论(0) 推荐(0)

Cow Contest POJ - 3660 Floyd算法，关系链图

摘要： N (1 ≤ N ≤ 100) cows, conveniently numbered 1..N, are participating in a programming contest. As we all know, some cows code better than others. Each 阅读全文

posted @ 2019-09-09 09:55 木子川阅读(208) 评论(0) 推荐(0)

2019年9月8日

Radar HDU - 2295 DLX,重复覆盖+剪枝

摘要： N cities of the Java Kingdom need to be covered by radars for being in a state of war. Since the kingdom has M radar stations but only K operators, we 阅读全文

posted @ 2019-09-08 21:46 木子川阅读(227) 评论(0) 推荐(0)

MPI Maelstrom POJ - 1502 最短路Dijkstra

摘要： BIT has recently taken delivery of their new supercomputer, a 32 processor Apollo Odyssey distributed shared memory machine with a hierarchical commun 阅读全文

posted @ 2019-09-08 21:36 木子川阅读(251) 评论(0) 推荐(0)

2019年9月7日

Wormholes POJ - 3259 最短路SPFA

摘要： While exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wormhole is very peculiar because it is a one-way path tha 阅读全文

posted @ 2019-09-07 11:14 木子川阅读(150) 评论(0) 推荐(0)

Currency Exchange POJ - 1860 最短路Bellman

摘要： Several currency exchange points are working in our city. Let us suppose that each point specializes in two particular currencies and performs exchang 阅读全文

posted @ 2019-09-07 10:28 木子川阅读(303) 评论(0) 推荐(0)

2019年9月6日

Silver Cow Party POJ - 3268 最短路Dijkstra 正向图和方向图

摘要： One cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1..N is going to attend the big cow party to be held at farm #X (1 ≤ X ≤ N). A total 阅读全文

posted @ 2019-09-06 19:57 木子川阅读(205) 评论(0) 推荐(0)

Heavy Transportation POJ - 1797 最短路Dijkstra

摘要： Background Hugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. But he needs a clever man who tells him whe 阅读全文

posted @ 2019-09-06 18:03 木子川阅读(187) 评论(0) 推荐(0)

2019年9月5日

DLX算法

摘要：理解DLX算法之前首先了解精确覆盖问题和重复覆盖问题精确覆盖问题何为精确覆盖问题在一个全集X中若干子集的集合为S，精确覆盖（Exactcover）是指，S的子集S*，满足X中的每一个元素在S*中恰好出现一次。定义满足以下条件的集合为一个精确覆盖： S*中任意两个集合没有交集，即X中的元素在阅读全文

posted @ 2019-09-05 21:08 木子川阅读(4994) 评论(0) 推荐(4)