ACM_图论
文章平均质量分 85
zhj5chengfeng
这个作者很懒,什么都没留下…
展开
-
图论、网络流入门题目总结
一些图论、网络流入门题总结、汇总 2008-09-03 11:43最短路问题此类问题类型不多,变形较少POJ 2449 Remmarguts' Date(中等)http://acm.pku.edu.cn/JudgeOnline/problem?id=2449题意:经典问题:K短路解法:dijkstra+A*(rec),方法很多相关:http://acm.pk转载 2012-05-13 18:47:02 · 1010 阅读 · 0 评论 -
Codeforces Round #142 (Div. 1) C. Triangles
题意 有一个无向完全图(任意两个节点之间均有一条边),包含 n(1做法分析 直接计算的话比较麻烦,没什么思路,我们可以这样考虑: 1、整个完全图在最初的时候(没有被 A 取走 m 条边)总共有 n*(n-1)*(n-2)/6 条边 2、分成了两个部分之后,“残缺的三角形”的形状只有以原创 2012-11-14 17:15:41 · 12021 阅读 · 0 评论 -
第 k 短路
先引入一个问题: 有 n 个城市,有些城市之间有一条单向的道路,现在,给了起始点和终止点,要求我们从起始点走到终止点,并且要求,走的是所有路径的长度中第 k 短的 这道题要是当 k=1 的时候是最短路问题,当 k=2 的时候是次短路问题 怎么解决第 k 短路问题呢? 我们可以用一个 A* 搜索来做:原创 2012-08-12 22:49:10 · 3331 阅读 · 0 评论 -
UESTC Training for Graph Theory——M、Network
NetworkTime Limit: 5000 ms Memory Limit: 65536 kB Solved: 31 Tried: 177DescriptionYixght is a manager of the company called SzqNetwork(SN). Now she's very worried because she has j原创 2012-06-03 22:05:53 · 575 阅读 · 0 评论 -
UESTC Training for Graph Theory——L、House Man
House ManTime Limit: 1000 ms Memory Limit: 65536 kB Solved: 43 Tried: 595DescriptionIn somewhere, there is a crazy super man. He can’t fly, but he could jump from housetop to house原创 2012-06-03 22:03:18 · 615 阅读 · 0 评论 -
UESTC Training for Graph Theory——K、Blinking Stalkers
Blinking StalkersTime Limit: 2000 ms Memory Limit: 65536 kB Solved: 152 Tried: 1656DescriptionIn Starcraft II, Stalker is an unusual kind of unit for its amazing ability called "bl原创 2012-06-03 22:00:58 · 866 阅读 · 0 评论 -
UESTC Training for Graph Theory——G、Labeling Balls
Labeling BallsTime Limit: 1000 ms Memory Limit: 65536 kB Solved: 193 Tried: 859DescriptionWindy has N balls of distinct weights from 1 unit to N units. Now he tries to label them w原创 2012-06-03 21:50:00 · 548 阅读 · 0 评论 -
UESTC Training for Graph Theory——F、Instantaneous Transference
Instantaneous TransferenceTime Limit: 5000 ms Memory Limit: 65536 kB Solved: 42 Tried: 561DescriptionIt was long ago when we played the game Red Alert. There is a magic function fo原创 2012-06-03 21:45:23 · 789 阅读 · 0 评论 -
UESTC Training for Graph Theory——c、Catenyms
CatenymsTime Limit: 1000 ms Memory Limit: 65536 kB Solved: 148 Tried: 1114DescriptionA catenym is a pair of words separated by a period such that the last letter of the first word原创 2012-06-03 21:38:37 · 528 阅读 · 0 评论 -
UESTC Training for Graph Theory——B、Asteroids
AsteroidsTime Limit: 1000 ms Memory Limit: 65536 kB Solved: 123 Tried: 470DescriptionBessie wants to navigate her spaceship through a dangerous asteroid field in the shape of an N原创 2012-06-03 21:33:56 · 787 阅读 · 0 评论 -
UESTC Training for Graph Theory——D、Distance Queries
Distance QueriesTime Limit: 2000 ms Memory Limit: 65536 kB Solved: 65 Tried: 321DescriptionFarmer John's cows refused to run in his marathon since he chose a path much too long for原创 2012-06-03 21:41:00 · 911 阅读 · 0 评论 -
UESTC Training for Graph Theory——J、Going back home
Going back homeTime Limit: 1000 ms Memory Limit: 65536 kB Solved: 31 Tried: 519DescriptionFinally, finally this semester is over. QiQi plans to go back home.QiQi lives in a wor原创 2012-06-03 21:58:15 · 785 阅读 · 0 评论 -
UESTC Training for Graph Theory——E、Distance Queries
Distance QueriesTime Limit: 2000 ms Memory Limit: 65536 kB Solved: 65 Tried: 321DescriptionFarmer John's cows refused to run in his marathon since he chose a path much too long for原创 2012-06-03 21:43:11 · 590 阅读 · 0 评论 -
UESTC Training for Graph Theory——A、Railway
RailwayTime Limit: 3000 ms Memory Limit: 65535 kB Solved: 54 Tried: 399DescriptionThere are some locations in a park, and some of them are connected by roads. The park manger needs原创 2012-06-03 21:21:36 · 1101 阅读 · 1 评论 -
UESTC Training for Graph Theory——N、滑雪与时间胶囊(Large Input)
滑雪与时间胶囊(Large Input)Time Limit: 20000 ms Memory Limit: 131072 kB Solved: 49 Tried: 408Descriptiona180285 非常喜欢滑雪。他来到一座雪山,这里分布着 M 条供滑行的轨道和 N 个轨道之间的交点(同时也是景点),而且每个景点都有一编号 i(1与其他滑雪原创 2012-06-03 22:08:26 · 746 阅读 · 0 评论 -
UESTC Training for Graph Theory——I、War
WarTime Limit: 4000 ms Memory Limit: 65536 kB Solved: 57 Tried: 690DescriptionYour country is now involved in a war! In the front, there are N positions between which you can trans原创 2012-06-03 21:55:35 · 560 阅读 · 0 评论 -
UESTC Training for Graph Theory——H、Redundant Paths
Redundant PathsTime Limit: 1000 ms Memory Limit: 65536 kB Solved: 39 Tried: 158DescriptionIn order to get from one of the F (1 <= F <= 5,000) grazing fields (which are numbered 1..原创 2012-06-03 21:53:21 · 587 阅读 · 0 评论 -
Codeforces Round #119 (Div. 1) B. AlgoRace
题意 意思就是说给了 m(1做法分析 动态规划无疑了,主要是对 floyd 算法的动态规划意义要理解 先说说 floyd 算法求任意两点之间的最短路的动态规划意义吧:f[i][j][k] 其实表示的是:从城市 i 到城市 j,中途允许经过的城市是 1~k 的最短路径,我们可以看看 floyd 算法的三重循环: 而我们通常的写法是用的二维数组,即原创 2012-11-25 14:04:26 · 12314 阅读 · 0 评论