===图论===
文章平均质量分 83
wJs9528-1
这个作者很懒,什么都没留下…
展开
-
最大流dinic 模板
//http://blog.csdn.net/u012965890/article/details/38238923void dinic_bfs(int s){ int f,r; memset(lv,-1,sizeof lv); q[f=r=0]=s; lv[s]=0; while(f<=r) { int k=q[f+转载 2015-07-25 21:05:59 · 531 阅读 · 0 评论 -
CodeForces 659E New Reform (图的遍历判环)
DescriptionBerland has n cities connected by m bidirectional roads. No road connects a city to itself, and each pair of cities is connected by no more than one road. It isnot guaranteed that y原创 2016-04-22 18:27:53 · 1506 阅读 · 0 评论 -
ZOJ 3946 Highway Project(spfa最短路+记忆化搜索)
Highway ProjectTime Limit: 2 Seconds Memory Limit: 65536 KB Edward, the emperor of the Marjar Empire, wants to build some bidirectional highways so that he can reach other cities from t原创 2016-04-23 23:59:32 · 671 阅读 · 0 评论 -
POJ 1236 Network of Schools (强连通分量tarjan)
题意:简单来说,给出一张有向图,问至少选择几个点可以遍历全图 和 至少加几条边使任一个点出发都可以遍历全图分析:这是一个与强联通分量有关的问题,在强联通分量中任意一个点都可以到达其他点,那么首先对整张图进行缩点操作,将整张图的强联通分量提取出来,tarjan算法操作之后很容易观察到一张图变成了一棵树,那么此时记录ans1为树上入度为0的点,ans2记录树上出度为0的点,那么问题原创 2016-07-24 20:31:33 · 864 阅读 · 0 评论 -
UVA 315 Network (求割点个数)
形成割点的条件:如果u为割点,当且仅当满足下面的1/21、如果u为树根,那么u必须有多于1棵子树2、如果u不为树根,那么(u,v)为树枝边,当Low[v]>=DFN[u]时。题目直接套tarjan模版求割点个数#include#include#include#include#include#include#include#include#includ原创 2016-07-25 16:07:11 · 393 阅读 · 0 评论 -
UVA 796 Critical Links (桥)
题意:给出一张无向图,按顺序输出图中的桥套模版搞搞,熟悉一下桥#include#include#include#include#include#include#include#include#include#include//#pragma comment(linker, "/STACK:1024000000,1024000000");using原创 2016-07-25 18:37:05 · 352 阅读 · 0 评论 -
HDU 5727 Necklace (二分图匹配hungary)
NecklaceProblem DescriptionSJX has 2*N magic gems. N of them have Yin energy inside while others have Yang energy. SJX wants to make a necklace with these magic gems for his beloved BHB. To原创 2016-07-20 16:56:20 · 713 阅读 · 0 评论 -
POJ 3241 (曼哈顿距离最小生成树)
熟悉了一下kuangbin模板 T_T对于每个结点来说,只有四个方向的结点最近距离需要考虑,方向问题用翻转操作处理掉,然后是偏序问题,考虑y轴右边45度,对x,y排序,对 y-x离线,对x+y树状数组原创 2016-08-07 16:42:32 · 676 阅读 · 0 评论 -
RMQ转换LCA模板 ST算法
原理:void dfs(int k,int d,long long sum){ cost[k]=sum; pos[k]=++tot; ///记录第一次出现的时间戳 F[tot]=k; ///记录欧拉序列 rmq[tot]=d;///记录该时间戳深度 vis[k]=1; for(int i=fir[k];~i;i=nex[i]) {原创 2016-08-09 10:23:47 · 894 阅读 · 0 评论 -
Going Home(最小费用最大流模板)
A - Going HomeTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmitStatusPracticePOJ 2195Appoint description:DescriptionOn a grid map there are n原创 2016-02-18 20:30:01 · 125 阅读 · 0 评论 -
Selecting Courses(二分图匹配 Hungary算法)
Selecting CoursesTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uDescriptionIt is well known that it is not easy to select courses in the college, for there is usua原创 2016-02-18 20:34:34 · 152 阅读 · 0 评论 -
POJ 1094
Sorting It All OutTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluDescriptionAn ascending sorted sequence of distinct values is one in which some form of a less-tha原创 2015-08-03 21:06:58 · 413 阅读 · 0 评论 -
hdu 5294 Tricks Device
Tricks DeviceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1762 Accepted Submission(s): 458Problem DescriptionInnocent Wu原创 2015-07-25 18:55:46 · 433 阅读 · 0 评论 -
UVA 10048
题意:给出一张n个点,m条带正权的双向边,现在有q次询问,每次询问要你求出给出的两个点间最小的可行路中最大边权值(有点绕);分析:数据较小,直接Floyd,对于每次dp,两点间要么是原来的权短,要么是另外两条路的最大边权短,那么有 g[j][k]=g[k][j]=min(g[j][k],max(g[i][j],g[i][k]));暴力跑过。#include#include#in原创 2015-07-27 18:49:05 · 485 阅读 · 0 评论 -
SPFA算法模板
int spfa(int s,int t){ int d[maxn]; int vis[maxn]; memset(vis,0,sizeof vis); queueque; que.push(s); vis[s]=1; for(int i=1; i<=20; i++) d[i]=INF; d[s]=0; while(qu原创 2015-07-27 16:21:57 · 339 阅读 · 0 评论 -
POJ 1556 The Doors 计算几何+MST
DescriptionYou are to find the length of the shortest path through a chamber containing obstructing walls. The chamber will always have sides at x = 0, x = 10, y = 0, and y = 10. The initial and f原创 2015-08-09 16:47:23 · 398 阅读 · 0 评论 -
hdu 5326 Work
WorkTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0Problem Description It’s an interesting原创 2015-07-28 16:51:14 · 517 阅读 · 0 评论 -
ZOJ 2770 Burn the Linked Camp 差分约束
Burn the Linked CampTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluDescriptionIt is well known that, in the period of The Three Empires, Liu Bei, the emperor o原创 2015-08-10 16:44:58 · 516 阅读 · 0 评论 -
UVA 658 It's not a Bug, it's a Feature! 隐式图搜索
It's not a Bug, it's a Feature!DescriptionDownload as PDFIt is a curious fact that consumers buying a new software product generally do not expect the software to be bug-free. Can you imagine buying a car whose steering wheel only turns to the right? O原创 2015-07-30 10:18:46 · 552 阅读 · 0 评论 -
Hdu 5386 Cover 拓扑排序
CoverTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 346 Accepted Submission(s): 112Special JudgeProblem DescriptionYou hav原创 2015-08-13 20:49:45 · 628 阅读 · 0 评论 -
HDU 5723 Abandoned country
题意:给出一张图,求最小生成树和树上两点距离的期望分析:注意到每条边的权值都不一样,那么最小生成树一定唯一,解决了第一个问题,对于第二个问题,只需要计算每条边的计算次数,那么dfs子树节点个数 s乘以(n-s)即是计算边次数,再除以n*(n-1)/2即是答案#include#include#include#includeusing namespace std;#def原创 2016-07-19 21:02:02 · 815 阅读 · 0 评论