CodeForces 652E|Pursuit For Artifacts|边双连通分量|缩点

题目大意

问无向图中，是否存在从A到B的简单路径，使其权值和至少为1。其中每条边权值为0或1。

题解

如果是树的话，解法就很显然了，但现在在无向图中，考虑如果在环上存在权值为1的边，那么如果我们经过这个环时，就一定可以过这个权值为1的边，扩展到边双连通分量同理，如果边双连通分量内存在权值为1的边，那么经过这个连通分量时就一定可以过这条边。故我们考虑缩点，新点点权为1仅当原联通分量内存在这种边。那么A到B的路径现在变成了唯一的路径了。
$O(n+m)$

#include <cstdio>
#include <queue>
#include <cstring>
#include <algorithm>
using namespace std;
#define clr(i,j) memset(i,j,sizeof(i))
#define FOR(i,j,k) for(i=j;i<=k;++i)

const int N = 300005, M = 2 * N;

struct Graph {
    int h[N], p[M], fr[M], v[M], w[M], val[N], dis[N], vis[N], cnt, id, n;
    int dfn[N], low[N], instack[N], stack[N], belong[N], bcc, top;

    Graph() : cnt(0) {}

    void add(int a, int b, int c) {
        p[++cnt] = h[a]; fr[cnt] = a; v[cnt] = b; w[cnt] = c; h[a] = cnt;
        p[++cnt] = h[b]; fr[cnt] = b; v[cnt] = a; w[cnt] = c; h[b] = cnt;
    }

    void tarjan(int u, int fa) {
        int i;
        dfn[u] = low[u] = ++id;
        instack[u] = 1; stack[++top] = u;
        for (i = h[u]; i; i = p[i]) {
            if (v[i] == fa) continue;
            if (!dfn[v[i]]) {
                tarjan(v[i], u);
                low[u] = min(low[v[i]], low[u]);
            } else if (instack[v[i]])
                low[u] = min(dfn[v[i]], low[u]);
        }

        if (dfn[u] == low[u]) {
            ++bcc;
            do {
                i = stack[top--];
                belong[i] = bcc;
                instack[i] = 0;
            } while (i != u);
        }
    }

    void do_bcc() {
        id = 0; top = 0; bcc = 0; int i;
        FOR(i,1,n) if (!dfn[i]) tarjan(i, 0);
    }

    void rebuild(Graph &out) {
        for (int i = 1; i <= cnt; i += 2)
            if (belong[fr[i]] != belong[v[i]])
                out.add(belong[fr[i]], belong[v[i]], w[i]);
            else if (w[i])
                out.val[belong[fr[i]]] = 1;
    }

    bool calc(int x, int y) {
        queue<int> q; q.push(x);
        dis[x] = val[x]; vis[x] = 1;
        while (!q.empty()) {
            int u = q.front(), i; q.pop();
            for (i = h[u]; i; i = p[i]) if (!vis[v[i]]) {
                if (dis[v[i]] < dis[u] + w[i] + val[v[i]])
                    dis[v[i]] = dis[u] + w[i] + val[v[i]];
                q.push(v[i]); vis[v[i]] = 1;
            }
        }
        return dis[y];
    }
} base, ne;

int main() {
    int n, m, i, a, b, c;
    scanf("%d%d", &n, &m);
    base.n = n;
    FOR(i,1,m) {
        scanf("%d%d%d", &a, &b, &c);
        base.add(a, b, c);
    }
    scanf("%d%d", &a, &b);
    base.do_bcc(); base.rebuild(ne);
    puts(ne.calc(base.belong[a], base.belong[b]) ? "YES" : "NO");
    return 0;
}

E. Pursuit For Artifacts

Johnny is playing a well-known computer game. The game are in some country, where the player can freely travel, pass quests and gain an experience.

In that country there are n islands and m bridges between them, so you can travel from any island to any other. In the middle of some bridges are lying ancient powerful artifacts. Johnny is not interested in artifacts, but he can get some money by selling some artifact.

At the start Johnny is in the island a and the artifact-dealer is in the island b (possibly they are on the same island). Johnny wants to find some artifact, come to the dealer and sell it. The only difficulty is that bridges are too old and destroying right after passing over them. Johnnie’s character can’t swim, fly and teleport, so the problem became too difficult.

Note that Johnny can’t pass the half of the bridge, collect the artifact and return to the same island.

Determine if Johnny can find some artifact and sell it.

Input

The first line contains two integers n and m (1 ≤ n ≤ 3·105, 0 ≤ m ≤ 3·105) — the number of islands and bridges in the game.

Each of the next m lines contains the description of the bridge — three integers xi, yi, zi (1 ≤ xi, yi ≤ n, xi ≠ yi, 0 ≤ zi ≤ 1), where xi and yi are the islands connected by the i-th bridge, zi equals to one if that bridge contains an artifact and to zero otherwise. There are no more than one bridge between any pair of islands. It is guaranteed that it’s possible to travel between any pair of islands.

The last line contains two integers a and b (1 ≤ a, b ≤ n) — the islands where are Johnny and the artifact-dealer respectively.

Output

If Johnny can find some artifact and sell it print the only word “YES” (without quotes). Otherwise print the word “NO” (without quotes).

Examples

Input

6 7
1 2 0
2 3 0
3 1 0
3 4 1
4 5 0
5 6 0
6 4 0
1 6

Output

YES

Input

5 4
1 2 0
2 3 0
3 4 0
2 5 1
1 4

Output

NO

Input

5 6
1 2 0
2 3 0
3 1 0
3 4 0
4 5 1
5 3 0
1 2

Output

YES