558 - Wormholes

题目大意就是 有一些虫洞可以连通不同的星域  可以通过虫洞回到过去或者到达未来 权值代表可以到达的时间

要求判断是否能回到过去  就是找是否又负环存在 用spfa即可

#include<iostream>
#include<math.h>
using namespace std;
#include<cstdio>
#include<cstring>
#include<queue>
#define maxn 6100
const int INF = 90000000;

int n,m;
int first[maxn];
int u[maxn],v[maxn],w[maxn],next[maxn];

int read_graph()
{
    scanf("%d %d",&n,&m);
    for(int i = 0; i < n; i++)
        first[i] = -1;
    for(int e = 0; e < m; e++)
    {
        scanf("%d %d %d",&u[e],&v[e],&w[e]);
        next[e] = first[u[e]];
        first[u[e]] = e;
    }
}

int spfa()
{
    queue<int>q;
    bool inq[maxn];
    int c[maxn],d[maxn];
    memset(c,0,sizeof(c));
    for(int i = 0; i < n; i++)
        d[i] = (i==0?0:INF);
    memset(inq,0,sizeof(inq));
    q.push(0);
    c[0] = 1;
    inq[0] = 1;
    while(!q.empty())
    {
        int x = q.front();
        q.pop();
        inq[x] = false;
        for(int e = first[x]; e!=-1; e = next[e])
            if(d[v[e]]>d[x]+w[e])
            {
                d[v[e]]=d[x]+w[e];
                if(!inq[v[e]])
                {
                    inq[v[e]] = true;
                    q.push(v[e]);
                    c[v[e]]++;
                    if(c[v[e]]>=n)
                        return 1;
                }
            }
    }
    return 0;
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        read_graph();
        if(!spfa())
            puts("not possible");
        else puts("possible");

    }
    return 0;
}