Holy Grail

题目链接：https://nanti.jisuanke.com/t/41305
As the current heir of a wizarding family with a long history,unfortunately, you find yourself forced to participate in the cruel Holy Grail War which has a reincarnation of sixty years.However,fortunately,you summoned a Caster Servant with a powerful Noble Phantasm.When your servant launch her Noble Phantasm,it will construct a magic field,which is actually a directed graph consisting of n vertices and m edges.More specifically,the graph satisfies the following restrictions :

Does not have multiple edges(for each pair of vertices x and y, there is at most one edge between this pair of vertices in the graph) and does not have self-loops(edges connecting the vertex with itself).
May have negative-weighted edges.
Does not have a negative-weighted loop.
n<=300 , m<=500.
Currently,as your servant’s Master,as long as you add extra 6 edges to the graph,you will beat the other 6 masters to win the Holy Grail.

However，you are subject to the following restrictions when you add the edges to the graph:

Each time you add an edge whose cost is c,it will cost you c units of Magic Value.Therefore,you need to add an edge which has the lowest weight(it’s probably that you need to add an edge which has a negative weight).
Each time you add an edge to the graph,the graph must not have negative loops,otherwise you will be engulfed by the Holy Grail you summon.
Input
Input data contains multiple test cases. The first line of input contains integer t — the number of testcases (1 \le t \le 51≤t≤5).

For each test case,the first line contains two integers n,m,the number of vertices in the graph, the initial number of edges in the graph.

Then m lines follow, each line contains three integers x, y and w (0 \le x,y<n0≤x,y<n,-10^9−10
9≤w≤10^910 9, x \not = yx =y) denoting an edge from vertices x to y (0-indexed) of weight w.

Then 6 lines follow, each line contains two integers s,t denoting the starting vertex and the ending vertex of the edge you need to add to the graph.

It is guaranteed that there is not an edge starting from s to t before you add any edges and there must exists such an edge which has the lowest weight and satisfies the above restrictions, meaning the solution absolutely exists for each query.

Output
For each test case,output 66 lines.

Each line contains the weight of the edge you add to the graph.

样例输入
1
10 15
4 7 10
7 6 3
5 3 3
1 4 11
0 6 20
9 8 25
3 0 9
1 2 15
9 0 27
5 2 0
7 3 -5
1 7 21
5 0 1
9 3 16
1 8 4
4 1
0 3
6 9
2 1
8 7
0 4

样例输出
-11
-9
-45
-15
17
7

看懂题目了其实很好写，题目意思是，给你一个有向图，有负权重的边，让你依次往里面加6条固定的边，所构成的新图不能有负数环，由样例和作图可以发现，直接依次求所给两点间的最短路径，而要在这两点建的边的权值为最短路径的相反值，只需调用6次spfa算法即可。

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>
#define inf 0x3f3f3f3f
using namespace std;
int G[505][505],d[505],vis[505];
int n,m;
void spfa(int s)
{
	queue<int> q;
	memset(vis,0,sizeof(vis));
	memset(d,inf,sizeof(d));
	d[s]=0;
	vis[s]=1;
	q.push(s);
	while(!q.empty())
	{
		int u=q.front();
		q.pop();
		vis[u]=0;
		for(int i=0;i<n;i++){
			if(G[u][i]+d[u]<d[i]){
				d[i]=G[u][i]+d[u];
				if(!vis[i]) q.push(i),vis[i]=1;
			}
		}
	}
}
int main()
{
	int t;
	cin>>t;
	while(t--)
	{
		cin>>n>>m;
		for(int i=0;i<n;i++)
			for(int j=0;j<n;j++)
				G[i][j]=inf;
		int a,b,c;
		for(int i=0;i<m;i++){
			cin>>a>>b>>c;
			G[a][b]=c;
		}
		for(int i=0;i<6;i++){
			cin>>a>>b;
			spfa(b);      //反过来找从b到各点的最短路径
			int ans=(-1)*d[a];
			G[a][b]=ans;  //将新建的边放入图中
			cout<<ans<<endl;
		}
	}
	return 0;
}