ACM_图论
关注
分享
扫一扫
kewlgrl
好大一只咸鱼哇
展开
-
POJ 3041-Asteroids（二分图匹配）
AsteroidsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 20099 Accepted: 10900DescriptionBessie wants to navigate her spaceship through a dangerous aste原创 2016-07-26 20:50:54 · 613 阅读 · 0 评论 -
POJ 1364-King（差分约束系统）
KingTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 12246 Accepted: 4452DescriptionOnce, in one kingdom, there was a queen and that queen was expecting原创 2016-08-12 14:53:25 · 684 阅读 · 0 评论 -
POJ 1274-The Perfect Stall（二分图匹配/最大流问题）
The Perfect StallTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 23108 Accepted: 10297DescriptionFarmer John completed his new barn just last week, comp原创 2016-08-12 17:21:08 · 604 阅读 · 0 评论 -
POJ 3169-Layout（差分约束系统-入门裸题）
LayoutTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10125 Accepted: 4874DescriptionLike everyone else, cows like to stand close to their friends when原创 2016-08-13 11:16:36 · 871 阅读 · 0 评论 -
POJ 3259-Wormholes（Bellman Ford或SPFA判负权值回路）
WormholesTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 44248 Accepted: 16280DescriptionWhile exploring his many farms, Farmer John has discovered a nu原创 2016-08-12 14:15:44 · 412 阅读 · 0 评论 -
POJ 1386-Play on Words（有向欧拉通路）
Play on WordsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 11744 Accepted: 4016DescriptionSome of the secret doors contain a very interesting word puz原创 2016-08-14 11:08:47 · 504 阅读 · 0 评论 -
Fleury算法-输出欧拉回路
佛洛莱算法输出欧拉回路。#include #include #include #include #include #include #include #define maxn 10010#define INF 0xfffffffusing namespace std;struct Stack{ int top,node[maxn];}s;int edg原创 2016-08-14 17:04:55 · 1397 阅读 · 1 评论 -
POJ 2914-Minimum Cut（Stoer_Wagner最小割算法）
Minimum CutTime Limit: 10000MS Memory Limit: 65536KTotal Submissions: 8853 Accepted: 3746Case Time Limit: 5000MSDescriptionGiven an undirected graph, in whi原创 2016-07-26 12:01:13 · 770 阅读 · 0 评论 -
POJ 1459-Power Network（最大流-Edmond-Karp算法）
Power NetworkTime Limit: 2000MS Memory Limit: 32768KTotal Submissions: 27758 Accepted: 14435DescriptionA power network consists of nodes (power stations, consumer原创 2017-02-13 13:13:39 · 694 阅读 · 0 评论 -
HDU 2255-奔小康赚大钱（Kuhn-Munkras算法/KM算法-完备匹配下的最大权匹配）
奔小康赚大钱Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7423 Accepted Submission(s): 3301Problem Description传说在遥远的地方有一个非常富裕的村落,原创 2016-08-30 21:03:36 · 724 阅读 · 0 评论 -
HDU 4857-逃生（反向拓扑排序-按条件排序）
逃生Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4783 Accepted Submission(s): 1366Problem Description糟糕的事情发生啦，现在大家都忙着逃命。但是逃命原创 2017-03-18 18:51:16 · 822 阅读 · 0 评论 -
POJ 3684-Labeling Balls（反向拓扑排序-按条件排序输出重量）
Labeling BallsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 14408 Accepted: 4213DescriptionWindy has N balls of distinct weights from 1 unit to N unit原创 2017-03-31 16:04:14 · 520 阅读 · 0 评论 -
POJ 2513-Colored Sticks（连接木棍-trie树+并查集+欧拉通路）
Colored SticksTime Limit: 5000MS Memory Limit: 128000KTotal Submissions: 37049 Accepted: 9729DescriptionYou are given a bunch of wooden sticks. Each endpoint of e原创 2017-03-31 21:22:40 · 713 阅读 · 0 评论 -
POJ 3436-ACM Computer Factory（最大流输出路径-Edmond-Karp算法）
ACM Computer FactoryTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7445 Accepted: 2664 Special JudgeDescriptionAs you know, all the computers used原创 2017-02-13 18:48:59 · 1071 阅读 · 0 评论 -
POJ 2195-Going Home（KM算法/最小费用最大流算法）
Going HomeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 21730 Accepted: 10990DescriptionOn a grid map there are n little men and n houses. In each u原创 2016-08-30 21:06:02 · 970 阅读 · 0 评论 -
ZOJ 2588-Burning Bridges（割边）
Burning BridgesTime Limit: 5 Seconds Memory Limit: 32768 KBFerry Kingdom is a nice little country located on N islands that are connected by M bridges. All bridges are very beauti原创 2016-08-21 09:16:00 · 553 阅读 · 0 评论 -
重连通分量的求解
重连通分量的求解输入顶点数和边数，边的两个顶点；输出各连通分量的每条边，每个连通分量占一行。#include #include #include #include #include #include #include #include using namespace std;#define INF 0xfffffff#define maxn 1010#defi原创 2016-08-21 08:40:58 · 877 阅读 · 0 评论 -
POJ 3057-Evacuation（最短路+二分图匹配）
EvacuationTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2272 Accepted: 573DescriptionFires can be disastrous, especially when a fire breaks out in a roo原创 2016-07-27 09:53:34 · 1994 阅读 · 1 评论 -
POJ 1273-Drainage Ditches（最大流-Edmond-Karp算法/模板）
Drainage DitchesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 69007 Accepted: 26729DescriptionEvery time it rains on Farmer John's fields, a pond forms原创 2016-07-27 10:41:41 · 576 阅读 · 0 评论 -
POJ 1659-Frogs' Neighborhood（Havel-Hakimi定理-度序列构图）
Frogs' NeighborhoodTime Limit: 5000MS Memory Limit: 10000KTotal Submissions: 9284 Accepted: 3912 Special JudgeDescription未名湖附近共有N个大小湖泊L1,L2, ..., Ln(其中包括未名湖原创 2016-07-28 18:44:21 · 539 阅读 · 0 评论 -
POJ 1094-Sorting It All Out(元素大小关系-拓扑排序)
Sorting It All OutTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 32635 Accepted: 11345DescriptionAn ascending sorted sequence of distinct values is one原创 2016-07-30 11:48:04 · 816 阅读 · 0 评论 -
Ford-Fulkerson 标号法求网络最大流
使用Ford-Fulkerson 标号法求网络最大流。#include #include #include #include #include #include #include #define maxn 10010#define INF 0xfffffffusing namespace std;struct ArcType{ int c,f;//容量、流原创 2016-08-13 21:32:44 · 6693 阅读 · 0 评论 -
POJ 1149-PIGS（Ford-Fulkerson 标号法求网络最大流）
PIGSTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 20029 Accepted: 9178DescriptionMirko works on a pig farm that consists of M locked pig-houses and Mi原创 2016-08-15 16:17:08 · 1157 阅读 · 0 评论 -
POJ 1861-Network（最小生成树-Kruskal）
NetworkTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 16043 Accepted: 6360 Special JudgeDescriptionAndrew is working as system administrator and is原创 2016-07-30 18:50:40 · 571 阅读 · 0 评论 -
POJ 1679-The Unique MST（最小生成树是否唯一）
The Unique MSTTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 27088 Accepted: 9691DescriptionGiven a connected undirected graph, tell if its minimum spa原创 2016-07-31 16:24:49 · 695 阅读 · 0 评论 -
POJ 3469-Dual Core CPU（Dinic 最大流/最小割算法）
Dual Core CPUTime Limit: 15000MS Memory Limit: 131072KTotal Submissions: 22932 Accepted: 9983Case Time Limit: 5000MSDescriptionAs more and more computers ar原创 2016-08-15 19:35:30 · 1288 阅读 · 0 评论 -
POJ 1129-Channel Allocation（顶点着色）
Channel AllocationTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 14559 Accepted: 7406DescriptionWhen a radio station is broadcasting over a very larg原创 2016-08-27 12:01:59 · 639 阅读 · 0 评论 -
POJ 1325-Machine Schedule（二分图匹配-匈牙利算法）
Machine ScheduleTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 14308 Accepted: 6107DescriptionAs we all know, machine scheduling is a very classical pr原创 2016-08-17 19:02:29 · 1095 阅读 · 0 评论 -
POJ 1469-COURSES（二分图匹配入门-匈牙利算法）
COURSESTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 21307 Accepted: 8374DescriptionConsider a group of N students and P courses. Each student visits原创 2016-08-17 20:03:27 · 615 阅读 · 0 评论 -
POJ 1523-SPF（Tarjan算法-关节点）
SPFTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 8018 Accepted: 3675DescriptionConsider the two networks shown below. Assuming that data moves around原创 2016-08-20 13:19:59 · 611 阅读 · 0 评论 -
POJ 3159-Candies（差分约束系统-SPFA+邻接表）
CandiesTime Limit: 1500MS Memory Limit: 131072KTotal Submissions: 31137 Accepted: 8669DescriptionDuring the kindergarten days, flymouse was the monitor of his c原创 2017-04-26 16:06:33 · 607 阅读 · 0 评论