记录编号	335521	评测结果	AAAAAAAAA
题目名称	道路重建	最终得分	100
用户昵称	蜗牛哲	是否通过	通过
代码语言	C++	运行时间	0.994 s
提交时间	2016-11-02 14:26:55	内存使用	0.32 MiB

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<climits>
#include<cstdlib>
#include<ctime>
#include<cctype>
#include<algorithm>
#include<set>
#include<map>
#include<vector>
#include<stack>
#include<queue>
#include<deque>
#include<string>
#include<sstream>
#include<iomanip>
using namespace std;
//=====================struct declaration======================
 
//=====================var declarartion========================
const int maxn=100+10;
int a[maxn][maxn];
bool v[maxn];
 
int n,m,d,s,f,min1=INT_MAX;
//=====================function declaration====================
int getint();
void dfs(int x,int len);
//=====================main code===============================
int main()
{
	freopen("rebuild.in","r",stdin);
	freopen("rebuild.out","w",stdout);
	
	int i,j,k,ii;
	n=getint(); m=getint();
	for(ii=1; ii<=m; ii++)
	{
		i=getint(); j=getint(); k=getint();
		a[i][j]=k; a[j][i]=k;
	}
	d=getint();
	for(ii=1; ii<=d; ii++)
	{
		i=getint(); j=getint();
		a[i][j]=-a[i][j]; a[j][i]=-a[j][i];
	}
	s=getint(); f=getint();
	
	dfs(s,0);
	
	printf("%d\n",min1);
	
	return 0;
}
//=====================function code===========================
void dfs(int x,int len)
{
	if(x==f)
	{
		if(len<min1) min1=len;
		return;
	}
	for(int i=1; i<=n; i++)
	{
		if(v[i] || a[x][i]==0) continue;
		if(a[x][i]<0)
		{
			v[i]=true;
			len-=a[x][i];
			dfs(i,len);
			v[i]=false;
			len+=a[x][i];
		}
		else
		{
			v[i]=true;
			dfs(i,len);
			v[i]=false;
		}
	}
}
int getint()
{
	int x=0,s=1;
	char ch=' ';
	while (ch<'0' || ch>'9')
	{
		ch=getchar();
		if (ch=='-') s=-1;
	}
	
	while (ch>='0' && ch<='9')
	{
		x=x*10+ch-'0';
		ch=getchar();
	}
	return x*s;
}