POj 3259 Wormholes

Wormholes

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 21827		Accepted: 7772

Description

While exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wormhole is very peculiar because it is a one-way path that delivers you to its destination at a time that is BEFORE you entered the wormhole! Each of FJ's farms comprises N (1 ≤ N ≤ 500) fields conveniently numbered 1..N, M (1 ≤ M ≤ 2500) paths, and W (1 ≤ W ≤ 200) wormholes.

As FJ is an avid time-traveling fan, he wants to do the following: start at some field, travel through some paths and wormholes, and return to the starting field a time before his initial departure. Perhaps he will be able to meet himself :) .

To help FJ find out whether this is possible or not, he will supply you with complete maps to F (1 ≤ F ≤ 5) of his farms. No paths will take longer than 10,000 seconds to travel and no wormhole can bring FJ back in time by more than 10,000 seconds.

Input

Line 1: A single integer, F. F farm descriptions follow.
Line 1 of each farm: Three space-separated integers respectively: N, M, and W
Lines 2.. M+1 of each farm: Three space-separated numbers ( S, E, T) that describe, respectively: a bidirectional path between S and E that requires T seconds to traverse. Two fields might be connected by more than one path.
Lines M+2.. M+ W+1 of each farm: Three space-separated numbers ( S, E, T) that describe, respectively: A one way path from S to E that also moves the traveler back T seconds.

Output

Lines 1.. F: For each farm, output "YES" if FJ can achieve his goal, otherwise output "NO" (do not include the quotes).

Sample Input

2
3 3 1
1 2 2
1 3 4
2 3 1
3 1 3
3 2 1
1 2 3
2 3 4
3 1 8

Sample Output

NO
YES

Hint

For farm 1, FJ cannot travel back in time.
For farm 2, FJ could travel back in time by the cycle 1->2->3->1, arriving back at his starting location 1 second before he leaves. He could start from anywhere on the cycle to accomplish this.

Source

USACO 2006 December Gold

考察点：

          最短路算法

#include <iostream>
#include <cstring>
using namespace std;
int statck[1000000];
int status[1000];
int sum[1000];
class num
{
    public:
    int end,val;
    int next;
}a[1000000];
int b[1000],res[1000];
int tag,n;
int INF=0x7fffffff;
int main()
{
    void deal(int k);
    int i,j,m,s,t,z,x,y,val;
    cin>>t;
    while(t--)
    {
        cin>>n>>m>>z;
        memset(b,-1,sizeof(b));
        j=0;
        for(i=0;i<=m-1;i++)
        {
            cin>>x>>y>>val;
            a[j].end=y;
            a[j].val=val;
            a[j].next=b[x];
            b[x]=j;
            j+=1;
            a[j].end=x;
            a[j].val=val;
            a[j].next=b[y];
            b[y]=j;
            j++;
        }
        for(i=0;i<=z-1;i++)
        {
            cin>>x>>y>>val;
            a[j].end=y;
            a[j].val=-1*val;
            a[j].next=b[x];
            b[x]=j;
            j++;
        }
        for(i=1;i<=n;i++)
        {
            memset(status,0,sizeof(status));
            memset(sum,0,sizeof(sum));
            tag=0;
            deal(i);
            if(tag==1)
            {
                cout<<"YES"<<endl;
                break;
            }
        }
        if(tag==0)
        {
            cout<<"NO"<<endl;
        }
    }
    return 0;
}
void deal(int k)
{
    int base,top;
    int i,j,x,xend;
    for(i=1;i<=n;i++)
    {
        res[i]=INF;
    }
    res[k]=0;
    base=top=0;
    statck[top++]=k;
    status[k]=1;
    sum[k]+=1;
    while(base<top)
    {
        x=statck[base];
        base++;
        status[x]=0;
        for(j=b[x];j!=-1;j=a[j].next)
        {
            if((res[x]+a[j].val)<res[a[j].end])
            {
                res[a[j].end]=(res[x]+a[j].val);
                if(res[k]<0)
                {
                    tag=1;
                    break;
                }
                if(status[a[j].end]==0)
                {
                    status[a[j].end]=1;
                    sum[a[j].end]+=1;
                    statck[top++]=a[j].end;
                    if(sum[a[j].end]>=n)
                    {
                        break;
                    }
                }  
            }
        }
        if(j!=-1)
        {
            break;
        }
    }

}