1243 网络提速

建图跑最短路。

#include<cstdio>
#include<cstring>
#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<bitset>
#include<queue>
using namespace std;
#define rep(i,j,k) for(i=j;i<=k;++i)
#define per(i,j,k) for(i=j;i>=k;--i)
#define G getchar()
#define LL long long
#define pii pair<int,int>
#define mkp make_pair
#define X first
#define Y second
#define N 100005
#define NN 300005
int n,m,nm;double w[505][505],d[N];bool vis[N];
void add(int i,int j,double x){
	w[i][j]=x;
	while((j+=n)<=nm)
		w[i][j]=w[i][j-n]/2;
}
void dijkstra(){
	int i,j,x=1,y=1;vis[1]=1;
	rep(i,2,nm){
		rep(j,1,nm)if(!vis[j]){
			if(w[x][j]>0&&(d[j]==0||d[j]>w[x][j]+d[x]))d[j]=w[x][j]+d[x];
			if(d[j]>0&&(y==x||d[j]<d[y]))y=j;
		}
		if(y==x)break;
		vis[x=y]=1;
	}
}
int main(){
	int i,j,i1,j1;double tmp;
	scanf("%d%d",&n,&m);nm=n*(m+1);
	rep(i,1,n)rep(j,1,n){
		scanf("%lf",&tmp);
		if(tmp==0)continue;
		add(i,j,tmp);
		for(i1=i+n,j1=j+n;i1<=nm&&j1<=nm;i1+=n,j1+=n)
			add(i1,j1,tmp);
	}
	dijkstra();
	printf("%.2lf\n",d[nm]);
	return 0;
}