计蒜客 Our Journey of Dalian Ends（17新疆网赛） 费用流（思维建图）

传送门：Our Journey of Dalian Ends

题意：给出一个无向图，要从Dalian到Xian，途径Shanghai，必须走最短路且每个城市只能经过一次，问最短路长度是多少。

思路：比赛时候想了2个小时该怎么建图才能使得必须经过Shanghai，赛后发现以Shanghai为起点，另两个为终点不就得了。。我真是个傻X。。

至于每个城市只能经过一次什么的拆点限制一下就好啦，注意Shanghai的出边流量至少要为2。

代码：

#include<bits/stdc++.h>
#define ll long long
#define inf 0x3f3f3f3f
using namespace std;
const int MAXN=10100;
const int MAXM=100010;
int head[MAXN],pre[MAXN],dis[MAXN],book[MAXN];
int cnt=0,N;//N为点数 
struct node{
	int to,next,cap,flow,cost;
}edge[MAXM];
void init()
{
	cnt=0;
	memset(head,-1,sizeof(head));
}
void addedge(int u,int v,int cap,int cost)
{
	edge[cnt].to=v;edge[cnt].cap=cap;edge[cnt].flow=0;
	edge[cnt].cost=cost;edge[cnt].next=head[u];head[u]=cnt++;
	edge[cnt].to=u;edge[cnt].cap=0;edge[cnt].flow=0;
	edge[cnt].cost=-cost;edge[cnt].next=head[v];head[v]=cnt++;
}
bool spfa(int s,int t)
{
	queue<int>q;
	while(!q.empty())q.pop();
	for(int i=0;i<=N;i++)
	{
		dis[i]=inf;
		pre[i]=-1;
		book[i]=0;
	}
	dis[s]=0;book[s]=1;q.push(s);
	while(!q.empty())
	{
		int u=q.front();q.pop();book[u]=0;
		for(int i=head[u];i!=-1;i=edge[i].next)
		{
			int v=edge[i].to;
			if(edge[i].cap>edge[i].flow&&dis[v]>dis[u]+edge[i].cost)
			{
				dis[v]=dis[u]+edge[i].cost;
				pre[v]=i;
				if(!book[v])
				{
					book[v]=1;
					q.push(v);
				}
			}
		 } 
	}
	return pre[t]!=-1;
}
int min_cost_max_flow(int s,int t,int &cost)
{
	int flow=0;
	cost=0;
	while(spfa(s,t))
	{
		int temp=inf;
		for(int i=pre[t];i!=-1;i=pre[edge[i^1].to])
		temp=min(temp,edge[i].cap-edge[i].flow);
		for(int i=pre[t];i!=-1;i=pre[edge[i^1].to])
		{
			edge[i].flow+=temp;
			edge[i^1].flow-=temp;
			cost+=edge[i].cost*temp;
		}
		flow+=temp;
	}
	return flow;
}
map<string, int> id;
int tid;
int U[MAXN], V[MAXN], W[MAXN];
int main()
{
	std::ios::sync_with_stdio(0);
	string x, y;
	int T, m, u, v, w;
	int s_id, t_id1, t_id2;
	cin >> T;
	while(T--)
	{
		id.clear();
		tid = 0;
		s_id = t_id1 = t_id2 = -1;
		init();
		cin >> m;
		for(int i = 0; i < m; i++)
		{
			cin >> x >> y >> w;
			if(!id.count(x))
			id[x] = ++tid;
			if(!id.count(y))
			id[y] = ++tid;
			U[i] = id[x]; V[i] = id[y]; W[i] = w;
		}
		if(id.count("Shanghai")) s_id = id["Shanghai"];
		if(id.count("Dalian")) t_id1 = id["Dalian"];
		if(id.count("Xian")) t_id2 = id["Xian"];
		if(s_id == -1 || t_id1 == -1 || t_id2 == -1)
		{
			cout << -1 << endl; continue;
		}
		for(int i = 0; i < m; i++)
		{
			addedge(U[i] + tid, V[i], inf, W[i]);
			addedge(V[i] + tid, U[i], inf, W[i]);
		}
		for(int i = 1; i <= tid; i++)
		addedge(i, i + tid, 1, 0);
		int source = 0, sink = 2 * tid + 1;
		addedge(source, s_id + tid, 2, 0);
		addedge(t_id1 + tid, sink, 1, 0);
		addedge(t_id2 + tid, sink, 1, 0);
		N = sink;
		int cost, flow;
		flow = min_cost_max_flow(source, sink, cost);
		if(flow != 2)
		cout << -1 << endl;
		else
		cout << cost << endl;
	}
}