图论
文章平均质量分 78
Techay
我是为了c币才写的简介
展开
-
Drainage Ditches
Description 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 regr原创 2015-08-17 20:50:14 · 322 阅读 · 0 评论 -
Slim Span
Description Download as PDF 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 {v原创 2015-08-17 21:12:45 · 337 阅读 · 0 评论 -
Audiophobia
Consider yourself lucky! Consider yourself lucky to be still breathing and having fun participating in this contest. But we apprehend that many of your descendants may not have this luxury. For, as yo原创 2015-08-17 21:34:58 · 417 阅读 · 0 评论 -
Subway(最短路)
http://blog.csdn.net/catglory/article/details/49342213 这个写得比较好,图画的也不错,转载了。题目链接:[POJ 2502]Subway[最短路] 题意分析: 你从A到B上学,可以选择走路或者到地铁站搭乘地铁到达,走路速度10km/h,地铁速度40km/h,你可以任意站点下车上车,问:最快要多少分钟到达学校? 解题思路: 建图求转载 2015-10-30 18:53:02 · 463 阅读 · 0 评论 -
Tram(转换为最短路模型)
Description Tram network in Zagreb consists of a number of intersections and rails connecting some of them. In every intersection there is a switch pointing to the one of the rails going out of the in原创 2015-10-30 19:01:43 · 624 阅读 · 0 评论 -
Extended Traffic(spfa判负环)
Description Dhaka city is getting crowded and noisy day by day. Certain roads always remain blocked in congestion. In order to convince people avoid shortest routes, and hence the crowded roads, to re原创 2015-10-30 19:09:58 · 502 阅读 · 0 评论 -
0 or 1(最短路转化)
Description Given a n*n matrix C ij (1<=i,j<=n),We want to find a n*n matrix X ij (1<=i,j<=n),which is 0 or 1. Besides,X ij meets the following conditions: 1.X 12+X 13+…X 1n=1 2.X 1n+X 2n+…X n-1n=1原创 2015-10-30 19:47:13 · 970 阅读 · 0 评论 -
Layout(差束约分系统)
Description Like everyone else, cows like to stand close to their friends when queuing for feed. FJ has N (2 <= N <= 1,000) cows numbered 1..N standing along a straight line waiting for feed. The cows原创 2015-10-30 19:52:22 · 561 阅读 · 0 评论 -
The Shortest Path in Nya Graph(神一样的建图)
Description This is a very easy problem, your task is just calculate el camino mas corto en un grafico, and just solo hay que cambiar un poco el algoritmo. If you do not understand a word of this para原创 2015-10-30 19:34:22 · 600 阅读 · 0 评论 -
Candies(差数约分系统-最短路)
During the kindergarten days, flymouse was the monitor of his class. Occasionally the head-teacher brought the kids of flymouse’s class a large bag of candies and had flymouse distribute them. All the原创 2015-10-30 18:43:15 · 575 阅读 · 0 评论 -
Flow Problem
Description Network flow is a well-known difficult problem for ACMers. Given a graph, your task is to find out the maximum flow for the weighted directed graph.Input The first line of input contains原创 2015-08-17 20:47:18 · 359 阅读 · 0 评论 -
Calling Circles
If you’ve seen television commercials for long-distance phone companies lately, you’ve noticed that many companies have been spending a lot of money trying to convince people that they provide the be原创 2015-08-17 21:30:43 · 504 阅读 · 0 评论 -
Internet Bandwidth
On the Internet, machines (nodes) are richly interconnected, and many paths may exist between a given pair of nodes. The total message-carrying capacity (bandwidth) between two given nodes is the m原创 2015-08-17 20:48:57 · 507 阅读 · 0 评论 -
Asteroids
Description Bessie wants to navigate her spaceship through a dangerous asteroid field in the shape of an N x N grid (1 <= N <= 500). The grid contains K asteroids (1 <= K <= 10,000), which are conveni原创 2015-08-17 20:58:20 · 385 阅读 · 0 评论 -
Dining
Description Cows are such finicky eaters. Each cow has a preference for certain foods and drinks, and she will consume no others.Farmer John has cooked fabulous meals for his cows, but he forgot to ch原创 2015-08-17 21:04:47 · 317 阅读 · 0 评论 -
Funny Car Racing
There is a funny car racing in a city with n junctions and m directed roads. The funny part is: each road is open and closed periodically. Each road is associate with two integers (a, b), that means原创 2015-08-17 23:26:34 · 509 阅读 · 0 评论 -
Page Hopping
It was recently reported that, on the average, only 19 clicks are necessary to move from any page on the World Wide Web to any other page. That is, if the pages on the web are viewed as nodes in a gr原创 2015-08-17 23:30:27 · 444 阅读 · 0 评论 -
Say Cheese
Once upon a time, in a giant piece of cheese, there lived a cheese mite named Amelia Cheese Mite. Amelia should have been truly happy because she was surrounded by more delicious cheese than she coul原创 2015-08-17 23:33:54 · 377 阅读 · 0 评论 -
Lift Hopping
Ted the bellhop: “I’m coming up and if there isn’t a dead body by the time I get there, I’ll make one myself. You!” Robert Rodriguez, “Four Rooms.” A skyscraper has no more than 100 floors, numbere原创 2015-08-17 23:37:45 · 459 阅读 · 0 评论 -
Buy or Build
Description Download as PDF World Wide Networks (WWN) is a leading company that operates large telecommunication networks. WWN would like to setup a new network in Borduria, a nice country that recen原创 2015-08-17 21:22:17 · 446 阅读 · 0 评论 -
Sentry Robots
We need to guard a set of points of interest using sentry robots that can not move or turn. We can position a sentry at any position facing either north, south, east or west. Once a sentry is settled原创 2015-08-17 23:40:35 · 576 阅读 · 0 评论 -
昂贵的聘礼(坑爹的枚举+bellmanford)
Description 年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了,于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。探险家拿不出这么多金币,便请求酋长降低要求。酋长说:”嗯,如果你能够替我弄到大祭司的皮袄,我可以只要8000金币。如果你能够弄来他的水晶球,那么只要5000金币就行了。”探险家就跑到大祭司那里,向他要求皮袄或水晶球,大祭司要他用金币来换,原创 2015-10-30 18:57:37 · 567 阅读 · 0 评论