Problem: problem

There are $ V $ islands, numbered $ 0, 1, ..., V-1 $, respectively. There are $ E $ bridges, numbered $ 0, 1, ..., E-1 $, respectively. The $ i $ th bridge spans island $ s_i $ and island $ t_i $ and is $ c_i $ wide.

The AOR Ika-chan Corps (commonly known as the Squid Corps), which has a base on the island $ 0 $, is small in scale, so it is always being killed by the Sosu-Usa Corps (commonly known as the Sosuusa Corps) on the island $ V-1 $. .. One day, the squid group got the information that "the Sosusa group will attack tomorrow." A large number of Sosusa's subordinates move across the island from the Sosusa's base, and if even one of their subordinates reaches the Squid's base, the Squid will perish ...

Therefore, the squid group tried to avoid the crisis by putting a road closure tape on the bridge to prevent it from passing through. The length of the tape used is the sum of the widths of the closed bridges. Also, if all the subordinates of the Sosusa group always pass through a bridge with a width of $ 1 $, the squid group can ambush there to prevent them from passing through the Sosusa group.

The length of the tape it holds is $ 10 ^ 4 $. Considering the future, I would like to consume as little tape as possible. Find the minimum length of tape used to keep Sosusa's subordinates from reaching the squid's base. However, if the tape is not long enough and you are attacked by all means, output $ -1 $.



output

Output the minimum length of tape used to prevent Sosusa's subordinates from reaching the Squid's base. However, if the tape is not long enough and you are attacked by all means, output $ -1 $. Also, output a line break at the end.

Example

Input

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


Output

4

Solution (in CPP):

Solution:
/*** Template Begin ***/

#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>

using namespace std;

#define REP(i, b, e) for (auto i = b; i < e; ++i)

struct Dinic {
    struct Edge {
        Edge(int to, int64_t cap, int rev) : to(to), cap(cap), rev(rev) {}

        int to, rev;
        int64_t cap;
    };

    vector<vector<Edge>> graph;
    vector<int> level;
    vector<int> iter;

    static const int64_t inf = int64_t(1) << 50;

    Dinic(int n) : graph(n), level(n), iter(n) {}

    Dinic(const vector<vector<int64_t>> &g)
        : graph(vector<vector<Edge>>(g.size())),
          level(g.size()),
          iter(g.size()) {
        for (int i = 0; i < g.size(); ++i) {
            for (int to : g[i]) {
                add_edge(i, to, 1);
            }
        }
    }

    void add_edge(int from, int to, int64_t cap) {
        graph[from].emplace_back(to, cap, (int)graph[to].size());
        graph[to].emplace_back(from, cap, (int)graph[from].size() - 1);
    }

    int64_t max_flow(int s, int t) {
        int64_t flow = 0;
        while (true) {
            bfs(s);
            if (level[t] < 0) {
                break;
            }
            fill(iter.begin(), iter.end(), 0);
            int64_t f;
            while ((f = dfs(s, t, inf)) > 0) {
                flow += f;
            }
        }

        return flow;
    }

   private:
    void bfs(int s) {
        fill(level.begin(), level.end(), -1);
        queue<int> que;
        level[s] = 0;
        que.push(s);

        while (!que.empty()) {
            int v = que.front();
            que.pop();

            for (auto &e : graph[v]) {
                if (e.cap > 0 && level[e.to] < 0) {
                    level[e.to] = level[v] + 1;
                    que.push(e.to);
                }
            }
        }
    }

    int64_t dfs(int v, int t, int64_t f) {
        if (v == t) return f;

        for (int &i = iter[v]; i < graph[v].size(); ++i) {
            Edge &e = graph[v][i];
            if (e.cap > 0 && level[v] < level[e.to]) {
                int64_t d = dfs(e.to, t, min(f, e.cap));
                if (d > 0) {
                    e.cap -= d;
                    graph[e.to][e.rev].cap += d;
                    return d;
                }
            }
        }
        return 0;
    }
};

struct Edge {
    Edge(int to, int64_t cap) : to(to), cap(cap) {}

    int to;
    int64_t cap;
};

int64_t min_cut(const vector<vector<Edge>> &graph, int s, int t) {
    Dinic dinic(graph.size());

    REP(i, 0, graph.size()) {
        for (const auto &e : graph[i]) {
            if (i < e.to) {
                dinic.add_edge(i, e.to, e.cap);
            }
        }
    }

    return dinic.max_flow(s, t);
}

int main() {
    int v, e;
    cin >> v >> e;

    const int64_t M = 100000;

    vector<vector<Edge>> graph(v);
    REP(i, 0, e) {
        int a, b, c;
        cin >> a >> b >> c;

        int m1 = -(c == 1);

        graph[a].emplace_back(b, c * M + m1);
        graph[b].emplace_back(a, c * M + m1);
    }

    int64_t f = min_cut(graph, v - 1, 0) / M;

    if (f > 10000) {
        cout << -1 << endl;
    } else {
        cout << f << endl;
    }
}