sgu185：Two shortest(最短路+最大流+邻接矩阵)

题意：
给定n个点m条无向边和边权（无重边）
找2条从1-n点路径不相交的最短路（2条路必须都是最短）
分析：
费用流果然MLE了...
首先我们可以一遍spfa跑出所有在最短路上的边，然后在其上做最大流就好了。其实可以用邻接矩阵...

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int MAXN = 409, INF = 1e9;
int n, m;
int c[MAXN][MAXN], f[MAXN][MAXN];
bool in[MAXN][MAXN];
int dis[MAXN];
bool used[MAXN];
int q[MAXN<<3], l, r;
int disn = INF;
int maxc = 0;

void spfa()
{
	memset(used, 0, sizeof(used));
	used[1] = 1;
	for(int i = 1; i <= n; ++i)	dis[i] = INF;
	dis[1] = 0;
	l = -1, r = 0;
	q[0] = 1;
	while(l < r)
	{
		int u = q[++l];
		used[u] = 0;
		for(int v = 1; v <= n; ++v)
			if(c[u][v] && dis[u]+c[u][v] < dis[v])
			{
				dis[v] = dis[u]+c[u][v];
				if(!used[v]) 
				{
					q[++r] = v; 
					used[v] = 1;
				}
			}
	}
}

bool bfs()
{
	memset(used, 0, sizeof(used));
	used[n] = 1;
	for(int i = 1; i <= n; ++i)	dis[i] = INF;
	dis[n] = 0;
	l = -1, r = 0;
	q[0] = n;
	while(l < r)
	{
		int u = q[++l];
		used[u] = 0;
		for(int v = 1; v <= n; ++v)
			if(f[v][u] && dis[v] > dis[u]+1)
			{
				dis[v] = dis[u]+1;
				if(!used[v])
				{
					used[v] = 1;
					q[++r] = v;
				}
			}
	}
	return dis[1] < INF;
}

int maxflow(int cur, int flow)
{
	if(cur == n || flow == 0) return flow;
	int re = 0, tmp;
	for(int i = 1; i <= n; ++i)
		if(dis[i] == dis[cur]-1)
		{
			tmp = flow;
			if(tmp > f[cur][i]) tmp = f[cur][i];
			tmp = maxflow(i, tmp);
			flow -= tmp;
			re += tmp;
			f[cur][i] -= tmp;
			f[i][cur] += tmp;
			if(flow == 0) break;
		}
	dis[cur] = INF;
	return re;
}

void dfs(int cur)
{
	cout << cur;
	if(cur == n)
	{
		cout << endl;
		return ;	
	}
	else cout << ' ';
	for(int i = 1; i <= n; ++i)
		if(in[cur][i] && !f[cur][i])
		{
			in[cur][i] = in[i][cur] = 0;
			dfs(i);
			break;
		}
}

int main()
{
	cin >> n >> m;
	for(int i = 1; i <= m; ++i)
	{
		int x, y, l;
		cin >> x >> y >> l;
		c[x][y] = c[y][x] = l;	
	}
	spfa();disn = dis[n];
	for(int i = 1; i <= n; ++i)
		for(int j = 1; j <= n; ++j)
			if(i != j && c[i][j] && dis[i]+c[i][j] == dis[j]) 
				in[i][j] = f[i][j] = 1;
	while(bfs())
		maxc += maxflow(1, INF);
	if(maxc < 2) cout << "No solution" << endl;
	else dfs(1), dfs(1);	
	return 0;	
}