hdoj 5545 The Battle of Guandu 【差分约束系统 求解多源最短路】

#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <vector>
#define INF 0x3f3f3f3f3f
#define eps 1e-8
#define MAXN (100000+10)
#define MAXM (50000000)
#define Ri(a) scanf("%d", &a)
#define Rl(a) scanf("%lld", &a)
#define Rf(a) scanf("%lf", &a)
#define Rs(a) scanf("%s", a)
#define Pi(a) printf("%d\n", (a))
#define Pf(a) printf("%lf\n", (a))
#define Pl(a) printf("%lld\n", (a))
#define Ps(a) printf("%s\n", (a))
#define W(a) while(a--)
#define CLR(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define LL long long
#define lson o<<1, l, mid
#define rson o<<1|1, mid+1, r
#define ll o<<1
#define rr o<<1|1
using namespace std;
struct Edge{
int from, to;
LL val; int next;
};
Edge edge[MAXM];
int head[MAXN], edgenum;
void init()
{
edgenum = 0;
CLR(head, -1);
}
void addEdge(int u, int v, LL w)
{
Edge E = {u, v, w, head[u]};
edge[edgenum] = E;
head[u] = edgenum++;
}
int n, m;
int x[MAXN], y[MAXN];
LL c[MAXN]; int w[MAXN];
void getMap()
{
init(); Ri(n); Ri(m);
for(int i = 1; i <= n; i++)
Ri(x[i]);
for(int i = 1; i <= n; i++)
Ri(y[i]);
for(int i = 1; i <= n; i++)
Rl(c[i]);
for(int i = 1; i <= m; i++)
Ri(w[i]);
for(int i = 1; i <= n; i++)
if(w[x[i]])
addEdge(y[i], x[i], c[i]);
}
bool vis[MAXN];
LL dist[MAXN];
int kcase = 1;
void solve()
{
getMap(); CLR(vis, false); //CLR(dist, INF);
queue<int> Q;
for(int i = 1; i <= m; i++)
{
if(w[i] == 0)
{
Q.push(i);
dist[i] = 0;
vis[i] = true;
}
else
dist[i] = INF;
}
while(!Q.empty())
{
int u = Q.front(); Q.pop();
vis[u] = false;
for(int i = head[u]; i != -1; i = edge[i].next)
{
Edge E = edge[i];
if(dist[E.to] > dist[u] + E.val)
{
dist[E.to] = dist[u] + E.val;
if(!vis[E.to])
{
vis[E.to] = true;
Q.push(E.to);
}
}
}
}
LL ans = 0;
bool flag = true;
for(int i = 1; i <= m; i++)
{
if(w[i] == 2)
{
if(dist[i] == INF)
{
flag = false;
break;
}
else
ans += dist[i];
}
}
if(flag)
printf("Case #%d: %lld\n", kcase++, ans);
else
printf("Case #%d: -1\n", kcase++);
}
int main()
{
int t; Ri(t);
W(t){
solve();
}
return 0;
}