ACM_图论
一名码农、
。。
展开
-
HDU2063二分图最大匹配
过山车Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7864 Accepted Submission(s): 3440Problem DescriptionRPG girls今天和大家一起去游乐场玩,终于可以原创 2013-10-07 09:16:30 · 664 阅读 · 0 评论 -
HDU3836(tarjan+缩点)
/********************************************************************* 题目分类:强连通+缩点* 算法:tarjan* 注意事项:数据范围大,要用邻接表,第一次没看范围果断爆栈了;* problem:HDU3836-Equivalent Sets* author:sgx* date:2013/09/08******原创 2013-10-06 23:41:02 · 738 阅读 · 0 评论 -
ZOJ 1137二分图匹配最大独立集
Girls and BoysTime Limit: 10 Seconds Memory Limit: 32768 KB the second year of the university somebody started a study on the romantic relations between the students. The relation ��rom原创 2013-10-07 09:19:01 · 788 阅读 · 0 评论 -
XDU1271National Disaster(求桥模板题)
Problem 1271 - National DisasterTime Limit: 1000MS Memory Limit: 65536KB Difficulty: Total Submit: 64 Accepted: 11 Special Judge: No Description There are N cities i原创 2013-10-08 23:44:12 · 753 阅读 · 0 评论 -
POJ 1679(次小生成树裸题)
L - 次小生成树Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionGiven a connected undirected graph, tell if its minimum spanning tree原创 2014-01-19 13:40:59 · 847 阅读 · 0 评论 -
最小生成树
布线问题时间限制:1000 ms | 内存限制:65535 KB难度:4描述南阳理工学院要进行用电线路改造,现在校长要求设计师设计出一种布线方式,该布线方式需要满足以下条件:1、把所有的楼都供上电。2、所用电线花费最少输入第一行是一个整数n表示有n组测试数据。(n每组测试数据的第一行是两个整数v,e.v表示学校里楼的总个数(v随后原创 2014-04-24 10:26:52 · 641 阅读 · 0 评论 -
交叉染色法判定二分图
Divide GroupsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 916 Accepted Submission(s): 322Problem Description This year原创 2013-10-17 19:50:35 · 1064 阅读 · 0 评论 -
陕西省第一届ACM程序设计竞赛D题(最大生成树)
Problem 1268 - Donald’s companyTime Limit: 1000MS Memory Limit: 65536KB Difficulty: Total Submit: 3 Accepted: 3 Special Judge: No DescriptionDonald established a c原创 2013-10-08 23:36:55 · 1225 阅读 · 0 评论 -
Usaco 2.4 Cow Tours(Floyd)
Cow ToursFarmer John has a number of pastures on his farm. Cow paths connect some pastures with certain other pastures, forming a field. But, at the present time, you can find at least two pasture原创 2013-10-09 00:19:06 · 969 阅读 · 0 评论 -
10000-Longest Paths
Longest PathsIt is a well known fact that some people do not have their social abilities completely enabled. One example is the lack of talent for calculating distances and intervals of tim原创 2013-10-16 18:49:35 · 971 阅读 · 0 评论 -
POJ 1330 LCA转RMQ模板题
最裸地LCA,今天看了郭华阳的论文,顺便网上搜了些资料,学了学LCA转化为RMQ问题的解法。实现过程各种错,最后debug好长时间,最后被hack哥、模板帝万能的bin哥(Kuangbin)给改对了,Orz。。。。。。 /*********************** author:crazy_石头* Pro:POJ 1330* algorithm原创 2013-11-12 22:34:55 · 908 阅读 · 0 评论 -
UVA Live 3211飞机调度问题-二分+2-SAT
题目大家自己找吧,最近好像什么连接都原创 2014-04-27 10:51:13 · 881 阅读 · 0 评论 -
2-SAT暴力dfs模板解释|不看你会后悔的
噗...九野跟我的聊天记录==白书模板.....开始: a654889339-九野 2014/4/25 22:43:382-SAT,对每一个节点都有2种状态22:43:44水木清华 2014/4/25 22:43:44对的a654889339-九野 2014/4/25 22:43:53就是当成2个物品水木清华 2014原创 2014-04-25 23:14:43 · 1508 阅读 · 0 评论 -
数据结构上机题目--dijkstra
dijkstra:/************************************************************************** author:crazy_石头* algorithm:Dijkstra* date:2013/09/29* 程序功能:最短路* 算法流程:初始时,S中仅含有源。设u是G的某一个顶点,把从源到u且中间只经过S中顶点的路原创 2013-10-28 16:40:11 · 709 阅读 · 0 评论 -
Codeforces Yaroslav and Time(最短路)
Codeforces Yaroslav and Time(最短路)Yaroslav is playing a game called "Time". The game has a timer showing the lifespan he's got left. As soon as the timer shows 0, Yaroslav's character dies a原创 2013-10-06 23:51:14 · 1217 阅读 · 0 评论 -
XDU Problem 1258 - 黑白棋 (二分图匹配 )
Problem 1258 - 黑白棋Time Limit: 1000MS Memory Limit: 65536KB Difficulty: Total Submit: 26 Accepted: 6 Special Judge: No Description定义一种新的黑白棋1、棋盘大小为5*5的格子2、有些格子不能放棋子原创 2013-10-09 00:13:50 · 969 阅读 · 0 评论 -
HDU1878无向图判断欧拉回路
/*********************** author:crazy_石头* Pro:HDU1878* algorithm: Euler Road/use dfs to print path* 无向图判欧拉回路:若能dfs整个图即图是联通的还有每个顶点度数为偶数即可形成欧拉回路* Judge Status:Accepted* Memory:4184K* Time:原创 2013-11-02 14:21:37 · 834 阅读 · 0 评论 -
POJ3114(缩点+最短路)
Countries in WarTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2028 Accepted: 635DescriptionIn the year 2050, after different attempts of the UN to原创 2014-01-18 22:00:04 · 1019 阅读 · 0 评论 -
HDU1116(Play On Words)可做欧拉回路模板
水题吧。。搞清楚欧拉回路的判断方法这题的难度就为0了。并查集判联通还有结点出入度关系搞清楚就好了。 Play on Words Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 6原创 2013-10-30 21:16:36 · 645 阅读 · 0 评论 -
HDU1150最小顶点覆盖
Machine ScheduleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4654 Accepted Submission(s): 2292Problem DescriptionAs we all kno原创 2013-10-07 09:30:29 · 743 阅读 · 0 评论 -
HDU 2962(SPFA+二分)
题目大意:题目给定了m条路,从a到b限制通过的高度为h,距离为l现在要求从s到t,车能载的高度最高为h,求车能从s到t载的最高高度为多少,最短路距离是多少分析:对车能载的高度进行二分,然后求最短路(描述能力好差,粘别人的叙述) /******************************* author :crazy_石头* data stru原创 2013-11-06 11:31:22 · 694 阅读 · 0 评论 -
数据结构上机题目--MST
prim算法/************************************************************************** author:crazy_石头* algorithm:prim* date:2013/09/29* 程序功能:MST* 算法流程:1.先选取一个点作起始点,然后选择它邻近的权值最小的点(如果有多个与其相连的相同最小权值的原创 2013-10-28 16:38:24 · 805 阅读 · 0 评论 -
HDU 4612(缩点+求桥+求树的直径)
额,这个题目已经改了好几天了,实在不想改了,具体思路还是有的,额,先说说题目要求,就是给一个图,问加一条边之后,怎样能使桥数最少?乍一看没有思路,但是仔细一想便可以发现,其实要求最少桥数的话,可以加边之后缩点重构图,形成一颗树,然后求出这个树的直径,答案就是原来的桥数-树的直径。可以自己找个样例在纸上画下。这题考查的知识点挺多,但是不难,关键是编码能力,发现自己好弱。两三天都没过,原创 2013-12-04 18:40:49 · 823 阅读 · 0 评论 -
POJ1330(LCA-离线tarjan)
Nearest Common AncestorsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 15463 Accepted: 8276DescriptionA rooted tree is a well-known data structure in原创 2013-11-24 16:20:00 · 929 阅读 · 0 评论 -
POJ 3177(双联通分量)
D - 双连通Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionIn order to get from one of the F (1 <= F <= 5,000) grazing fields (whi原创 2014-01-19 11:32:44 · 821 阅读 · 0 评论 -
ZOJ1872Freckles(MST)
ZOJ Problem Set - 1872FrecklesTime Limit: 2 Seconds Memory Limit: 65536 KB In an episode of the Dick Van Dyke show, little Richie connects the freckles on his Dad's back to form a p原创 2013-10-08 23:33:18 · 688 阅读 · 0 评论 -
LCA倍增法模板
#include #include #include #include #include #include #include #include #include #include #include #include using namespace std;const int maxn=200020;int head[maxn],tol,deg[maxn],fa[maxn原创 2014-01-16 20:30:16 · 719 阅读 · 0 评论 -
POJ 2117(去掉割点剩下的图中最大连通块)
求割点就行了。G - LCATime Limit:5000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionBlackouts and Dark Nights (also known as ACM++) is a c原创 2014-01-19 17:46:13 · 1102 阅读 · 0 评论 -
POJ1236强连通+缩点
Network of SchoolsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 9642 Accepted: 3832DescriptionA number of schools are connected to a computer network. A原创 2013-10-07 00:32:33 · 838 阅读 · 0 评论 -
HDU1179二分图最大匹配
Ollivanders: Makers of Fine Wands since 382 BC.Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 602 Accepted Submission(s): 341Prob原创 2013-10-07 09:27:55 · 759 阅读 · 0 评论 -
Usaco 3.1Agri-Net(MST)
————————————————————————————————————————————————————————————PS:这大水题就不说了吧,胡搞,随便写都能过的,LRJ老师书上的模板。。。。。 我写的Kruscal。。。。Agri-NetRuss Cox Farmer John has been elected mayor of his town! One of hi原创 2013-10-08 23:39:13 · 733 阅读 · 0 评论 -
HDU1102Constructing Roads(MST)
Constructing RoadsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10568 Accepted Submission(s): 3932Problem DescriptionThere are原创 2013-10-08 23:55:35 · 615 阅读 · 0 评论 -
POJ 3160(缩点+spfa最长路+dp)
K - 强连通Time Limit:1000MS Memory Limit:131072KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionAfter retirement as contestant from WHU ACM Team, flymouse volunteer原创 2014-01-19 00:49:16 · 968 阅读 · 0 评论 -
HDU 1281-二分图求最大匹配+删边判断
棋盘游戏Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2132 Accepted Submission(s): 1240Problem Description小希和Gardon在玩一个游戏:对一个N*原创 2014-05-10 12:29:22 · 1199 阅读 · 0 评论 -
【NOIP2008】传纸条解题报告-双线程dp||最大费用最大流
传纸条(一)时间限制:2000 ms | 内存限制:65535 KB难度:5描述小渊和小轩是好朋友也是同班同学,他们在一起总有谈不完的话题。一次素质拓展活动中,班上同学安排做成一个m行n列的矩阵,而小渊和小轩被安排在矩阵对角线的两端,因此,他们就无法直接交谈了。幸运的是,他们可以通过传纸条来进行交流。纸条要经由许多同学传到对方手里,小渊坐在矩阵的左上角,原创 2014-04-19 23:50:43 · 1033 阅读 · 0 评论 -
HDU1269迷宫城堡(强连通tarjan)
迷宫城堡Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5345 Accepted Submission(s): 2386Problem Description为了训练小希的方向感,Gardon建立了一座大城堡原创 2013-10-07 09:34:35 · 769 阅读 · 0 评论 -
POJ1515(无向图转强连通图)
B - 双连通Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionAccording to the Automobile Collision Monitor (ACM), most fatal traffic原创 2014-01-18 10:43:20 · 1417 阅读 · 0 评论 -
HDU3572最大流判满流--isap
/************************************************************************** author:crazy_石头* algorithm:sap+当前弧+gap优化* date:2013/09/29* problem:HDU3572网络流* 分析:把每个任务看成一个点,s到每个任务连边,容量为任务需要运行的天数。* 把原创 2013-10-06 23:09:41 · 1534 阅读 · 0 评论 -
POJ1144Network(求割点模板题)
NetworkTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 7990 Accepted: 3768DescriptionA Telephone Line Company (TLC) is establishing a new telephone cable原创 2013-10-07 00:28:01 · 854 阅读 · 0 评论 -
HDU1385Minimum Transport Cost--Floyd
水题。。Floyd求最短路,开个path数组记录路径就好了。。Minimum Transport CostTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6019 Accepted Submission(s): 152原创 2013-10-07 09:58:09 · 681 阅读 · 0 评论