传送门:【HDU】2433 Travel
题目分析:本题有个很直观的思想,对于每次删边都floyd一次得到新的结果,但是这样子复杂度太大,为O(n*m*m)级的,妥妥的要超时。但是我们不妨另辟蹊径,对于以一个点为起点到其他所有点的最短路一定会构成一棵最短路树,也就是说只有n-1条边和从这个点出发的最短路有关,如果删去这n-1条边以外的点对从这个点出发的最短路是不会影响的!。
于是我们一开始可以先来n次最短路得到以每个点为起点的最短路树,得到最初的解ans。然后枚举删除每条边,枚举每条边的时候枚举每个点,如果这条边在某个点的最短路树上,则删除这条边再以该点为起点做一次最短路,得到新的以这个点出发的最短路之和。将增量加到ans上,枚举完以后输出。
通过这一层优化以后,算法的复杂度降为O(n*n*m)了,已经可以接受了。
至此可见优化的重要性!
PS:网上很多枚举每条边时最多两次最短路的我没发现几个对的(事实是我还没看到正确的)。
代码如下:
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std ;
#define REP( i , a , b ) for ( int i = ( a ) ; i < ( b ) ; ++ i )
#define FOR( i , a , b ) for ( int i = ( a ) ; i <= ( b ) ; ++ i )
#define REV( i , a , b ) for ( int i = ( a ) ; i >= ( b ) ; -- i )
#define travel( e , H , u ) for ( Edge* e = H[u] ; e ; e = e -> next )
#define CLR( a , x ) memset ( a , x , sizeof a )
typedef int type_c ;
typedef long long LL ;
const int MAXN = 105 ;
const int MAXM = 3005 ;
const int MAXH = 6005 ;
const int MAXE = 6005 ;
const int INF = 0x3f3f3f3f ;
struct Edge {
int v ;
type_c c ;
Edge* next ;
} ;
struct Road {
int u , v ;
void input () {
scanf ( "%d%d" , &u , &v ) ;
}
} ;
struct Heap {
type_c v ;
int idx ;
Heap () {}
Heap ( type_c v , int idx ) : v ( v ) , idx ( idx ) {}
bool operator < ( const Heap& a ) const {
return v < a.v ;
}
} ;
struct priority_queue {
Heap h[MAXH] ;
int point ;
priority_queue () : point ( 1 ) {}
void clear () {
point = 1 ;
}
void maintain ( int o ) {
int p = o , l = o << 1 , r = o << 1 | 1 ;
while ( o > 1 && h[o] < h[o >> 1] ) {
swap ( h[o] , h[o >> 1] ) ;
o >>= 1 ;
}
o = p ;
while ( o < point ) {
if ( l < point && h[l] < h[p] ) p = l ;
if ( r < point && h[r] < h[p] ) p = r ;
if ( p == o ) break ;
swap ( h[o] , h[p] ) ;
o = p , l = o << 1 , r = o << 1 | 1 ;
}
}
void push ( type_c v , int idx ) {
h[point] = Heap ( v , idx ) ;
maintain ( point ++ ) ;
}
void pop () {
h[1] = h[-- point] ;
maintain ( 1 ) ;
}
bool empty () {
return point == 1 ;
}
int front () {
return h[1].idx ;
}
} ;
struct Shortest_Path_Algorithm {
priority_queue q ;
Edge E[MAXE] , *H[MAXN] , *cur ;
type_c d[MAXN] ;
bool vis[MAXN] ;
int Q[MAXN] , head , tail ;
int use_edge[MAXN] ;
void init () {
cur = E ;
CLR ( H , 0 ) ;
}
void addedge ( int u , int v , type_c c ) {
cur -> v = v ;
cur -> c = c ;
cur -> next = H[u] ;
H[u] = cur ++ ;
}
int dijkstra ( int s , int n , bool used[] , bool ch ) {
q.clear () ;
CLR ( vis , 0 ) ;
CLR ( d , INF ) ;
if ( ch ) CLR ( use_edge , 0 ) ;
d[s] = 0 ;
q.push ( d[s] , s ) ;
while ( !q.empty () ) {
int u = q.front () ;
q.pop () ;
if ( vis[u] ) continue ;
vis[u] = 1 ;
travel ( e , H , u ) {
int v = e -> v ;
if ( d[v] > d[u] + e -> c ) {
if ( ch ) use_edge[v] = e - E ;
d[v] = d[u] + e -> c ;
q.push ( d[v] , v ) ;
}
}
}
if ( ch ) FOR ( i , 1 , n ) used[use_edge[i] >> 1] = 1 ;
int ans = 0 ;
FOR ( i , 1 , n ) {
if ( d[i] == INF ) return INF ;
else ans += d[i] ;
}
return ans ;
}
int spfa ( int s , int n , bool used[] , bool ch ) {
head = tail = 0 ;
CLR ( d , INF ) ;
CLR ( vis , 0 ) ;
if ( ch ) CLR ( use_edge , 0 ) ;
d[s] = 0 ;
Q[tail ++] = s ;
while ( head != tail ) {
int u = Q[head ++] ;
if ( head == MAXN ) head = 0 ;
vis[u] = 0 ;
travel ( e , H , u ) {
int v = e -> v ;
if ( d[v] > d[u] + e -> c ) {
d[v] = d[u] + e -> c ;
if ( ch ) use_edge[v] = e - E ;
if ( !vis[v] ) {
vis[v] = 1 ;
if ( d[v] < d[Q[head]] ) {
if ( head == 0 ) head = MAXN ;
Q[-- head] = v ;
} else {
Q[tail ++] = v ;
if ( tail == MAXN ) tail = 0 ;
}
}
}
}
}
if ( ch ) FOR ( i , 1 , n ) used[use_edge[i] >> 1] = 1 ;
int ans = 0 ;
FOR ( i , 1 , n ) {
if ( d[i] == INF ) return INF ;
else ans += d[i] ;
}
return ans ;
}
} G ;
int n , m ;
Road road[MAXM] ;
int sum[MAXN] , ans ;
bool used[MAXN][MAXE] ;
void scanf ( int& x , char c = 0 ) {
while ( ( c = getchar () ) < '0' || c > '9' ) ;
x = c - '0' ;
while ( ( c = getchar () ) >= '0' && c <= '9' ) x = x * 10 + c - '0' ;
}
void solve () {
ans = 0 ;
G.init () ;
FOR ( i , 1 , n ) CLR ( used[i] , 0 ) ;
REP ( i , 0 , m ) {
scanf ( road[i].u ) , scanf ( road[i].v ) ;
G.addedge ( road[i].u , road[i].v , 1 ) ;
G.addedge ( road[i].v , road[i].u , 1 ) ;
}
FOR ( i , 1 , n ) {
sum[i] = G.spfa ( i , n , used[i] , 1 ) ;
if ( sum[i] == INF ) {
ans = INF ;
break ;
} else ans += sum[i] ;
}
REP ( i , 0 , m ) {
if ( ans == INF ) {
printf ( "INF\n" ) ;
continue ;
}
int S = ans ;
G.E[i << 1].c = G.E[i << 1 | 1].c = INF ;
FOR ( u , 1 , n ) if ( used[u][i] ) {
int tmp = G.spfa ( u , n , used[u] , 0 ) ;
if ( tmp == INF ) {
S = INF ;
break ;
} else S += tmp - sum[u] ;
}
G.E[i << 1].c = G.E[i << 1 | 1].c = 1 ;
if ( S == INF ) printf ( "INF\n" ) ;
else printf ( "%d\n" , S ) ;
}
}
int main () {
while ( ~scanf ( "%d%d" , &n , &m ) ) solve () ;
}