floyed
floyed
floyed
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
#include <bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
const int N=500;
int s[N][N];
int main()
{
int n,m,t;
// cout<<INF<<endl;
cin>>n>>m>>t;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++){
if(i==j)s[i][j]=0;
else s[i][j]=INF;
}
}
while(m--)
{
int a,b,c;
cin>>a>>b>>c;
s[a][b]=min(c,s[a][b]);
}
for(int k=1;k<=n;k++)
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
s[i][j]=min(s[i][j],s[i][k]+s[k][j]);
}
}
}
while(t--)
{
int a,b;
cin>>a>>b;
if(s[a][b]<INF/2)cout<<s[a][b];
else cout<<"impossible";
cout<<endl;
}
return 0;
}
本文由作者按照 CC BY 4.0 进行授权