#include <cstdio>
#include <cstring>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <queue>
#include <vector>
using namespace std; const int maxe = ;
const int maxn = ;
const int INF = 0x3f3f3f3f; struct Edge{
int u,v,flow,cap,cost;
int next;
Edge(int u=,int v=,int flow=,int cap=,int cost=,int next=):
u(u), v(v), flow(flow), cap(cap), cost(cost), next(next){}
}; struct MCMF{
Edge edges[maxe];
int head[maxn],cnt;
int d[maxn];
bool inq[maxn];
int pa[maxn];
int res[maxn]; void init(){
memset(head,-,sizeof(head));
cnt = ;
} void addedge(int u,int v,int cap,int cost){
edges[cnt] = Edge(u,v,,cap,cost,head[u]);
head[u] = cnt++;
edges[cnt] = Edge(v,u,,,-cost,head[v]);
head[v] = cnt++;
} bool SPFA(int s,int t,int& flow,int& cost){
memset(d,0x3f,sizeof(d));
memset(inq,,sizeof(inq)); queue<int> Q;
Q.push(s);
inq[s] = true; d[s] = ;
res[s] = INF; res[t] = ; while(!Q.empty()){
int u = Q.front(); Q.pop();
inq[u] = false; for(int i=head[u];i!=-;i=edges[i].next){
Edge& e = edges[i];
if(e.cap>e.flow && d[e.v] > d[u] + e.cost){
d[e.v] = d[u] + e.cost;
pa[e.v] = i;
res[e.v] = min(res[u],e.cap-e.flow);
if(!inq[e.v]){
Q.push(e.v);
inq[e.v] = true;
}
}
}
}
if(res[t] == ) return false;
flow += res[t];
cost += res[t]*d[t];
for(int i=t;i!=s;i=edges[pa[i]].u){
edges[pa[i]].flow += res[t];
edges[pa[i]^].flow -= res[t];
}
return true;
} int MinCost(int s,int t){
int flow = ,cost = ;
while(SPFA(s,t,flow,cost)){} return cost;
}
}solver; struct Node{
int x,y;
int dist;
Node(int x=,int y=,int dist = ): x(x), y(y) ,dist(dist) {}
};
Node Knight[];
int n,k,m;
int dist[][]; int Mymap[][]; // == 0代表rock,-1代表space ,1-m代表mill.
int next_x[] = {-,,,};
int next_y[] = {,-,,}; void bfs(){
bool vis[][];
memset(dist,0x3f,sizeof(dist));
queue<Node> Q;
for(int i=;i<=k;i++){
while(!Q.empty()) Q.pop();
Q.push(Node(Knight[i].x,Knight[i].y,)); memset(vis,,sizeof(vis));
vis[Knight[i].x][Knight[i].y] = true; while(!Q.empty()){
Node out = Q.front(); Q.pop();
for(int j=;j<;j++){
int x = out.x + next_x[j];
int y = out.y + next_y[j];
if(vis[x][y]) continue;
vis[x][y] = true;
if(Mymap[x][y] == -){
Q.push(Node(x,y,out.dist+));
}
else if(Mymap[x][y]>){
dist[i][Mymap[x][y]] = out.dist+;
Q.push(Node(x,y,out.dist+));
}
}
}
}
} int main()
{
//freopen("E:\\acm\\input.txt","r",stdin);
int T;
cin>>T;
for(int cas=;cas<=T;cas++){
cin>>n>>k>>m;
char ch[];
memset(Mymap,,sizeof(Mymap));
int cntm = ;
for(int i=;i<=n;i++){
scanf("%s",ch+);
for(int j=;j<=n;j++){
if(ch[j]>='A' && ch[j]<='Z'){
int num = ch[j] - 'A' + ;
Knight[num] = Node(i,j,);
Mymap[i][j] = -;
}
else if(ch[j] == 'm'){
Mymap[i][j] = cntm++;
}
else if(ch[j] == '.'){
Mymap[i][j] = -;
}
}
}
bfs();
solver.init();
int s = , t = k+m+;
for(int i=;i<=k;i++){
int a;
scanf("%d",&a);
solver.addedge(s,i,a,);
}
for(int i=;i<=k;i++)
for(int j=;j<=m;j++){
solver.addedge(i,k+j,,dist[i][j]);
} for(int i=;i<=m;i++){
solver.addedge(k+i,t,,);
} printf("Case %d: %d\n",cas,solver.MinCost(s,t));
}
}

