题意:N个城市,标号从0到N-1,M条道路,第K条道路(K从0开始)的长度为2^K,求编号为0的城市到其他城市的最短距离
输入:第一行两个正整数N(2<=N<=100)M(M<=500),表示有N个城市,M条道路
接下来M行两个整数,表示相连的两个城市的编号,输入数据中保证没有重边
输出:N-1行,表示0号城市到其他城市的最短路,如果无法到达,输出-1,数值太大的以MOD 100000 的结果输出。
思路:
由于第i条边的权值w[i] = 2^i,那么前i-1条边的权值之和为w[0]+w[1]+·+w[i-1] =(2^i)-1
也就是说前i-1条边的权值之和小于第i条边。
根据这一性质,当添加第i条边(a,b)时:
若a,b未连通,则a,b间的最短路径为w[i];
若a,b已经连通,则a,b之间的最短路径保持不变。
#include<cstdio>
#include<fstream>
using namespace std;
#define MAX 550
#define INF 9999999
#define M 100000
int father[MAX], rank[MAX];
int d[MAX][MAX];
void init ( int n )
{
for ( int i = 0; i < n; i++ )
{
father[i] = i;
rank[i] = 1;
d[i][i] = 0;
}
}
int Find ( int i )
{
if ( i != father[i] )
father[i] = Find(father[i]);
return father[i];
}
void Union ( int a, int b )
{
int ta = Find(a);
int tb = Find(b);
if ( ta == tb ) return;
if ( rank[a] >= rank[b] )
{
father[tb] = ta;
rank[ta] += rank[tb];
}
else
{
father[ta] = tb;
rank[tb] += rank[ta];
}
}
int mod_exp ( long long a, long long b )
{
long long ret = 1;
while ( b > 0 )
{
if ( b & 1 )
ret = ( ret * a ) % M;
b >>= 1;
a = ( a * a ) % M;
}
return ret;
}
int main()
{
int n, m, i, j, k;
int a, b, ta, tb, dist;
while ( scanf("%d%d",&n,&m) != EOF )
{
init(n);
for ( k = 0; k < m; k++ )
{
scanf("%d%d",&a,&b);
ta = Find(a);
tb = Find(b);
if ( ta == tb ) continue;
dist = mod_exp(2,k);
for ( i = 0; i < n; i++ )
{
if ( Find(i) != ta ) continue;
for ( j = 0; j < n; j++ )
{
if ( Find(j) != tb ) continue;
d[i][j] = (d[i][a] + dist + d[b][j]) % M;
d[j][i] = d[i][j];
}
}
Union(a,b);
}
ta = Find(0);
for ( i = 1; i < n; i++ )
{
if ( Find(i) == ta )
printf("%d\n",d[0][i]);
else printf("-1\n");
}
}
return 0;
}
当然,最短路还是可以用标准的算法求的···
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define M 100000
#define INF 1999999
class Node
{
public:
int dn[505];
void init( int );
bool operator< ( const Node& );
bool operator== ( const Node& );
Node operator+ ( const Node& );
Node operator+ ( int );
};
void Node::init ( int flag )
{
for ( int i = 500; i >= 0; i-- )
dn[i] = flag ? INF : 0;
}
bool Node::operator< ( const Node& x )
{
for ( int i = 500; i >= 1; i-- )
if ( dn[i] < x.dn[i] ) return true;
else if ( dn[i] > x.dn[i] ) return false;
return false;
}
bool Node::operator== ( const Node& x )
{
for ( int i = 500; i >= 1; i-- )
if ( dn[i] != x.dn[i] ) return false;
return true;
}
Node Node::operator+ ( const Node& x )
{
Node ret;
for ( int i = 500; i >= 1; i-- )
ret.dn[i] = dn[i] + x.dn[i];
return ret;
}
Node Node::operator+ ( int x )
{
Node ret = *this;
ret.dn[x]++;
return ret;
}
int map[110][110], vis[110];
Node d[110], MM;
void Dijkstra ( int n )
{
Node tmp;
int i, j, k;
for ( i = 1; i <= n; i++ )
d[i].init(1), vis[i] = 0;
d[1].init(0);
for ( i = 1; i <= n; i++ )
{
for(tmp = MM, j = 1; j <= n; j++ )
if ( !vis[j] && d[j] < tmp )
tmp = d[k=j];
if ( tmp == MM ) break;
vis[k] = 1;
for ( j = 1; j <= n; j++ )
{
if (vis[j] || map[k][j] == INF) continue;
tmp = d[k] + map[k][j];
if ( tmp < d[j] ) d[j] = tmp;
}
}
}
int mod_exp ( long long a, long long b )
{
long long ret = 1;
while ( b > 0 )
{
if ( b & 1 )
ret = ( ret * a ) % M;
b >>= 1;
a = ( a * a ) % M;
}
return ret;
}
int cal ( const Node& x )
{
int sum = 0;
for ( int i = 1; i <= 500; i++ )
{
if ( x.dn[i] == 0 ) continue;
sum += x.dn[i] % M * mod_exp(2,i-1);
sum %= M;
}
return sum;
}
int main()
{
MM.init(1);
int n, m, a, b, i, j;
while ( scanf("%d%d",&n,&m) != EOF )
{
for ( i = 1; i <= n; i++ )
for (j = 1; j <= n; j++ )
map[i][j] = (i==j) ? 0 : INF;
for ( i = 1; i <= m; i++ )
{
scanf("%d%d",&a,&b);
a++; b++; //注意将边+1,点+1.当然不这么处理也可以··
map[a][b] = map[b][a] = i;
}
Dijkstra ( n );
for ( i = 2; i <= n; i++ )
{
if (d[i] == MM) printf("-1\n");
else printf("%d\n",cal(d[i]));
}
}
return 0;
}