题目大意
给定一张
n
个点,
有
q
个询问,要你计算从点
n≤150,m≤5000,q≤1000,wi≤5000
题目分析
令
fi,j,k
表示点
i
从点
时间复杂度
代码实现
#include <algorithm>
#include <iostream>
#include <climits>
#include <cstdio>
#include <cctype>
using namespace std;
int read()
{
int x=0,f=1;
char ch=getchar();
while (!isdigit(ch)) f=ch=='-'?-1:f,ch=getchar();
while (isdigit(ch)) x=x*10+ch-'0',ch=getchar();
return x*f;
}
const int N=155;
const int M=5005;
const int INF=INT_MAX/2;
struct edge
{
int x,y,len;
edge(int x_=0,int y_=0,int len_=0){x=x_,y=y_,len=len_;}
bool operator<(const edge p)const{return len<p.len;}
}e[M];
int dist[N][N][N];
int n,m,q;
void update(int &x,int y){x=x<y?x:y;}
void pre()
{
for (int i=1;i<=n;++i)
{
for (int j=1;j<=n;++j)
for (int k=0;k<n;++k)
dist[i][j][k]=INF;
dist[i][i][0]=0;
}
sort(e+1,e+1+m);
for (int i=1,x,y,z;i<=m;++i)
{
x=e[i].x,y=e[i].y,z=e[i].len;
for (int j=1;j<=n;++j)
for (int k=0;k<n-1;++k)
update(dist[y][j][k+1],dist[x][j][k]+z);
}
}
void solve()
{
for (int x,y,upp,res;q--;)
{
x=read(),y=read(),upp=read();
res=INF;
for (int i=0;i<=upp&&i<n;++i) update(res,dist[y][x][i]);
if (res==INF) printf("-1\n");
else printf("%d\n",res);
}
}
int main()
{
freopen("sum.in","r",stdin),freopen("sum.out","w",stdout);
n=read(),m=read(),q=read();
for (int i=1,x,y,z;i<=m;++i) x=read(),y=read(),z=read(),e[i]=edge(x,y,z);
pre(),solve();
fclose(stdin),fclose(stdout);
return 0;
}