(poj 1986 Distance Queries)<LCA—tarjan>
来源:互联网 发布:字画网络销售 编辑:程序博客网 时间:2024/05/22 16:06
题目
Distance Queries
Time Limit: 2000MS
Memory Limit: 30000K
Description
Farmer John’s cows refused to run in his marathon since he chose a path much too long for their leisurely lifestyle. He therefore wants to find a path of a more reasonable length. The input to this problem consists of the same input as in “Navigation Nightmare”,followed by a line containing a single integer K, followed by K “distance queries”. Each distance query is a line of input containing two integers, giving the numbers of two farms between which FJ is interested in computing distance (measured in the length of the roads along the path between the two farms). Please answer FJ’s distance queries as quickly as possible!
Input
Lines 1..1+M: Same format as “Navigation Nightmare”
Line 2+M: A single integer, K. 1 <= K <= 10,000
Lines 3+M..2+M+K: Each line corresponds to a distance query and contains the indices of two farms.
Output
Lines 1..K: For each distance query, output on a single line an integer giving the appropriate distance.
Sample Input
7 6
1 6 13 E
6 3 9 E
3 5 7 S
4 1 3 N
2 4 20 W
4 7 2 S
3
1 6
1 4
2 6
Sample Output
13
3
36
直接忽略字母
#include<cstdio>#include<iostream>#include<algorithm>#include<cstring>using namespace std;const int MAXN=40010;int n,m,k;struct node{ int to,nxt,val;}e[MAXN*2],E[MAXN*2];int head[MAXN],head2[MAXN];int cnt,tot;bool vis[MAXN];int f[MAXN];int dis[MAXN];int ans[MAXN];int _find(int x){ if(f[x]==-1) return x; f[x]=_find(f[x]); return f[x];}void add(int f,int t,int v){ cnt++; e[cnt].to=t; e[cnt].nxt=head[f]; e[cnt].val=v; head[f]=cnt;}void add_edge(int f,int t,int i){ tot++; E[tot].to=t; E[tot].nxt=head2[f]; E[tot].val=i; head2[f]=tot;}void tarjan(int u){ vis[u]=1; for(int i=head[u];i!=-1;i=e[i].nxt){ int v=e[i].to; if(!vis[v]){ dis[v]=dis[u]+e[i].val; tarjan(v); f[v]=u; } } for(int i=head2[u];i!=-1;i=E[i].nxt){ int v=E[i].to; int num=E[i].val; if(vis[v]){ ans[num]=dis[v]+dis[u]-2*dis[_find(v)]; } }}int main(){ memset(f,-1,sizeof(f));// !!! memset(head,-1,sizeof(head)); memset(head2,-1,sizeof(head2)); scanf("%d%d",&n,&m); int a,b,c; char r; for(int i=1;i<=m;++i){ scanf("%d%d%d",&a,&b,&c); scanf("%c",&r); scanf("%c",&r); add(a,b,c);add(b,a,c); } scanf("%d",&k); for(int i=1;i<=k;++i){ scanf("%d%d",&a,&b); add_edge(a,b,i);add_edge(b,a,i); } tarjan(1); for(int i=1;i<=k;i++) printf("%d\n",ans[i]); return 0;}
- (poj 1986 Distance Queries)<LCA—tarjan>
- POJ---1986-Distance Queries(LCA-Tarjan)
- POJ 1986Distance Queries tarjan求LCA
- POJ 1986 Distance Queries (Tarjan-LCA算法)(带权值)
- POJ 1986 Distance Queries(LCA Tarjan离线算法)
- POJ 1986 Distance Queries(离线tarjan-LCA)
- poj 1986 Distance Queries(LCA离线Tarjan算法)
- POJ 1986 Distance Queries LCA离线算法tarjan
- POJ 1986Distance Queries(LCA)
- POJ 1986 Distance Queries(求最近公共祖先,LCA-Tarjan)
- POJ 1986 Distance Queries [LCA]
- poj 1986 Distance Queries LCA
- POJ 1986 Distance Queries(LCA)
- poj 1986 Distance Queries (LCA)
- POJ 1986 Distance Queries LCA
- [POJ 1986] Distance Queries (LCA)
- Distance Queries - POJ 1986 LCA
- poj 1986 Distance Queries(LCA)
- Tinkoff Challenge
- Linux下的tar压缩解压缩命令详解
- Python编程:从入门到实践读书笔记-8 函数
- Win7 SSH Secure connect Ubuntu: Server responded "Algorithm negotiation failed"
- 设计模式之面向对象
- (poj 1986 Distance Queries)<LCA—tarjan>
- RMI
- spring的部分注解
- 关于在SSH环境下struts校验遇到的问题
- Django学习之模型的操作详解
- SpringMVC 拦截器不拦截静态资源的三种处理方式方法
- 关于zoom的缩放
- Git常用命令
- 软件工程之版本控制工具Git,SVN