POJ 3259 Wormholes

最新推荐文章于 2020-08-02 23:36:18 发布

LanQiLi

最新推荐文章于 2020-08-02 23:36:18 发布

阅读量246

点赞数

分类专栏：图论

本文链接：https://blog.csdn.net/LanQiLi/article/details/84962258

版权

图论专栏收录该内容

10 篇文章 0 订阅

订阅专栏

Language:Default

Wormholes

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 66713		Accepted: 24868

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

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.

思路：其实这个题目就是要求判断是否存在负环，如果有输出YES，没有的话输出NO，我用spfa写了BFS和DFS判断负环的俩个代码，大家可以参考下，但是这道题目用DFS耗时900多ms，而bfs确实600多ms，有点惊讶

SPFA+DFS：

#include<iostream>
#include<queue>
using namespace std;
const int maxn = 2e5 + 7;
const int inf = 1e9;
struct node{
    int next;
    int w;
    int to;
}edge[maxn];
int n, m, t, a, b, c, w, cnt;
int d[maxn], num[maxn], head[maxn];
bool vis[maxn];
void add(int u, int v, int w) {
    edge[cnt].w = w;
    edge[cnt].to = v;
    edge[cnt].next = head[u];
    head[u] = cnt++;
}
int flag;
void spfa(int s) {
    vis[s] = 1;
    for (int i = head[s]; i != 0; i = edge[i].next){
        int w = edge[i].w;
        int v = edge[i].to;
        if (d[s] + w < d[v]) {
            if (vis[v]) {
                flag = 1;
                return;
            }
            d[v] = d[s] + w;
            spfa(v);
        }
    }
    vis[s] = 0;
}

int main() {
    cin >> t;
    while (t--) {
        fill(head, head + maxn, 0);
        fill(vis, vis + maxn, false);
        fill(d, d + maxn, inf);
        cin >> n >> m >> w;
        cnt = 1;
        for (int i = 0; i < m; i++) {
            cin >> a >> b >> c;
            add(a, b, c);
            add(b, a, c);
        }
        for (int i = 0; i < w; i++) {
            cin >> a >> b >> c;
            add(a, b, -c);
        }
        flag = 0;
        d[1] = 0;
        spfa(1);
        if (flag) cout << "YES" << endl;
        else cout << "NO" << endl;
    }
    return 0;
}

SPFA+BFS：

#include<iostream>
#include<queue>
using namespace std;
const int maxn = 2e5 + 7;
const int inf = 1e9;
struct node{
    int next;
    int w;
    int to;
}edge[maxn];
int n, m, t, a, b, c, w, cnt;
int d[maxn], num[maxn], head[maxn];
bool inq[maxn];
void add(int u, int v, int w) {
    edge[cnt].w = w;
    edge[cnt].to = v;
    edge[cnt].next = head[u];
    head[u] = cnt++;
}
bool spfa(int s) {
    fill(d, d + maxn, inf);
    fill(num, num + maxn, 0);
    fill(inq, inq + maxn, false);
    d[s] = 0;
    num[s]++;
    queue<int> q;
    q.push(s);
    inq[s] = true;
    while (!q.empty()) {
        int u = q.front();
        q.pop();
        inq[u] = false;
        for (int i = head[u]; i != 0; i = edge[i].next) {
            int v = edge[i].to;
            int w = edge[i].w;
            if (d[u] + w < d[v]) {
                d[v] = d[u] + w;
                if (!inq[v]) {
                    inq[v] = true;
                    num[v]++;
                    q.push(v);
                    if (num[v] >= n) return false;
                }
            }
        }
    }
    return true;
}

int main() {
    cin >> t;
    while (t--) {
        fill(head, head + maxn, 0);
        cin >> n >> m >> w;
        cnt = 1;
        for (int i = 0; i < m; i++) {
            cin >> a >> b >> c;
            add(a, b, c);
            add(b, a, c);
        }
        for (int i = 0; i < w; i++) {
            cin >> a >> b >> c;
            add(a, b, -c);
        }
        if(!spfa(1)) cout << "YES" << endl;
        else cout << "NO" << endl;
    }
    return 0;
}