标签:style blog http color os io strong for ar
解题报告
思路:
spfa判负环。
#include <iostream> #include <cstring> #include <cstdio> #include <queue> #define inf 0x3f3f3f3f #define N 40000 #define M 100000 using namespace std; struct node { int v,w,next; } edge[M]; int head[N],dis[N],vis[N],cot[N],cnt,n,m,s,t,f; void add(int u,int v,int w) { edge[cnt].v=v; edge[cnt].w=w; edge[cnt].next=head[u]; head[u]=cnt++; } void spfa() { for(int i=0; i<n; i++) { dis[i]=inf; vis[i]=0; } dis[s]=0; vis[s]=1; queue<int >Q; Q.push(s); while(!Q.empty()) { int u=Q.front(); Q.pop(); vis[u]=0; for(int i=head[u]; i!=-1; i=edge[i].next) { int v=edge[i].v; if(dis[v]>dis[u]+edge[i].w) { dis[v]=dis[u]+edge[i].w; if(!vis[v]) { cot[v]++; if(cot[v]>n) { f=1; return ; } vis[v]=1; Q.push(v); } } } } } int main() { int i,j,T,u,v,w,k=1; scanf("%d",&T); while(T--) { s=0; t=n-1; memset(head,-1,sizeof(head)); memset(cot,0,sizeof(cot)); cnt=0; f=0; scanf("%d%d",&n,&m); for(i=0; i<m; i++) { scanf("%d%d%d",&u,&v,&w); add(u,v,w); } spfa(); if(f) printf("possible\n"); else printf("not possible\n"); } return 0; }
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:
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.
2 3 3 0 1 1000 1 2 15 2 1 -42 4 4 0 1 10 1 2 20 2 3 30 3 0 -60
possible not possible
UVa558_Wormholes(最短路)(小白书图论专题)
标签:style blog http color os io strong for ar
原文地址:http://blog.csdn.net/juncoder/article/details/38780553