POJ 3114 Countries in War 缩点+最短路(好题)
来源:互联网 发布:华为 穆斯林 知乎 编辑:程序博客网 时间:2024/05/21 08:43
Description
In the year 2050, after different attempts of the UN to maintain peace in the world, the third world war broke out. The importance of industrial, commercial and military secrets obliges all the countries to use extremely sophisticated espionage services, so that each city in the world has at least one spy of each country. These spies need to communicate with other spies, informers as well as their headquarters during their actions. Unluckily there doesn’t exist a secure way for a spy to communicate during the war period, therefore the messages are always sent in code so that only the addressee is able to read the message and understand its meaning.
The spies use the only service that functions during the war period, the post. Each city has a postal agency where the letters are sent. The letters can be sent directly to their destination or to other postal agencies, until the letter arrives at the postal agency of the destination city, if possible.
The postal agency in city A can send a printed letter to the postal agency in city B if there is an agreement on sending letters, which determines the time, in hours, that a letter takes to reach city B from city A (and not necessarily the opposite). If there is no agreement between the agencies A and B, the agency A can try to send the letter to any agency so that the letter can reach its destination as early as possible
Some agencies are connected with electronic communication media, such as satellites and optical fibers. Before the war, these connections could reach all the agencies, making that a letter could be sent instantly. But during the period of hostilities every country starts to control electronic communication and an agency can only send a letter to another agency by electronic media (or instantly) if they are in the same country. Two agencies, A and B, are in the same country if a printed letter sent from any one of the agencies can be delivered to the other one.
The espionage service of your country has managed to obtain the content of all the agreements on sending messages existing in the world and desires to find out the minimum time to send a letter between different pairs of cities. Are you capable of helping them?
Input
The input contains several test cases. The first line of each test case contains two integer separated by a space, N (1 ≤ N ≤ 500) and E (0 ≤ E ≤ N2), indicating the numbers of cities (numbered from 1 to N) and of agreements on sending messages, respectively. Following them, then, E lines, each containing three integers separated by spaces, X, Y and H (1 ≤ X, Y ≤ N, 1 ≤ H ≤ 1000), indicating that there exist an agreement to send a printed letter from city X to city Y, and that such a letter will be delivered in H hours.
After that, there will be a line with an integer K (0 ≤ K ≤ 100), the number of queries. Finally, there will be K lines, each representing a query and containing two integers separated by a space, O and D (1 ≤ O, D ≤ N). You must determine the minimum time to send a letter from city O to city D.
The end of the input is indicated by N = 0.
Output
For each test case your program should produce K lines of output. The I-th line should contain an integer M, the minimum time, in hours, to send a letter in the I-th query. If there aren’t communication media between the cities of the query, you should print “Nao e possivel entregar a carta” (“It’s impossible to deliver the letter”).
Print a blank line after each test case.
Sample Input
4 51 2 52 1 103 4 84 3 72 3 651 21 31 44 34 13 31 2 102 3 13 2 131 33 13 20 0
Sample Output
0660Nao e possivel entregar a carta10Nao e possivel entregar a carta0
Source
#include<stdio.h>#include<string.h>#include<algorithm>#define M 507#define inf 0x3f3f3fusing namespace std;int n,m,cnt,num,id,scnt;int g[M][M],dfn[M],low[M],stack[M];int map[M][M],belong[M],vis[M],head[M],dis[M],viss[M];struct E{ int v,next;}edg[M*M];void addedge(int u,int v){ edg[num].v=v; edg[num].next=head[u]; head[u]=num++;}void init()//初始化{ memset(head,-1,sizeof(head)); memset(vis,0,sizeof(vis)); memset(dfn,0,sizeof(dfn)); memset(low,0,sizeof(low)); memset(belong,0,sizeof(belong)); for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) if(i!=j) g[i][j]=map[i][j]=inf; else g[i][j]=map[i][j]=0; cnt=num=scnt=id=0;}void tarjan(int x)//求强连通分量{ int v; dfn[x]=low[x]=++cnt; stack[id++]=x; vis[x]=1; for(int u=head[x];u!=-1;u=edg[u].next) { v=edg[u].v; if(!dfn[v]) { tarjan(v); low[x]=min(low[x],low[v]); } else if(vis[v]) low[x]=min(dfn[v],low[x]); } if(low[x]==dfn[x]) { scnt++; do { v=stack[--id]; belong[v]=scnt; vis[v]=0; }while(v!=x); }}void dijkstra(int u,int v)//求最短路{ int pos,minn; for(int i=1;i<=scnt;i++) { dis[i]=map[u][i]; viss[i]=0; } viss[u]=1; dis[u]=0; for(int i=1;i<scnt;i++) { minn=inf; pos=1; for(int j=1;j<=scnt;j++) if(!viss[j]&&minn>dis[j]) { minn=dis[j]; pos=j; } viss[pos]=1; for(int j=1;j<=scnt;j++) if(!viss[j]&&dis[j]>dis[pos]+map[pos][j]) dis[j]=dis[pos]+map[pos][j]; } if(dis[v]==inf)//找不到路径 printf("Nao e possivel entregar a carta\n"); else printf("%d\n",dis[v]);}int main(){ while(scanf("%d%d",&n,&m)&&n!=0)//当n为0时,结束 { init(); int a,b,c,k; for(int i=1;i<=m;i++) { scanf("%d%d%d",&a,&b,&c); if(g[a][b]>c) g[a][b]=c; addedge(a,b); } for(int i=1;i<=n;i++) if(!dfn[i]) tarjan(i); for(int i=1;i<=n;i++)//重新建图 for(int j=1;j<=n;j++) if(i!=j&&belong[i]!=belong[j]&&g[i][j]!=inf) { map[belong[i]][belong[j]]=min(g[i][j],map[belong[i]][belong[j]]); } scanf("%d",&k); while(k--) { scanf("%d%d",&a,&b); if(belong[a]==belong[b])//在同一个国家 printf("0\n"); else//不在同一个国家 dijkstra(belong[a],belong[b]); } printf("\n"); } return 0;}
- POJ 3114 Countries in War 缩点+最短路(好题)
- poj 3114 Countries in War(缩点+最短路)
- POJ 3114 Countries in War 最短路+tarjan缩点
- POJ 3114 Countries in War(强连通+最短路)
- poj -- 3114 Countries in War(强连通+最短路)
- poj 3114 Countries in War(强连通分量缩点+spfa求最短路)
- POJ 3114 - Countries in War(强连通分量+缩点+拓扑排序+DAG最短路)
- poj 3114 Countries in War(强连通分支缩点+最短路)
- poj 3114 Countries in War(强连通缩点+最短路)
- Countries in War poj 3114 (有向图的双连通分量+缩点+最短路flyod)
- 【强连通缩点+最短路】 POJ 3114 Countries in War
- poj 3114 Countries in War--强连通分量+最短路
- poj 3114 Countries in War(强连通分量+最短路)
- 【POJ】3114 Countries in War 强连通+最短路
- POJ 3114 Countries in War 强连通+最短路
- POJ 3114 Countries in War(强连通分量+最短路)
- POJ 3114 Countries in War(强连通分量 最短路)
- POJ3114 Countries in War 强连通缩点 + 最短路
- quatz 2.x 使用教程
- 在arm上编译madplay [转]
- UNIX tty command and file command?
- c++中内存分配方式
- 安装10.9 出现library kext com.apple.driver.IOPlatformPluginFamily not found.
- POJ 3114 Countries in War 缩点+最短路(好题)
- oracle 的日期 between and 用法
- spring mvc 接收时间参数
- DSP工程师职业发展
- mysql行转列(if + sum)
- 第十周 编程序,输出1/3-3/5+5/7...+19/21的结果
- 将常用常量放入ServletContext中,
- Java程序猿的ActionScript学习之路(一)
- phoneGap3.0安装步骤(以windows下的android环境为例)