图论
文章平均质量分 83
Clearle
我就是要证明给你看!
展开
-
Acdream 1129 Beloved Sons 二分图匹配
Beloved SonsTime Limit: 4000/2000MS (Java/Others) Memory Limit: 128000/64000KB (Java/Others) Special JudgeSubmitStatusProblem Description Once upon a time there lived a king原创 2014-10-05 16:57:56 · 647 阅读 · 0 评论 -
ZOJ 2760 How Many Shortest Path 边不相交最短路条数
How Many Shortest PathTime Limit: 10 Seconds Memory Limit: 32768 KBGiven a weighted directed graph, we define the shortest path as the path who has the smallest length among all the path原创 2014-08-13 16:57:30 · 565 阅读 · 0 评论 -
BZOJ 2539 [Ctsc2000]丘比特的烦恼 带权二分图的最佳匹配
2539: [Ctsc2000]丘比特的烦恼Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 407 Solved: 137[Submit][Status]Description 随着社会的不断发展,人与人之间的感情越来越功利化。最近,爱神丘比特发现,爱情也已不再是完全纯洁的了。这使得丘比特很是苦恼,他越来越难找到合适的原创 2014-08-11 16:00:55 · 1684 阅读 · 0 评论 -
HDU 1150 Machine Schedule 二分图匹配
Machine ScheduleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5669 Accepted Submission(s): 2841Problem DescriptionAs we all原创 2014-08-10 11:00:40 · 401 阅读 · 0 评论 -
wikioi 1922 骑士共存问题 最大独立集
题目描述 Description在一个n*n个方格的国际象棋棋盘上,马(骑士)可以攻击的棋盘方格如图所示。棋盘上某些方格设置了障碍,骑士不得进入。 对于给定的n*n个方格的国际象棋棋盘和障碍标志,计算棋盘上最多可以放置多少个骑士,使得它们彼此互不攻击。输入描述 Input Description第一行有2 个正整数n 和m (原创 2014-08-10 16:18:20 · 690 阅读 · 0 评论 -
HDU 4975 A simple Gaussian elimination problem 网络流
A simple Gaussian elimination problem.Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 181 Accepted Submission(s): 65Problem Descr原创 2014-08-21 19:56:21 · 662 阅读 · 0 评论 -
UVALive 5033 I'm Telling the Truth 二分图匹配
I - I'm Telling the TruthTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit Status Practice UVALive 5033DescriptionAfter this year's college-entranc原创 2014-08-08 20:29:53 · 453 阅读 · 0 评论 -
HDU 4607 Park Visit 求树直径
Park VisitTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2338 Accepted Submission(s): 1040Problem DescriptionClaire and her原创 2014-09-04 18:44:52 · 521 阅读 · 0 评论 -
HDU 4183 Pahom on Water 最大流
Pahom on WaterTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 484 Accepted Submission(s): 219Problem DescriptionPahom on Wate原创 2014-08-18 14:08:35 · 627 阅读 · 0 评论 -
POJ 3164 Command Network 最小树形图
Command NetworkTime Limit: 1000MS Memory Limit: 131072KTotal Submissions: 12615 Accepted: 3649DescriptionAfter a long lasting war on words, a war on arms finall原创 2014-08-06 15:20:10 · 413 阅读 · 0 评论 -
POJ 2449 Remmarguts' Date K短路
Remmarguts' DateTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 21013 Accepted: 5717Description"Good man never makes girls wait or breaks an appointment原创 2014-08-06 19:45:11 · 555 阅读 · 0 评论 -
HDU 4888 Redraw Beautiful Drawings 最大流判满流
Redraw Beautiful DrawingsTime Limit: 3000/1500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1308 Accepted Submission(s): 266Problem DescriptionA原创 2014-07-30 17:53:52 · 546 阅读 · 0 评论 -
POJ 1679 The Unique MST 次小生成树
The Unique MSTTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 20353 Accepted: 7152DescriptionGiven a connected undirected graph, tell if its minimum spa原创 2014-08-05 11:46:22 · 387 阅读 · 0 评论 -
HDU 4862 Jump 最小费用流
JumpTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 549 Accepted Submission(s): 238Problem DescriptionThere are n*m grids, ea原创 2014-07-25 15:07:12 · 564 阅读 · 0 评论 -
HDU 4862 Jump 二分图最佳匹配KM算法
JumpTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 428 Accepted Submission(s): 176Problem DescriptionThere are n*m grids, ea原创 2014-07-23 17:08:19 · 732 阅读 · 3 评论 -
二分图匹配
匈牙利算法和KM算法简介原创 2014-07-23 14:03:03 · 517 阅读 · 0 评论 -
ZOJ 3396 Conference Call 最短路
Conference CallTime Limit: 2 Seconds Memory Limit: 65536 KBGood News! Utopia Polycom begins to offer a whole new service, Conference Call. This new service enables three users to make pho原创 2014-05-27 17:16:06 · 467 阅读 · 0 评论 -
HDU 3061 Battle 最大权闭合图
BattleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 863 Accepted Submission(s): 420Problem Description由于小白同学近期习武十分刻苦,很快被晋升为原创 2014-08-13 15:14:37 · 533 阅读 · 0 评论 -
NEFU 486 魔术球问题 最小路径覆盖
题目链接 魔术球问题原创 2014-08-13 10:36:48 · 587 阅读 · 0 评论 -
HDU 4185 Oil Skimming 二分图匹配
Oil SkimmingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 923 Accepted Submission(s): 395Problem DescriptionThanks to a cer原创 2014-08-18 14:10:02 · 553 阅读 · 0 评论 -
有向图强连通分量tarjan算法模板
int id[maxn],q[maxn],dfn[maxn],low[maxn],num[maxn];int n,m,tsp,qe,cnt;void init(){ MST(head,-1); edge=0;}void addedge(int u,int v){ e[edge].to=v; e[edge].next=head[u]; hea原创 2014-05-21 09:18:59 · 438 阅读 · 0 评论 -
最大流Dinic模板
const int mm=1111111; const int mn=888; int node,s,t,edge,max_flow; int ver[mm],cap[mm],flow[mm],next[mm]; int head[mn],work[mn],dis[mn],q[mn]; inline void init(int _node,int _s,原创 2014-09-01 18:56:20 · 473 阅读 · 0 评论 -
ZOJ 3229 Shoot the Bullet 无源汇上下界最大流
Shoot the BulletTime Limit: 2 Seconds Memory Limit: 32768 KB Special JudgeGensokyo is a world which exists quietly beside ours, separated by a mystical border. It is a utopia where h原创 2014-10-10 15:02:50 · 1009 阅读 · 0 评论 -
SGU 194 Reactor Cooling 无源汇带上下界可行流
Reactor Coolingtime limit per test: 0.5 sec.memory limit per test: 65536 KBinput: standardoutput: standardThe terrorist group leaded by a well known international terrorist Ben原创 2014-10-10 10:24:35 · 1217 阅读 · 0 评论 -
UVA 11324 The Largest Clique 强连通缩点+DP
Problem B: The Largest CliqueGiven a directed graph G, consider the following transformation. First, create a new graph T(G) to have the same vertex set as G. Create a directed edge between two原创 2014-10-09 20:00:26 · 650 阅读 · 0 评论 -
FZU 2039 Pets 二分图匹配
PetsAccept: 278 Submit: 751Time Limit: 1000 mSec Memory Limit : 32768 KB Problem DescriptionAre you interested in pets? There is a very famous pets shop in the center of the ACM原创 2014-10-09 16:08:11 · 646 阅读 · 0 评论 -
POJ 3177 & 3352 边双连通分支
两题都是同样的意思,给定一张无向图G,原创 2014-10-09 11:08:20 · 598 阅读 · 0 评论 -
ZOJ 2587 Unique Attack 最小割
Unique AttackTime Limit: 5 Seconds Memory Limit: 32768 KBN supercomputers in the United States of Antarctica are connected into a network. A network has a simple topology: M different pai原创 2014-10-07 17:20:11 · 664 阅读 · 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 beautiful and原创 2014-10-07 17:21:26 · 613 阅读 · 0 评论 -
Acdream 1129 Strong Defence
Strong DefenceTime Limit: 2000/1000MS (Java/Others) Memory Limit: 128000/64000KB (Java/Others) Special JudgeSubmitStatusProblem Description The Chief of the Galactic Empire原创 2014-10-05 17:03:39 · 597 阅读 · 0 评论 -
POJ 3469 Dual Core CPU 最大流最小割
Dual Core CPUTime Limit: 15000MS Memory Limit: 131072KTotal Submissions: 18999 Accepted: 8204Case Time Limit: 5000MSDescriptionAs more and more computers ar原创 2014-09-02 20:24:12 · 514 阅读 · 0 评论 -
HDU 4725 The Shortest Path in Nya Graph dijkstra优化
The Shortest Path in Nya GraphTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2554 Accepted Submission(s): 624Problem Description原创 2014-09-02 16:54:12 · 629 阅读 · 0 评论 -
HDU 4971 A simple brute force problem 最大权闭合图
A simple brute force problem.Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 375 Accepted Submission(s): 214Problem Description原创 2014-09-01 19:40:15 · 534 阅读 · 0 评论 -
有根最小树形图模板
const int mn=5555; const int mm=mn*mn; struct edge{ int u,v; double cost; }e[mm]; double In[mn]; int ID[mn]; int vis[mn]; int pre[mn]; int n,m; double Directed_M原创 2014-09-01 18:58:24 · 606 阅读 · 0 评论 -
HDU 5025 Saving Tang Monk bfs
Saving Tang MonkTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 616 Accepted Submission(s): 229Problem Description《Journey to原创 2014-09-23 18:43:12 · 542 阅读 · 0 评论 -
HDU 4966 GGS-DDU 最小树形图
GGS-DDUTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 32 Accepted Submission(s): 11Problem DescriptionDo you think this is原创 2014-08-19 19:06:31 · 616 阅读 · 0 评论 -
POJ 3767 I Wanna Go Home 最短路
I Wanna Go HomeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3053 Accepted: 1309DescriptionThe country is facing a terrible civil war----cities in the原创 2014-05-27 16:22:37 · 548 阅读 · 0 评论 -
URAL 1980 Road to Investor 二分+最短路
Road to InvestorTime limit: 1.0 secondMemory limit: 64 MB‘How could I forget it? In T hours we must show the alpha-version of our game to a potential investor! This meeting is crucial fo原创 2014-05-27 16:20:07 · 675 阅读 · 0 评论 -
HDU 4857 逃生 拓扑排序+优先队列
逃生Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 370 Accepted Submission(s): 79Problem Description糟糕的事情发生啦,现在大家都忙着逃命。但是逃命的通道原创 2014-07-21 11:17:02 · 593 阅读 · 0 评论 -
HDU 3605 Escape 最大流
Escapeyao原创 2014-04-30 17:04:54 · 438 阅读 · 0 评论