题意
给出一个无向图,有k次机会可以使某条边的长度减半,一条边只能减一次,问1到n的最短路。
n,k<=50,m<=1000
分析
调一道sb题调了快半小时,最后发现是数组开小了。这是预示着我noip要滚粗了吗?
代码
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
const int N=2605;
const int inf=1000000000;
int n,m,k,cnt,last[N],dis[N];
bool vis[N];
struct edge{int to,next,w;}e[N*300];
queue<int> que;
int read()
{
int x=0,f=1;char ch=getchar();
while (ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while (ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
void addedge(int u,int v,int w)
{
e[++cnt].to=v;e[cnt].w=w;e[cnt].next=last[u];last[u]=cnt;
}
int point(int x,int y)
{
return y*n+x;
}
void spfa()
{
for (int i=1;i<=point(n,k);i++) dis[i]=inf;
dis[1]=0;vis[1]=1;que.push(1);
while (!que.empty())
{
int u=que.front();que.pop();
for (int i=last[u];i;i=e[i].next)
if (dis[u]+e[i].w<dis[e[i].to])
{
dis[e[i].to]=dis[u]+e[i].w;
if (!vis[e[i].to]) vis[e[i].to]=1,que.push(e[i].to);
}
vis[u]=0;
}
}
int main()
{
n=read();m=read();k=read();
for (int i=1;i<=m;i++)
{
int x=read(),y=read(),z=read();
for (int j=0;j<=k;j++) addedge(point(x,j),point(y,j),z),addedge(point(y,j),point(x,j),z);
for (int j=0;j<k;j++) addedge(point(x,j),point(y,j+1),z/2),addedge(point(y,j),point(x,j+1),z/2);
}
spfa();
int ans=inf;
for (int i=0;i<=k;i++) ans=min(ans,dis[point(n,i)]);
printf("%d",ans);
return 0;
}