(beginer) 最短路 UVA 558 Wormholes
来源:互联网 发布:精华液推荐 知乎 编辑:程序博客网 时间:2024/05/19 02:19
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 can be 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
题意:给出一个有向图,找出负环。
思路:bell-ford的队列形式,一个点进入队列n次就表示有环。
代码:#include<iostream>#include<vector>#include<cstring>#include<cstdio>#include<string.h>#include<queue>using namespace std;const int maxn = 1000+5;int n , m , ptr;int d[maxn] , cnt[maxn];bool inq[maxn];struct node{int v;int w;node * next;}edge[2*maxn] , *first[maxn];void add(int x,int y,int w){edge[++ptr].v = y;edge[ptr].w = w;edge[ptr].next = first[x];first[x] = &edge[ptr];}void init(){memset(first,0,sizeof(first));ptr = 0;}bool spfa(){memset(inq,0,sizeof(inq));memset(d,0x3f,sizeof(d));memset(cnt,0,sizeof(cnt));queue<int> q;q.push(0);d[0] = 0;while (q.size()){int u = q.front(); q.pop();inq[u] = false;for (node * p = first[u] ; p ; p = p->next){int v = p->v , w = p->w;if (d[v] > d[u] + w){d[v] = d[u]+w;if (!inq[v]) {inq[v] = true;q.push(v);++cnt[v];if (cnt[v]>=n) return true;}}}}return false;}void input(){int u , v , w;while (m--){scanf("%d%d%d",&u,&v,&w);add(u,v,w);}}void solve(){if (spfa()) printf("possible\n");else printf("not possible\n");}int main(){int T; cin>>T;while (T--){scanf("%d%d",&n,&m);init();input();solve();}}
0 0
- (beginer) 最短路 UVA 558 Wormholes
- (beginer)最短路 UVA 10603 Fill
- (beginer) 最短路 UVA 10269 Adventure of Super Mario
- (beginer)最短路 UVA 11367 Full Tank?
- (beginer) 最短路 UVA 11280 Flying to Fredericton
- (beginer) 最短路 UVA 10246 Asterix and Obelix
- (advanced) 最短路 UVA 12227 Wormholes
- poj 3259 uva 558 Wormholes(bellman最短路负权回路判断)
- Wormholes(最短路_bellman_ford)
- POJ3259----Wormholes(最短路)
- Poj_3259 Wormholes(最短路)
- poj3259 Wormholes(最短路)
- Wormholes(最短路)
- (beginer) 最短路 UVA 658 It\'s not a Bug, it\'s a Feature!
- poj 3259 Wormholes 最短路
- poj3259 Wormholes 最短路bellman
- poj 3259 Wormholes 最短路
- POJ3259 Wormholes 最短路判负环
- (beginer)最短路 UVA 11367 Full Tank?
- (beginer) 最短路 UVA 11280 Flying to Fredericton
- stdClass详解
- jps 进程状态工具
- (beginer) 最短路 UVA 10246 Asterix and Obelix
- (beginer) 最短路 UVA 558 Wormholes
- REDHAT(LINUX) 扩 /HOME 所在LV
- (beginer) 最短路 UVA 658 It\'s not a Bug, it\'s a Feature!
- (intermediate)最短路(最长路) UVA 1348 - Tomato Automata
- (intermediate) 最短路(差分约束+拓扑排序) UVA 1516 - Smoking gun
- (intermediate)次短路 UVA 10342 - Always Late
- (intermediate) 最短路(第k短路) UVA 10740 - Not the Best
- (advanced) 最短路 UVA 12227 Wormholes
- (beginer) 最小生成树 UVA 1395 Slim Span
原创粉丝点击
热门IT博客
热门问题
老师的惩罚
人脸识别
我在镇武司摸鱼那些年
重生之率土为王
我在大康的咸鱼生活
盘龙之生命进化
天生仙种
凡人之先天五行
春回大明朝
姑娘不必设防,我是瞎子
九阳股份股票分析
九阳微波炉价格
九阳豆浆机a11d
九阳豆浆机售后电话
joyoung
九洋豆浆机
小家电大全
jiuyang
豆浆机价格
九阴大帝
烛九阴
九阴
九阴真经2
九阴吧
九阴炼尸诀
九阴白骨爪
九阴邪君
九阴真经3d
九阴集市
九阴武神
九阴争茎
九阴绝学
九阴手游
九阴真精
九阴下载
九阴真
九阴2
九阴ol
九阴好玩吗
九阴加速器
766九阴真经
九阴真经吧
九阴奇遇
九阴真经九阴志
九阴ol吧
九阴志
九阴极乐谷
九阴论坛
多玩九阴
九阴等级
九阴真经766
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 can be 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
#include<iostream>#include<vector>#include<cstring>#include<cstdio>#include<string.h>#include<queue>using namespace std;const int maxn = 1000+5;int n , m , ptr;int d[maxn] , cnt[maxn];bool inq[maxn];struct node{int v;int w;node * next;}edge[2*maxn] , *first[maxn];void add(int x,int y,int w){edge[++ptr].v = y;edge[ptr].w = w;edge[ptr].next = first[x];first[x] = &edge[ptr];}void init(){memset(first,0,sizeof(first));ptr = 0;}bool spfa(){memset(inq,0,sizeof(inq));memset(d,0x3f,sizeof(d));memset(cnt,0,sizeof(cnt));queue<int> q;q.push(0);d[0] = 0;while (q.size()){int u = q.front(); q.pop();inq[u] = false;for (node * p = first[u] ; p ; p = p->next){int v = p->v , w = p->w;if (d[v] > d[u] + w){d[v] = d[u]+w;if (!inq[v]) {inq[v] = true;q.push(v);++cnt[v];if (cnt[v]>=n) return true;}}}}return false;}void input(){int u , v , w;while (m--){scanf("%d%d%d",&u,&v,&w);add(u,v,w);}}void solve(){if (spfa()) printf("possible\n");else printf("not possible\n");}int main(){int T; cin>>T;while (T--){scanf("%d%d",&n,&m);init();input();solve();}}
- (beginer) 最短路 UVA 558 Wormholes
- (beginer)最短路 UVA 10603 Fill
- (beginer) 最短路 UVA 10269 Adventure of Super Mario
- (beginer)最短路 UVA 11367 Full Tank?
- (beginer) 最短路 UVA 11280 Flying to Fredericton
- (beginer) 最短路 UVA 10246 Asterix and Obelix
- (advanced) 最短路 UVA 12227 Wormholes
- poj 3259 uva 558 Wormholes(bellman最短路负权回路判断)
- Wormholes(最短路_bellman_ford)
- POJ3259----Wormholes(最短路)
- Poj_3259 Wormholes(最短路)
- poj3259 Wormholes(最短路)
- Wormholes(最短路)
- (beginer) 最短路 UVA 658 It\'s not a Bug, it\'s a Feature!
- poj 3259 Wormholes 最短路
- poj3259 Wormholes 最短路bellman
- poj 3259 Wormholes 最短路
- POJ3259 Wormholes 最短路判负环
- (beginer)最短路 UVA 11367 Full Tank?
- (beginer) 最短路 UVA 11280 Flying to Fredericton
- stdClass详解
- jps 进程状态工具
- (beginer) 最短路 UVA 10246 Asterix and Obelix
- (beginer) 最短路 UVA 558 Wormholes
- REDHAT(LINUX) 扩 /HOME 所在LV
- (beginer) 最短路 UVA 658 It\'s not a Bug, it\'s a Feature!
- (intermediate)最短路(最长路) UVA 1348 - Tomato Automata
- (intermediate) 最短路(差分约束+拓扑排序) UVA 1516 - Smoking gun
- (intermediate)次短路 UVA 10342 - Always Late
- (intermediate) 最短路(第k短路) UVA 10740 - Not the Best
- (advanced) 最短路 UVA 12227 Wormholes
- (beginer) 最小生成树 UVA 1395 Slim Span