lightoj 1243 - Guardian Knights 最小费用流的更多相关文章

  1. LightOJ 1315 - Game of Hyper Knights(博弈sg函数)

    G - Game of Hyper Knights Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%lld & ...

  2. Lightoj 1010 - Knights in Chessboard

    1010 - Knights in Chessboard    PDF (English) Statistics Forum Time Limit: 1 second(s) Memory Limit: ...

  3. Lightoj 1010 - Knights in Chessboard (胡搞)

    题目连接: http://www.lightoj.com/volume_showproblem.php?problem=1010 题目描述: 有一个n*m的棋盘,根据象棋中马走日字的规则,问此棋盘最多 ...

  4. LightOJ - 1010 Knights in Chessboard(规律)

    题目链接:https://vjudge.net/contest/28079#problem/B 题目大意:给你一个nxm的棋盘,问你最多可以放几个骑士让他们互相攻击不到.骑士攻击方式如下图: 解题思路 ...

  5. LightOJ1171 Knights in Chessboard (II)(二分图最大点独立集)

    题目 Source http://www.lightoj.com/volume_showproblem.php?problem=1171 Description Given an m x n ches ...

  6. lightoj 1010 (水题,找规律)

    lightoj 1010 Knights in Chessboard 链接:http://lightoj.com/volume_showproblem.php?problem=1010 题意:国际象棋 ...

  7. 区间DP LightOJ 1422 Halloween Costumes

    http://lightoj.com/volume_showproblem.php?problem=1422 做的第一道区间DP的题目,试水. 参考解题报告: http://www.cnblogs.c ...

  8. POJ2942 Knights of the Round Table[点双连通分量|二分图染色|补图]

    Knights of the Round Table Time Limit: 7000MS   Memory Limit: 65536K Total Submissions: 12439   Acce ...

  9. POJ 2942 Knights of the Round Table

    Knights of the Round Table Time Limit: 7000MS   Memory Limit: 65536K Total Submissions: 10911   Acce ...

随机推荐

  1. CI 笔记 数据库

    demo: 1.  建立数据库,driver, 字段 name,telphone,idcard,car,content 2. 建立model,Driver_model.php文件, 建立add方法, ...

  2. java输入输出流(内容练习)

    1,编写一个程序,读取文件test.txt的内容并在控制台输出.如果源文件不存在,则显示相应的错误信息. package src; import java.io.File; import java.i ...

  3. Linux如何查找大文件或目录总结-1127

    原帖地址:http://www.cnblogs.com/kerrycode/p/4391859.html  谢谢潇湘隐者,谢谢老大 在Linux系统中,如何去搜索一些比较大的文件呢?下面我整理了一下在 ...

  4. 【转】iOS开发常用的第三方类库

    原文: http://blog.csdn.net/xiazailushang/article/details/9716043 在iOS开发中不可避免的会用到一些第三方类库,它们提供了很多实用的功能,使 ...

  5. HTML网页图片滚动代码

    <!--下面是向上滚动代码--> <div id=butong_net_top style=overflow:hidden;height:100;width:90;> < ...

  6. js简版定时器

    <html> <head> <meta http-equiv="Content-Type" content="text/html; char ...

  7. UI图标不用愁:矢量字体图标Font-Awesome

    Font-Awesome,这个项目主要是css3的一个应用,准确的说是一段css,这里的把很多图标的东西做到了font文件里面,然后通过引用外部font文件的方式,来展现图标. Font Awesom ...

  8. 手写js面向对象选项卡插件

    <!DOCTYPE html><html lang="en"><head>    <meta charset="UTF-8&qu ...

  9. iOS:翻页效果

    // // main.m // Hello // // Created by lishujun on 14-8-28. // Copyright (c) 2014年 lishujun. All rig ...

  10. JSP中两种模式的总结

    运用JSP/Servlet实现的Web动态交互,主要采用: 模式一:JSP+JavaBean 链接:http://wxmimperio.coding.io/?p=155 模式二;JSP+Servlet ...