Wormholes - UVa 558 spfa判断负环
来源:互联网 发布:ios 仿今日头条 源码 编辑:程序博客网 时间:2024/05/24 15:38
Wormholes
In the year 2163, wormholes were discovered. A wormhole is a subspace tunnel through space and time connecting two star systems. Wormholes have a few peculiar properties:
- Wormholes are one-way only.
- The time it takes to travel through a wormhole is negligible.
- A wormhole has two end points, each situated in a star system.
- A star system may have more than one wormhole end point within its boundaries.
- For some unknown reason, starting from our solar system, it is always possible to end up in any star system by following a sequence of wormholes (maybe Earth is the centre of the universe).
- Between any pair of star systems, there is at most one wormhole in either direction.
- There are no wormholes with both end points in the same star system.
All wormholes have a constant time difference between their end points. For example, a specific wormhole may cause the person travelling through it to end up 15 years in the future. Another wormhole may cause the person to end up 42 years in the past.
A brilliant physicist, living on earth, wants to use wormholes to study the Big Bang. Since warp drive has not been invented yet, it is not possible for her to travel from one star system to another one directly. This canbe done using wormholes, of course.
The scientist wants to reach a cycle of wormholes somewhere in the universe that causes her to end up in the past. By travelling along this cycle a lot of times, the scientist is able to go back as far in time as necessary to reach the beginning of the universe and see the Big Bang with her own eyes. Write a program to find out whether such a cycle exists.
Input
The input file starts with a line containing the number of cases c to be analysed. Each case starts with a line with two numbers n and m . These indicate the number of star systems ( ) and the number of wormholes ( ) . The star systems are numbered from 0 (our solar system) through n-1 . For each wormhole a line containing three integer numbers x, y and t is given. These numbers indicate that this wormhole allows someone to travel from the star system numbered x to the star system numbered y, thereby ending up t () years in the future.Output
The output consists of c lines, one line for each case, containing the word possible if it is indeed possible to go back in time indefinitely, or not possible if this is not possible with the given set of star systems and wormholes.Sample Input
23 30 1 10001 2 152 1 -424 40 1 101 2 202 3 303 0 -60
Sample Output
possiblenot possible
题意:给你一些有向边,问是否存在负环。
思路:spfa的bfs判断负环,即一个点被加入队列中的次数超过n次。
AC代码如下:
#include<cstdio>#include<cstring>#include<queue>using namespace std;struct node{ int v,w,next;}edge[2010];int T,t,n,m,H[1010],tot,vis[1010],d[1010],INF=1e9,p[1010];queue<int> qu;void AddEdge(int u,int v,int w){ edge[++tot].v=v; edge[tot].w=w; edge[tot].next=H[u]; H[u]=tot;}void spfa(int s){ int i,j,k,u,v,w; qu.push(s); memset(vis,0,sizeof(vis)); memset(p,0,sizeof(p)); for(i=0;i<n;i++) d[i]=INF; d[s]=0;vis[s]=1; while(!qu.empty()) { u=qu.front(); qu.pop(); for(i=H[u];i;i=edge[i].next) { v=edge[i].v; w=edge[i].w; if(d[u]+w<d[v]) { d[v]=d[u]+w; if(vis[v]==0) { qu.push(v); vis[v]=1; if(++p[v]>n) { printf("possible\n"); return; } } } } vis[u]=0; } printf("not possible\n");}int main(){ int i,j,k,u,v,w; scanf("%d",&T); for(t=1;t<=T;t++) { scanf("%d%d",&n,&m); memset(H,0,sizeof(H)); tot=0; for(i=1;i<=m;i++) { scanf("%d%d%d",&u,&v,&w); AddEdge(u,v,w); } spfa(0); }}
- Wormholes - UVa 558 spfa判断负环
- UVA 558 - Wormholes (SPFA判断负环)
- UVa 558 - Wormholes(spfa判断负环)
- Wormholes(spfa判断负环)
- POJ:3259 Wormholes(SPFA判断负环)
- POJ3259 Wormholes 【SPFA判断负环】
- POJ 3259 Wormholes 【SPFA 判断负环】
- poj 3259 Wormholes 【SPFA&&判断负环】
- POJ3259----Wormholes(SPFA判断负环)
- Poj 3259 Wormholes【spfa 负环判断】
- POJ 3259 Wormholes SPFA 判断负环
- 【POJ 3259】Wormholes (SPFA 判断负环)
- UVA - 558 Wormholes 负环
- uva 558 - Wormholes(Bellman Ford判断负环)
- uva 558 Wormholes (Bellman-Ford算法判断负环)
- POJ - 3259 Wormholes(判断负环, Bellman Ford,SPFA)
- POJ 3259 Wormholes 判断负环(spfa)
- poj 3259 Wormholes 【spfa判断是否存在负环】
- Android NDK开发Crash错误定位
- ethtool 在 Linux 中的实现框架和应用
- 随机播放音效 在音频组件中添加好元素 Random.Range在自定义的函数中可以用整形
- 2014年个人总结
- java知识点回顾(三)
- Wormholes - UVa 558 spfa判断负环
- postgreSQL函数
- PackageInstaller 原理简述
- 关于Struts2中param的作用。
- JQuery下focus()无法自动获取焦点的处理方法 jquery如何使文本框获得焦点
- ViewPager学习笔记
- King - UVa 515 差分约束系统
- 胖子伤不起
- Diplexer也能用于做Duplexer