soj上一个fuckable的题目

题目链接:http://cs.scu.edu.cn/soj/problem.action?id=3098

题目概述:

Description

Once again, James Bond is on his way to saving the world. Bond's latest mission requires
him to travel between several pairs of cities in a certain country.

The country has N cities (numbered by 1, 2, . . ., N), connected by M bidirectional roads.
Bond is going to steal a vehicle, and drive along the roads from city s to city t.
The country's police will be patrolling the roads, looking for Bond, however, not all
roads get the same degree of attention from the police.

More formally, for each road MI6 has estimated its dangerousness, the higher it is,
the more likely Bond is going to be caught while driving on this road. Dangerousness
of a path from s to t is defined as the maximum dangerousness of any road on this path.

Now, it's your job to help Bond succeed in saving the world by finding the least dangerous
paths for his mission.

Input

There will be at most 5 cases in the input file.

The first line of each case contains two integers N, M (2 ≤ N≤ 50000, 1≤ M ≤ 100000) –
number of cities and roads. The next M lines describe the roads. The i-th of these lines
contains three integers: xi, yi, di (1 ≤ xi, yi ≤ N, 0 ≤ di ≤ 10^9) - the numbers of the
cities connected by the ith road and its dangerousness.

Description of the roads is followed by a line containing an integer Q (1 ≤ Q ≤ 50000), followed
by Q lines, the i-th of which contains two integers si and ti (1 ≤ si, ti  ≤ N, si != ti).

Consecutive input sets are separated by a blank line.

Output

For each case, output Q lines, the i-th of which contains the minimum dangerousness of a path
between cities si and ti. Consecutive output blocks are separated by a blank line.

The input file will be such that there will always be at least one valid path.

Sample Input

4 5
1 2 10
1 3 20
1 4 100
2 4 30
3 4 10
2
1 4
4 1

2 1
1 2 100
1
1 2

Sample Output

20
20

100

Source

Ivan Krasilnikov @ Next generation contest – 4 @ UVA

 

 

解决方案:最小生成树+lca(可以用tarjan,正是因为我想用rmq结果搞得fuckable了)

 

 

 

 

