SRM 615 D1L2: LongLongTripDiv1

题目:http://community.topcoder.com/stat?c=problem_statement&pm=13090

参考:http://apps.topcoder.com/wiki/display/tc/SRM+615?decorator=printable

转换为最短路径模型这一步挺难想的.

代码:

#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <iostream>
#include <sstream>
#include <iomanip>

#include <bitset>
#include <string>
#include <vector>
#include <stack>
#include <deque>
#include <queue>
#include <set>
#include <map>

#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <cstring>
#include <ctime>
#include <climits>
using namespace std;

#define CHECKTIME() printf("%.2lf\n", (double)clock() / CLOCKS_PER_SEC)
typedef pair<int, int> pii;
typedef long long llong;
typedef pair<llong, llong> pll;
#define mkp make_pair

/*************** Program Begin **********************/
int g[51][51];
long long dist[20001][51];
const long long INF = 0x7f7f7f7f7f7f7f7f;

class LongLongTripDiv1 {
public:
    string isAble(int N, vector <int> A, vector <int> B, vector <int> D, long long T) {
	memset(g, 0, sizeof(g));
	memset(dist, 0x7f, sizeof(dist));

	for (int i = 0; i < A.size(); ++i) {
		g[ A[i] ][ B[i] ] = g[ B[i] ][ A[i] ] = D[i];
	}	
	int d = 10001;
	for (int i = 0; i < A.size(); ++i) {
		if (0 == A[i] || 0 == B[i]) {
			d = min(d, D[i]);
		}
	}	
	if (d > 10000) {
		return "Impossible";
	}
	std::set< pair<long long, pii> > Q;
	Q.insert(mkp(0, mkp(0, 0)));
	dist[0][0] = 0;
	pii cur;
	while (!Q.empty()) {
		cur = (*Q.begin()).second;
		int u = cur.second;
		int v = cur.first;
		long long m = (*Q.begin()).first;
		Q.erase(Q.begin());
		for (int i = 0; i < N; ++i) {
			if (g[u][i]) {
				int w = (v + g[u][i]) % (2 * d);
				long long temp = m + g[u][i];
				if (temp < dist[w][i]) {
					std::set<pair<long long, pii> >::iterator it = Q.find(mkp(dist[w][i], mkp(w, i)));
					if (it != Q.end()) {
						Q.erase(it);
					}
					dist[w][i] = temp;
					Q.insert(mkp(dist[w][i], mkp(w, i)));
				}
			}
		}
	}
	if (dist[T % (2 * d)][N - 1] <= T) {
		return "Possible";
	} else {
		return "Impossible";
	}
    }

};

/************** Program End ************************/