图论题
m悟空
这个作者很懒,什么都没留下…
展开
-
FatMouse and Cheese (记忆化搜索)
FatMouse has stored some cheese in a city. The city can be considered as a square grid of dimension n: each grid location is labelled (p,q) where 0 <= p < n and 0 <= q < n. At each grid lo...原创 2018-09-02 21:52:16 · 487 阅读 · 0 评论 -
食物链 (并查集 好题)
动物王国中有三类动物A,B,C,这三类动物的食物链构成了有趣的环形。A吃B, B吃C,C吃A。 现有N个动物,以1-N编号。每个动物都是A,B,C中的一种,但是我们并不知道它到底是哪一种。有人用两种说法对这N个动物所构成的食物链关系进行描述: 第一种说法是"1 X Y",表示X和Y是同类。 第二种说法是"2 X Y",表示X吃Y。 此人对N个动物,用上述两种说法,一句接一句地说出K句话,...原创 2018-08-09 17:33:08 · 2250 阅读 · 0 评论 -
Is It A Tree? (并查集)
A tree is a well-known data structure that is either empty (null, void, nothing) or is a set of one or more nodes connected by directed edges between nodes satisfying the following properties. There ...原创 2018-08-09 17:13:13 · 1909 阅读 · 0 评论 -
小希的迷宫 (并查集)
上次Gardon的迷宫城堡小希玩了很久(见Problem B),现在她也想设计一个迷宫让Gardon来走。但是她设计迷宫的思路不一样,首先她认为所有的通道都应该是双向连通的,就是说如果有一个通道连通了房间A和B,那么既可以通过它从房间A走到房间B,也可以通过它从房间B走到房间A,为了提高难度,小希希望任意两个房间有且仅有一条路径可以相通(除非走了回头路)。小希现在把她的设计图给你,让你帮忙判断她的...原创 2018-08-09 17:03:17 · 320 阅读 · 0 评论 -
产生冠军 (并查集)
有一群人,打乒乓球比赛,两两捉对撕杀,每两个人之间最多打一场比赛。 球赛的规则如下: 如果A打败了B,B又打败了C,而A与C之间没有进行过比赛,那么就认定,A一定能打败C。 如果A打败了B,B又打败了C,而且,C又打败了A,那么A、B、C三者都不可能成为冠军。 根据这个规则,无需循环较量,或许就能确定冠军。你的任务就是面对一群比赛选手,在经过了若干场撕杀之后,确定是否已经实际上产生了冠军。...原创 2018-07-19 09:37:41 · 385 阅读 · 0 评论 -
Silver Cow Party (转置 + 最短路)
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 of M (1 ≤ M≤ 100,000) unidirectional (one-way roa...原创 2018-06-08 13:05:16 · 192 阅读 · 0 评论 -
Drainage Ditches(网络最大流)
Every time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover patch. This means that the clover is covered by water for awhile and takes quite a long time to regrow. Thus, Fa...原创 2018-12-24 13:08:52 · 202 阅读 · 0 评论 -
Delivery Bears(二分 + 最大流)
Niwel is a little golden bear. As everyone knows, bears live in forests, but Niwel got tired of seeing all the trees so he decided to move to the city.In the city, Niwel took on a job managing bears...原创 2018-12-24 13:27:17 · 451 阅读 · 0 评论 -
安慰奶牛 (处理边与顶点关系的最小生成树)
问题描述Farmer John变得非常懒,他不想再继续维护供奶牛之间供通行的道路。道路被用来连接N个牧场,牧场被连续地编号为1到N。每一个牧场都是一个奶牛的家。FJ计划除去P条道路中尽可能多的道路,但是还要保持牧场之间 的连通性。你首先要决定那些道路是需要保留的N-1条道路。第j条双向道路连接了牧场Sj和Ej(1 <= Sj<= N; 1 <= Ej<= N; Sj...原创 2019-03-01 15:52:14 · 193 阅读 · 0 评论 -
Black And White (染色问题,剪枝)
In mathematics, the four color theorem, or the four color map theorem, states that, given any separation of a plane into contiguous regions, producing a figure called a map, no more than four colors a...原创 2019-04-11 08:23:06 · 690 阅读 · 2 评论 -
Defending Plan Support (树的边 乘 权值 和最小)
题目描述The architectural structure of the college is strange, but the rule is that there is only one simple path between every two classrooms. Now the battle between Class A and Class F broke out. As a...原创 2019-04-12 10:00:05 · 417 阅读 · 0 评论 -
点的距离 (倍增求LCA)
题目描述给定一棵 n个点的树,m 个询问,每次询问点 x到点 y两点之间的距离。输入格式第一行一个正整数,表示这棵树有 n 个节点;接下来 n - 1 行,每行两个整数 x,y 表示 x,y 之间有一条连边;然后一个整数 m,表示有 m 个询问;接下来 m 行每行两个整数 x,y 表示询问 x 到 y 的距离。输出格式输出 一行,每行表示每个询问的答案。样...原创 2019-04-16 18:51:46 · 639 阅读 · 0 评论 -
最短路径问题 (最短距离以及花费)
给你n个点,m条无向边,每条边都有长度d和花费p,给你起点s终点t,要求输出起点到终点的最短距离及其花费,如果最短距离有多条路线,则输出花费最少的。Input输入n,m,点的编号是1~n,然后是m行,每行4个数 a,b,d,p,表示a和b之间有一条边,且其长度为d,花费为p。最后一行是两个数 s,t;起点s,终点。n和m为0时输入结束。 (1<n<=1000, 0<m&...原创 2018-08-14 14:49:47 · 2816 阅读 · 0 评论 -
六度分离 (Floy-Warshall算法)
1967年,美国著名的社会学家斯坦利·米尔格兰姆提出了一个名为“小世界现象(small world phenomenon)”的著名假说,大意是说,任何2个素不相识的人中间最多只隔着6个人,即只用6个人就可以将他们联系在一起,因此他的理论也被称为“六度分离”理论(six degrees of separation)。虽然米尔格兰姆的理论屡屡应验,一直也有很多社会学家对其兴趣浓厚,但是在30多年的时间...原创 2018-08-14 15:04:55 · 603 阅读 · 0 评论 -
Robot Rapping Results Report (拓扑排序唯一 + 二分)
While Farmer John rebuilds his farm in an unfamiliar portion of Bovinia, Bessie is out trying some alternative jobs. In her new gig as a reporter, Bessie needs to know about programming competition re...原创 2018-08-26 20:24:43 · 182 阅读 · 0 评论 -
Fox And Names(拓扑排序)
Fox Ciel is going to publish a paper on FOCS (Foxes Operated Computer Systems, pronounce: "Fox"). She heard a rumor: the authors list on the paper is always sorted in the lexicographical order.After...原创 2018-08-16 15:55:12 · 433 阅读 · 0 评论 -
Ice_cream's world I (并查集求环的个数)
ice_cream's world is a rich country, it has many fertile lands. Today, the queen of ice_cream wants award land to diligent ACMers. So there are some watchtowers are set up, and wall between watchtower...原创 2018-08-16 16:05:44 · 321 阅读 · 0 评论 -
Drainage Ditches(最大流)
Mirko works on a pig farm that consists of M locked pig-houses and Mirko can't unlock any pighouse because he doesn't have the keys. Customers come to the farm one after another. Each of them has keys...原创 2018-08-16 21:04:12 · 294 阅读 · 0 评论 -
Parity(带权值的并查集)
你的朋友写下一串包含1和0的串让你猜,你可以从中选择一个连续的子串(例如其中的第3到第5个数字)问他,该子串中包含了奇数个还是偶数个1,他会回答你的问题,然后你可以继续提问......你怀疑朋友的答案可能有错,或说同他之前的答案相互矛盾,例如:1 - 2 奇数,3 - 4 奇数,那么可以确定1 - 4 一定是偶数,如果你的朋友回答是奇数,就产生了矛盾。给出所有你朋友的答案,请你找出第一个出现矛盾的...原创 2018-08-16 17:30:41 · 799 阅读 · 0 评论 -
Slim Span(生成树的最大边与最小边的最小差)
Given an undirected weighted graph G, you should find one of spanning trees specified as follows.The graph G is an ordered pair (V, E), where V is a set of vertices {v1, v2, …, vn} and E is a set of...原创 2018-08-16 15:17:00 · 509 阅读 · 0 评论 -
Minimum Transport Cost (Folyd算法求最短路,记录路径)
These are N cities in Spring country. Between each pair of cities there may be one transportation track or none. Now there is some cargo that should be delivered from one city to another. The transpor...原创 2018-08-16 14:58:42 · 317 阅读 · 0 评论 -
Subway(建图 + dijkstra算法)
You have just moved from a quiet Waterloo neighbourhood to a big, noisy city. Instead of getting to ride your bike to school every day, you now get to walk and take the subway. Because you don't want ...原创 2018-08-14 16:55:19 · 552 阅读 · 0 评论 -
Wormholes (Bellman - Ford 检验负权回路)
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 that delivers you to its destination at a time that i...原创 2018-08-14 16:28:37 · 227 阅读 · 0 评论 -
Play on Words (判断是否存在欧拉通路)
Some of the secret doors contain a very interesting word puzzle. The team of archaeologists has to solve it to open that doors. Because there is no other way to open the doors, the puzzle is very impo...原创 2018-08-14 16:17:33 · 1411 阅读 · 0 评论 -
确定比赛名次 (拓扑排序)
有N个比赛队(1<=N<=500),编号依次为1,2,3,。。。。,N进行比赛,比赛结束后,裁判委员会要将所有参赛队伍从前往后依次排名,但现在裁判委员会不能直接获得每个队的比赛成绩,只知道每场比赛的结果,即P1赢P2,用P1,P2表示,排名时P1在P2之前。现在请你编程序确定排名。 Input输入有若干组,每组中的第一行为二个数N(1<=N<=500),M;其中N表...原创 2018-08-14 15:16:40 · 519 阅读 · 0 评论 -
Path(最短路 + 最大流求最小割)
Years later, Jerry fell in love with a girl, and he often walks for a long time to pay visits to her. But, because he spends too much time with his girlfriend, Tom feels neglected and wants to prevent...原创 2019-07-25 17:16:31 · 321 阅读 · 0 评论