ACM: 图论题 poj3259 bellman_ford…

                                                                          Wormholes

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

题意: john发现amazing wormholes,看是否可以同过虫洞会带过去meet himself.普通的边是双向,

         虫洞单向权值为负的.

个人思路:

                1.bellman_ford裸露求解.判断是否有负边.

                2.INF说好的10000却过不了,要我开成1<<30 (郁闷)

 

代码:

#include <cstdio>
#include <iostream>
#include <cstring>
using namespace std;
#define MAX 5500
const int INF = (1<<30);

int f , n , m , w , e;
int u[MAX],v[MAX],ww[MAX];

void readGraph()
{
    int i;
    e = 0;
    int uu , vv , quan;
    scanf("%d %d %d",&n,&m,&w);
    for(i = 0; i < m; ++i)
    {
        
        scanf("%d %d %d",&uu,&vv,&quan);
        u[e] = uu;
        v[e] = vv;
        ww[e++] = quan;

        u[e] = vv;
        v[e] = uu;
        ww[e++] = quan;
    }

    for(i = 0; i < w; ++i)
    {
        scanf("%d %d %d",&uu,&vv,&quan);
        u[e] = uu;
        v[e] = vv;
        ww[e++] = (-1)*quan;
    }
}

bool bellman_ford()
{
    int i , j;
    int d[MAX];
    for(i = 0; i < n; ++i)
    {
        d[i] = (i == 0 ? 0 : INF);
    }
    for(i = 0; i < n-1; ++i)
    {
        for(j = 0; j < e; ++j)
        {
            int x = u[j];
            int y = v[j];
            if(d[x] < INF && d[y] > d[x] + ww[j])
            {
                d[y] = d[x] + ww[j];
            }
        }
    }

    for(i = 0; i < e; ++i)
    {
        if(d[v[i]] > d[u[i]] + ww[i])
        {
            return true;
        }
    }
    return false;
}

int main()
{
    scanf("%d",&f);

    while(f--)
    {
        readGraph();
        if(bellman_ford())
            printf("YES\n");
        else
            printf("NO\n");
    }

    return 0;
}