【HDU】3001 Travelling 状压最短路

传送门：【HDU】3001 Travelling

题目分析：每个城市能经过至多两次，那么我们就需要3进制保存城市经过的次数。然后就是普通的状态压缩最短路了。

代码如下：

#include <map>
#include <string>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std ;

typedef long long LL ;

#define travel( e , H , u ) for ( Edge* e = H[u] ; e ; e = e -> next )
#define rep( i , a , b ) for ( int i = ( a ) ; i <  ( b ) ; ++ i )
#define rev( i , a , b ) for ( int i = ( a ) ; i >= ( b ) ; -- i )
#define FOR( i , a , b ) for ( int i = ( a ) ; i <= ( b ) ; ++ i )
#define clr( a , x ) memset ( a , x , sizeof a )
#define cpy( a , x ) memcpy ( a , x , sizeof a )

const int MAXN = 60005 ;
const int MAXH = 1000005 ;
const int MAXE = 1000005 ;
const int INF = 0x3f3f3f3f ;

struct Edge {
	int v , c ;
	Edge* next ;
} ;

struct Node {
	int d , idx , u ;
	Node () {}
	Node ( int d , int idx , int u ) : d ( d ) , idx ( idx ) , u ( u ) {}
	bool operator < ( const Node& a ) const {
		return d < a.d ;
	}
} ;

struct priority_queue {
	Node heap[MAXH] ;
	int point ;
	priority_queue () : point ( 1 ) {}
	
	void clear () {
		point = 1 ;
	}
	
	int empty () {
		return point == 1 ;
	}
	
	void maintain ( int o ) {
		int p = o , l = o << 1 , r = o << 1 | 1 ;
		while ( o > 1 && heap[o] < heap[o >> 1] ) {
			swap ( heap[o] , heap[o >> 1] ) ;
			o >>= 1 ;
		}
		o = p ;
		while ( 1 ) {
			if ( l < point && heap[l] < heap[p] ) p = l ;
			if ( r < point && heap[r] < heap[p] ) p = r ;
			if ( p == o ) break ;
			swap ( heap[p] , heap[o] ) ;
			o = p , l = o << 1 , r = o << 1 | 1 ;
		}
	}
	
	void push ( int d , int idx , int u ) {
		heap[point] = Node ( d , idx , u ) ;
		maintain ( point ++ ) ;
	}
	
	void pop () {
		heap[1] = heap[-- point] ;
		maintain ( 1 ) ;
	}
	
	Node top () {
		return heap[1] ;
	}
} ;

struct Dij {
	priority_queue q ;
	Edge E[MAXE] , *H[MAXN] , *edge ;
	
	int d[10][MAXN] ;
	bool vis[10][MAXN] ;
	int pow[11] ;
	
	void clear () {
		edge = E ;
		clr ( H , 0 ) ;
		pow[0] = 1 ;
		rep ( i , 1 , 11 ) pow[i] = pow[i - 1] * 3 ;
	}
	
	void addedge ( int u , int v , int c ) {
		edge -> v = v ;
		edge -> c = c ;
		edge -> next = H[u] ;
		H[u] = edge ++ ;
	}
	
	int encode ( int x , int v ) {
		return x + pow[v] ;
	}
	
	int visit_time ( int x , int v ) {
		return x / pow[v] % 3 ;
	}
	
	int visit_all ( int n , int x ) {
		rep ( i , 0 , n ) {
			if ( x % 3 == 0 ) return 0 ;
			x /= 3 ;
		}
		return 1 ;
	}
	
	int dijkstra ( int n ) {
		q.clear () ;
		clr ( d , INF ) ;
		clr ( vis , 0 ) ;
		rep ( i , 0 , n ) {
			int s = encode ( 0 , i ) ;
			d[i][s] = 0 ;
			q.push ( d[i][s] , s , i ) ;
		}
		while ( !q.empty () ) {
			Node tmp = q.top () ;
			q.pop () ;
			int idx = tmp.idx , u = tmp.u ;
			if ( visit_all ( n , tmp.idx ) ) return tmp.d ;
			if ( vis[u][idx] ) continue ;
			vis[u][idx] = 1 ;
			travel ( e , H , u ) {
				int v = e -> v ;
				int next_idx = encode ( idx , v ) ;
				if ( visit_time ( idx , v ) < 2 && d[v][next_idx] > d[u][idx] + e -> c ) {
					d[v][next_idx] = d[u][idx] + e -> c ;
					q.push ( d[v][next_idx] , next_idx , v ) ;
				}
			}
		}
		return -1 ;
	}
} e ;

int n , m ;

void solve () {
	int x , y , c ;
	e.clear () ;
	while ( m -- ) {
		scanf ( "%d%d%d" , &x , &y , &c ) ;
		-- x , -- y ;
		e.addedge ( x , y , c ) ;
		e.addedge ( y , x , c ) ;
	}
	printf ( "%d\n" , e.dijkstra ( n ) ) ;
}

int main () {
	while ( ~scanf ( "%d%d" , &n , &m ) ) solve () ;
	return 0 ;
}