【HDU】2145 zz's Mysterious Present

传送门：【HDU】2145 zz's Mysterious Present

题目分析：建反图然后做最短路，一开始wa的凄惨结果发现是重载小于号里面爆int了。。

代码如下：

#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 = 305 ;
const int MAXH = 5005 ;
const int MAXE = 5005 ;
const int INF = 0x3f3f3f3f ;

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

struct Point {
	int speed , dist , idx ;
	Point () {}
	Point ( int speed , int dist , int idx ) : speed ( speed ) , dist ( dist ) , idx ( idx ) {}
	bool operator < ( const Point& a ) const {
		if ( ( LL ) speed * a.dist != ( LL ) a.speed * dist ) return ( LL ) dist * a.speed < ( LL ) a.dist * speed ;
		return dist != a.dist ? dist > a.dist : idx > a.idx ;
	}
} ;

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 ;
	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 ++ ;
	}
	void dijkstra ( int s ) {
		q.clear () ;
		CLR ( vis , 0 ) ;
		CLR ( d , INF ) ;
		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 ) {
					d[v] = d[u] + e -> c ;
					q.push ( d[v] , v ) ;
				}
			}
		}
	}
	void spfa ( int s ) {
		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 ;
			travel ( e , H , u ) {
				int v = e -> v ;
				if ( d[v] > d[u] + e -> c ) {
					d[v] = d[u] + e -> 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 ;

Point p[MAXN] ;
int n , m , k ;
int s , t[MAXN] ;

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 , speed ;
	G.init () ;
	while ( k -- ) {
		scanf ( u ) , scanf ( v ) , scanf ( c ) ;
		G.addedge ( v , u , c ) ;
	}
	scanf ( s ) ;
	G.spfa ( s ) ;
	FOR ( i , 1 , m ) scanf ( t[i] ) ;
	FOR ( i , 1 , m ) {
		scanf ( speed ) ;
		p[i] = Point ( speed , G.d[t[i]] , i ) ;
	}
	sort ( p + 1 , p + m + 1 ) ;
	FOR ( i , 1 , m )
		if ( p[i].dist != INF ) {
			printf ( "%d\n" , p[i].idx ) ;
			return ;
		}
	printf ( "No one\n" ) ;
}

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