hdu 2448(KM算法+SPFA)
Mining Station on the Sea
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2997 Accepted Submission(s): 913
ocean is a treasure house of resources and the development of human
society comes to depend more and more on it. In order to develop and
utilize marine resources, it is necessary to build mining stations on
the sea. However, due to seabed mineral resources, the radio signal in
the sea is often so weak that not all the mining stations can carry out
direct communication. However communication is indispensable, every two
mining stations must be able to communicate with each other (either
directly or through other one or more mining stations). To meet the need
of transporting the exploited resources up to the land to get put into
use, there build n ports correspondently along the coast and every port
can communicate with one or more mining stations directly.
Due to
the fact that some mining stations can not communicate with each other
directly, for the safety of the navigation for ships, ships are only
allowed to sail between mining stations which can communicate with each
other directly.
The mining is arduous and people do this job
need proper rest (that is, to allow the ship to return to the port). But
what a coincidence! This time, n vessels for mining take their turns to
take a rest at the same time. They are scattered in different stations
and now they have to go back to the port, in addition, a port can only
accommodate one vessel. Now all the vessels will start to return, how to
choose their navigation routes to make the total sum of their sailing
routes minimal.
Notice that once the ship entered the port, it will not come out!
are several test cases. Every test case begins with four integers in
one line, n (1 = <n <= 100), m (n <= m <= 200), k and p. n
indicates n vessels and n ports, m indicates m mining stations, k
indicates k edges, each edge corresponding to the link between a mining
station and another one, p indicates p edges, each edge indicating the
link between a port and a mining station. The following line is n
integers, each one indicating one station that one vessel belongs to.
Then there follows k lines, each line including 3 integers a, b and c,
indicating the fact that there exists direct communication between
mining stations a and b and the distance between them is c. Finally,
there follows another p lines, each line including 3 integers d, e and
f, indicating the fact that there exists direct communication between
port d and mining station e and the distance between them is f. In
addition, mining stations are represented by numbers from 1 to m, and
ports 1 to n. Input is terminated by end of file.
1 2 4
1 3 3
1 4 4
1 5 5
2 5 3
2 4 3
1 1 5
1 5 3
2 5 3
2 4 6
3 1 4
3 2 2
题意:现在有m个油井和n个港口(n<=m),现在有n条船停在这些油井这里,第一行输入n个数, 输入IDX[i]代表第i条船停在 IDX[i]这个油井这里,然后接下来有k行,输入u,v,w代表油井u和油井v之间的距离为w,然后又p行,代表了港口和油井之间的距离,现在这些船全部要回到港口,而且每个港口只能停一艘船,问这些船返回港口的最短距离。
#include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
#include <stdlib.h>
using namespace std;
const int N = ;
const int INF = ;
int lx[N],ly[N];
bool visitx[N],visity[N];
int slack[N];
int match[N];
int graph[N][N];
int idx[N]; ///船所在的油井下标
int n,m,k,p;
bool Hungary(int u)
{
visitx[u] = true;
for(int i=m+; i<=m+n; i++)
{
if(!visity[i])
{
int temp = lx[u]+ly[i]-graph[u][i];
if(temp==)
{
visity[i] = true;
if(match[i]==-||Hungary(match[i]))
{
match[i] = u;
return true;
}
}
else
{
slack[i] = min(slack[i],temp);
}
}
}
return false;
}
void KM()
{
memset(match,-,sizeof(match));
memset(ly,,sizeof(ly));
for(int i=; i<=n; i++) ///定标初始化
{
lx[idx[i]] = -INF;
}
for(int i=; i<=n; i++)
{
for(int j=m+; j<=n+m; j++)
{
lx[idx[i]] = max(lx[idx[i]],graph[idx[i]][j]);
}
}
for(int i=; i<=n; i++)
{
for(int j=m+; j<=m+n; j++) slack[j] = INF;
while(true)
{
memset(visitx,false,sizeof(visitx));
memset(visity,false,sizeof(visity));
if(Hungary(idx[i])) break;
else
{
int temp = INF;
for(int j=+m; j<=n+m; j++)
{
if(!visity[j]) temp = min(temp,slack[j]);
}
for(int j=; j<=n; j++)
{
if(visitx[idx[j]]) lx[idx[j]]-=temp;
}
for(int j=; j<=n+m; j++)
{
if(visity[j]) ly[j]+=temp;
else slack[j]-=temp;
}
}
}
}
}
struct Edge
{
int v,w,next;
} edge[N*N];
int head[N],tot;
void init()
{
memset(head,-,sizeof(head));
tot = ;
}
void addEdge(int u,int v,int w,int &k)
{
edge[k].v = v,edge[k].w = w,edge[k].next = head[u],head[u] = k++;
}
int low[N];
bool vis[N];
void spfa(int s)
{
for(int i=; i<=n+m; i++)
{
low[i] = INF;
vis[i] = false;
}
queue<int> q;
low[s] = ;
q.push(s);
while(!q.empty())
{
int u = q.front();
q.pop();
vis[u] = false;
for(int i=head[u]; i!=-; i=edge[i].next)
{
int v = edge[i].v,w = edge[i].w;
if(low[v]>low[u]+w)
{
low[v] = low[u]+w;
if(!vis[v])
{
vis[v] = true;
q.push(v);
}
}
}
}
for(int i=+m; i<=n+m; i++)
{
if(low[i]!=INF)
{
graph[s][i] = -low[i];
}
}
}
int main()
{
while(scanf("%d%d%d%d",&n,&m,&k,&p)!=EOF)
{
init();
for(int i=; i<=n; i++)
{
scanf("%d",&idx[i]);
}
/**油田 1-m,港口 m+1-m+n*/
for(int i=; i<=k; i++)
{
int u,v,w;
scanf("%d%d%d",&u,&v,&w);
addEdge(u,v,w,tot);
addEdge(v,u,w,tot);
}
for(int i=; i<=p; i++)
{
int u,v,w;
scanf("%d%d%d",&u,&v,&w);
addEdge(v,u+m,w,tot); ///油井向港口添加单向边
}
memset(graph,,sizeof(graph));
for(int i=; i<=n; i++)
{
spfa(idx[i]);
}
KM();
int ans = ;
for(int i=+m; i<=n+m; i++)
{
if(match[i]!=-)
{
ans+=graph[match[i]][i];
}
}
printf("%d\n",-ans);
}
}
hdu 2448(KM算法+SPFA)的更多相关文章
- hdu 3488(KM算法||最小费用最大流)
Tour Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submis ...
- hdu 3395(KM算法||最小费用最大流(第二种超级巧妙))
Special Fish Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Tota ...
- HDU 2255 KM算法 二分图最大权值匹配
奔小康赚大钱 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Subm ...
- hdu 4862 KM算法 最小K路径覆盖的模型
http://acm.hdu.edu.cn/showproblem.php?pid=4862 选t<=k次,t条路要经过全部的点一次而且只一次. 建图是问题: 我自己最初就把n*m 个点分别放入 ...
- HDU 1533 KM算法(权值最小的最佳匹配)
Going Home Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total ...
- hdu 3435(KM算法最优匹配)
A new Graph Game Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) ...
- hdu 1853 KM算法
#include<stdio.h> #include<math.h> #include<string.h> #define N 200 #define inf 99 ...
- Mining Station on the Sea (hdu 2448 SPFA+KM)
Mining Station on the Sea Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Jav ...
- hdu 2255 奔小康赚大钱--KM算法模板
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2255 题意:有N个人跟N个房子,每个人跟房子都有一定的距离,现在要让这N个人全部回到N个房子里面去,要 ...
随机推荐
- AOJ.592 神奇的叶子
神奇的叶子 Time Limit: 1000 ms Case Time Limit: 1000 ms Memory Limit: 64 MB Total Submission: 920 Submiss ...
- 15ecjtu校赛1006 (dfs容斥)
Problem Description 在平面上有一个n*n的网格,即有n条平行于x轴的直线和n条平行于y轴的直线,形 成了n*n个交点(a,b)(1<=a<=n,1<=b<= ...
- gulp压缩css和js
压缩 css 代码可降低 css 文件大小,提高页面打开速度. 规律转换为 gulp 代码 找到 css/ 目录下的所有 css 文件,压缩它们,将压缩后的文件存放在 dist/css/ 目录下.一. ...
- 关于微信内置浏览器安卓端session丢失问题
项目上线测试,发现微信安卓端存在用户登录无法验证session情况, 导致每次接口请求都无法识别,而苹果客户端不会出现此问题,非微信环境打开不会出现此问题,找到一些解决方案做下记录: 方案1: 由于微 ...
- 「模板」 FHQ_Treap
「模板」 FHQ_Treap 我也是偶然发现我还没发过FHQ_Treap的板子. 那就发一波吧. 这个速度实在不算快,但是不用旋转,并且好写. 更重要的是,Splay 可以做的事情它都可以做!比如区间 ...
- MyBatis框架的使用及源码分析(九) Executor
从<MyBatis框架的使用及源码分析(八) MapperMethod>文中我们知道执行Mapper的每一个接口方法,最后调用的是MapperMethod.execute方法.而当执行Ma ...
- redis cluster以及master-slave在windows下环境搭建
一.redis cluster环境搭建: 1.了解Redis Cluster原理: 详细了解可参考:http://doc.redisfans.com/topic/cluster-tutorial.ht ...
- [Unity]多线程编程的一点心得
在做毕设的时候涉及到了较大数据的读取,每次从硬盘读都会卡很久,于是找资料之后自己做了个简单的多线程解决方案. 一共有两个类.第一个类ThreadJob如下: using System.Collecti ...
- LESS使用简介!
我真的真的极度痛苦. 原本用了那么久的LESS,一直都是用编译工具(考拉)进行编译的,今天试了试用less.js来搞,按官网的都一毛一样,然而!就是编译不出来! 我用来擦鼻涕的卫生纸都一下午用了大半卷 ...
- js_在原有的日期上添加天数输出添加后的日期
开始编码工作也有段时间了,想想没有留下点什么,有点遗憾.学到的一些经验,写写,分享一下.也给自己整理一下. 今天分享一下,在原有的日期上添加天数输出添加后的日期.开始做的时候,简单的思路是,直接用ne ...