代码:

 #include <iostream> #include <sstream> #include <iomanip> #include <vector> #include <deque> #include <list> #include <set> #include <map> #include <stack> #include <queue> #include <bitset> #include <string> #include <algorithm> #include <functional> #include <cstdio> #include <cstring> #include <cmath> #include <cstdlib> #include <cctype> #include <complex> using namespace std; //使用堆优化的prim算法或者kruskal算法计算最小生成树 //#define PRIM //使用稀疏表或者线段树实现lca-rmq //#define SPARSE_TABLE typedef long long int64; typedef pair<int, int> Pt; #define pb push_back #define mp make_pair const int MAX_NODE = 50005; #ifdef PRIM //堆优化 int heap_pos[MAX_NODE]; int heap[MAX_NODE]; int heap_count; //prim算法基本数据 vector<Pt> prim_adj[MAX_NODE]; int d[MAX_NODE]; int mark[MAX_NODE]; int from[MAX_NODE]; //prim算法输出 vector<Pt> mst[MAX_NODE]; //LCA基本数据 #define lca_edges mst int lca_lev[MAX_NODE]; int lca_E[MAX_NODE<<1], lca_time[MAX_NODE<<1], array[MAX_NODE<<1][18]; int lca_start[MAX_NODE], lca_end[MAX_NODE]; int lca_id, lca_curr_time; //查询的表 Pt st[MAX_NODE][18]; inline void adjust(int root) { int value = d[heap[root]]; int x = heap[root]; int j; for (j = 2*root; j <= heap_count; j <<= 1) { if (j < heap_count && d[heap[j+1]] < d[heap[j]]) ++j; if (value <= d[heap[j]]) break; heap[j>>1] = heap[j]; heap_pos[heap[j>>1]] = j>>1; } heap[j>>1] = x; heap_pos[heap[j>>1]] = j>>1; } inline void adjust_up(int root) { int value = d[heap[root]]; int x = heap[root]; for (; root>>1; root >>= 1) { if (d[heap[root>>1]] <= value) break; heap[root] = heap[root>>1]; heap_pos[heap[root]] = root; } heap[root] = x; heap_pos[heap[root]] = root; } inline void build_heap() { adjust(1); } inline int exact_min() { int pos = heap[1]; heap_pos[heap[heap_count]] = 1; heap[1] = heap[heap_count--]; adjust(1); return pos; } inline int fast_prim(int start, int n, int e_count = 0) { int ans = 0; for (int i = 1; i <= n; ++i) d[i] = 2000000000, heap_pos[i] = heap[i] = from[i] = i; for (int i = 1; i <= n; ++i) mst[i].clear(); d[start] = 0; heap_count = n; build_heap(); for (int i = 0; i < n; ++i) { int pos = exact_min(); ans += d[pos]; { int x = from[pos]; if (x != pos) { mst[pos].push_back(make_pair(x, d[pos])); mst[x].push_back(make_pair(pos, d[pos])); } } int size = prim_adj[pos].size(); for (int j = 0; j < size; ++j) { int next = prim_adj[pos][j].first; int w = prim_adj[pos][j].second; if (w < d[next]) { d[next] = w; from[next] = pos; adjust_up(heap_pos[next]); } } } return ans; } #define cal_mst fast_prim #else //并查集的数据 int p[MAX_NODE]; //knuscal算法基本数据 struct Tri { int s, e, w; }; Tri edges[MAX_NODE<<1]; vector<Pt> mst[MAX_NODE]; //LCA基本数据 #define lca_edges mst int lca_lev[MAX_NODE]; int lca_E[MAX_NODE<<1], lca_time[MAX_NODE<<1], array[MAX_NODE<<1][18]; int lca_start[MAX_NODE], lca_end[MAX_NODE]; int lca_id, lca_curr_time; //查询的表 Pt st[MAX_NODE][18]; inline void link(int x, int y) { if (x == y) return; if (p[x] < p[y]) p[y] = x; else { int t = p[y] == p[x]; p[x] = y; p[y] -= t; } } inline int find(int x) { int r = x; while (p[r] > 0) r = p[r]; while (x != r) { int t = p[x]; p[x] = r; x = t; } return r; } inline void merge(int x, int y) { link(find(x), find(y)); } inline int cmp_by_weight(const Tri& x, const Tri& y) { return x.w < y.w; } inline void kruskal(int start, int n, int m) { int value = 0; sort(edges, edges+m, cmp_by_weight); memset(p, 0, sizeof p); for (int i = 1; i <= n; ++i) mst[i].clear(); int have = 0; for (int i = 0; have < n - 1 && i < m; ++i) { int x = find(edges[i].s); int y = find(edges[i].e); if (x == y) continue; mst[edges[i].s].pb(mp(edges[i].e, edges[i].w)); mst[edges[i].e].pb(mp(edges[i].s, edges[i].w)); merge(x, y); value += edges[i].w; ++have; } } #define cal_mst kruskal #endif void lca_dfs(int root, int parent, int level) { int temp = lca_curr_time++; lca_lev[root] = level; lca_start[root] = lca_id; int size = lca_edges[root].size(); for (int i = 0; i < size; ++i) { int next = lca_edges[root][i].first; if (next == parent) continue; lca_E[lca_id] = root; lca_time[lca_id++] = temp; st[next][0] = make_pair(root, lca_edges[root][i].second); lca_dfs(next, root, level+1); } lca_end[root] = lca_id; lca_E[lca_id] = root; lca_time[lca_id++] = temp; } #ifdef SPARSE_TABLE //稀疏表实现的RMQ inline int RMQ(int id1, int id2) { ++id2; int ii = (int)(log(double(id2-id1))/log(2.0)); if (lca_time[array[id1][ii]] < lca_time[array[id2-(1<<ii)][ii]]) return lca_E[array[id1][ii]]; return lca_E[array[id2-(1<<ii)][ii]]; } #define start lca_start #define end lca_end inline int LCA(int id1, int id2) { if (start[id1] < start[id2] && end[id2] < end[id1]) return id1; if (start[id2] < start[id1] && end[id1] < end[id2]) return id2; if (start[id1] > end[id2]) return RMQ(end[id2], start[id1]); return RMQ(end[id1], start[id2]); } #else //线段树实现的RMQ int lca_tree[MAX_NODE<<3]; int lca_L[MAX_NODE<<1]; inline void lca_build_tree(int root, int l, int r) { if (l == r) { lca_tree[root] = l; return; } int mid = (l+r)>>1, lc = root << 1, rc = lc + 1; lca_build_tree(lc, l, mid); lca_build_tree(rc, mid+1, r); if (lca_L[lca_tree[lc]] < lca_L[lca_tree[rc]]) lca_tree[root] = lca_tree[lc]; else lca_tree[root] = lca_tree[rc]; } inline int lca_query(int root, int l, int r, int a, int b) { if (l == a && r == b) return lca_tree[root]; int mid = (l+r)>>1, lc = root << 1, rc = lc + 1; if (b <= mid) return lca_query(lc, l, mid, a, b); else if (a > mid) return lca_query(rc, mid+1, r, a, b); int x = lca_query(lc, l, mid, a, mid); int y = lca_query(rc, mid+1, r, mid+1, b); return lca_L[x] < lca_L[y] ? x : y; } inline int LCA(int u, int v) { int r1 = lca_start[u], r2 = lca_start[v], t; if (r1 <= r2) t = lca_query(1, 1, lca_id-1, r1, r2); else t = lca_query(1, 1, lca_id-1, r2, r1); return lca_E[t]; } #endif inline void lca_init(int root, int n) { lca_id = 1, lca_curr_time = 1; lca_dfs(root, -1, 1); #ifdef SPARSE_TABLE for (int i = 1; i < lca_id; ++i) array[i][0] = i; for (int k = 1; (1<<k) < lca_id; ++k) for (int i = 1; i + (1<<k) <= lca_id; ++i) if (lca_time[array[i][k-1]] < lca_time[array[i+(1<<(k-1))][k-1]]) array[i][k] = array[i][k-1]; else array[i][k] = array[i+(1<<(k-1))][k-1]; #else for (int i = 1; i < lca_id; ++i) lca_L[i] = lca_lev[lca_E[i]]; lca_build_tree(1, 1, lca_id-1); #endif } inline int query(int id1, int id2) { int ans = 0; while (lca_lev[id1] > lca_lev[id2]) { int i; for (i = 0; lca_lev[id1]-(1<<i) >= lca_lev[id2]; ++i); --i; if (st[id1][i].second > ans) ans = st[id1][i].second; id1 = st[id1][i].first; } return ans; } int main() { int n, m; int first = 1; while (scanf("%d%d", &n, &m) == 2) { if (first == 1) first = 2; else puts(""); #ifdef PRIM for (int i = 1; i <= n; ++i) prim_adj[i].clear(); for (int i = 0; i < m; ++i) { int s, e, v;scanf("%d%d%d", &s, &e, &v); prim_adj[s].push_back(make_pair(e, v)); prim_adj[e].push_back(make_pair(s, v)); } #else for (int i = 0; i < m; ++i) { scanf("%d%d%d", &edges[i].s, &edges[i].e, &edges[i].w); } #endif cal_mst(1, n, m); lca_init(1, n); st[1][0].first = 1; st[1][0].second = 0; for (int k = 1; (1<<k) <= n; ++k) for (int i = n; i >= 1; --i) { int ii = st[i][k-1].first; st[i][k].first = st[ii][k-1].first; st[i][k].second = max(st[i][k-1].second, st[ii][k-1].second); } int q;scanf("%d", &q); while (q--) { int s, e;scanf("%d%d", &s, &e); int lca = LCA(s, e); printf("%d/n", max(query(s, lca), query(e, lca))); } } return 0; }