传送门:【HDU】1598 find the most comfortable road
题目分析:二分速度差mid,然后以枚举以每条边的速度speed作为速度下限,speed+mid作为上限,然后最短路的时候只用走边的速度在下限以及上限之内的边,如果存在s到t的路则调整二分上界,否则调整二分下界。
其实BFS应该就够了吧?
代码如下:
#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 CLR( a , x ) memset ( a , x , sizeof a )
const int MAXN = 205 ;
const int MAXH = 2005 ;
const int MAXE = 2005 ;
const int INF = 0x3f3f3f3f ;
struct Edge {
int v , c , n ;
Edge () {}
Edge ( int v , int c , int n ) : v ( v ) , c ( c ) , n ( n ) {}
} ;
struct Heap {
int v , idx ;
Heap () {}
Heap ( int v , int idx ) : v ( v ) , idx ( idx ) {}
bool operator < ( const Heap& a ) const {
return v < a.v ;
}
} ;
struct priority_queue {
Heap heap[MAXH] ;
int point ;
priority_queue () : point ( 1 ) {}
void clear () {
point = 1 ;
}
bool empty () {
return point == 1 ;
}
void maintain ( int o ) {
int x = o ;
while ( o > 1 && heap[o] < heap[o >> 1] ) {
swap ( heap[o] , heap[o >> 1] ) ;
o >>= 1 ;
}
o = x ;
int p = o , l = o << 1 , r = o << 1 | 1 ;
while ( o < point ) {
if ( l < point && heap[l] < heap[p] ) p = l ;
if ( r < point && heap[r] < heap[p] ) p = r ;
if ( p == o ) break ;
swap ( heap[o] , heap[p] ) ;
o = p , l = o << 1 , r = o << 1 | 1 ;
}
}
void push ( int v , int idx ) {
heap[point] = Heap ( v , idx ) ;
maintain ( point ++ ) ;
}
void pop () {
heap[1] = heap[-- point] ;
maintain ( 1 ) ;
}
int front () {
return heap[1].idx ;
}
Heap top () {
return heap[1] ;
}
} ;
struct Shortest_Path_Algorithm {
priority_queue q ;
Edge E[MAXE] ;
int H[MAXN] , cur ;
int d[MAXN] ;
bool vis[MAXN] ;
int Q[MAXN] , head , tail ;
void init () {
cur = 0 ;
CLR ( H , -1 ) ;
}
void addedge ( int u , int v , int c ) {
E[cur] = Edge ( v , c , H[u] ) ;
H[u] = cur ++ ;
}
int dijkstra ( int s , int t , int l , int r ) {
q.clear () ;
CLR ( d , INF ) ;
CLR ( vis , 0 ) ;
d[s] = 0 ;
q.push ( d[s] , s ) ;
while ( !q.empty () ) {
int u = q.front () ;
if ( u == t ) return 1 ;
q.pop () ;
if ( vis[u] ) continue ;
vis[u] = 1 ;
for ( int i = H[u] ; ~i ; i = E[i].n ) {
int v = E[i].v , c = E[i].c ;
if ( c < l || c > r ) continue ;
if ( d[v] > d[u] + 1 ) {
d[v] = d[u] + 1 ;
q.push ( d[v] , v ) ;
}
}
}
return 0 ;
}
void spfa ( int s , int t ) {
head = tail = 0 ;
CLR ( d , INF ) ;
CLR ( vis , 0 ) ;
d[s] = 0 ;
Q[tail ++] = s ;
while ( head != tail ) {
int u = Q[head ++] ;
if ( head == MAXN ) head = 0 ;
vis[u] = 0 ;
for ( int i = H[u] ; ~i ; i = E[i].n ) {
int v = E[i].v , c = E[i].c ;
if ( d[v] > d[u] + c ) {
d[v] = d[u] + c ;
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 ;
}
}
}
}
}
}
} G ;
int n , m , q ;
int s , t ;
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 () {
int u , v , c ;
int minv = INF , maxv = 0 ;
G.init () ;
REP ( i , 0 , m ) {
scanf ( u ) , scanf ( v ) , scanf ( c ) ;
G.addedge ( u , v , c ) ;
G.addedge ( v , u , c ) ;
if ( minv > c ) minv = c ;
if ( maxv < c ) maxv = c ;
}
scanf ( "%d" , &q ) ;
while ( q -- ) {
scanf ( "%d%d" , &s , &t ) ;
int l = 0 , r = maxv - minv ;
while ( l < r ) {
int mid = ( l + r ) >> 1 ;
bool flag = 0 ;
REP ( i , 0 , m ) {
int low_limit = G.E[i << 1].c ;
int high_limit = G.E[i << 1].c + mid ;
flag = G.dijkstra ( s , t , low_limit , high_limit ) ;
if ( flag ) break ;
}
if ( flag ) r = mid ;
else l = mid + 1 ;
}
if ( l == maxv - minv ) printf ( "-1\n" ) ;
else printf ( "%d\n" , l ) ;
}
}
int main () {
while ( ~scanf ( "%d%d" , &n , &m ) ) solve () ;
return 0 ;
}