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:
#include <bits/stdc++.h>

using namespace std;

#define int long long

const int inf = 1LL << 55;

struct edge
{
  int to, cap, rev, ini;

  edge() {}

  edge(int to, int cap, int rev, int ini) : to(to), cap(cap), rev(rev), ini(ini) {}
};

using Pi = pair< int, int >;

struct Dinic
{
  vector< vector< edge > > graph;
  vector< int > iter, level;

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

  Pi add_edge(int from, int to, int cap)
  {
    graph[from].emplace_back(to, cap, graph[to].size(), cap);
    graph[to].emplace_back(from, cap, graph[from].size() - 1, 0);
    return Pi(from, graph[from].size() - 1);
  }

  bool bfs(int s, int t)
  {
    queue< int > que;
    fill(level.begin(), level.end(), -1);
    level[s] = 0;
    que.push(s);
    while(!que.empty()) {
      int v = que.front();
      que.pop();
      for(edge e : graph[v]) {
        if(e.cap > 0 && level[e.to] < 0) {
          que.push(e.to);
          level[e.to] = level[v] + 1;
        }
      }
    }
    return level[t] >= 0;
  }

  int dfs(int v, int t, int f)
  {
    if(v == t) return f;
    for(int &i = iter[v]; i < (int) graph[v].size(); i++) {
      edge &e = graph[v][i];
      if(e.cap > 0 && level[e.to] > level[v]) {
        int 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;
  }

  int max_flow(int s, int t, int ff = inf)
  {
    int flow = 0;
    while(bfs(s, t) && flow < ff) {
      fill(iter.begin(), iter.end(), 0);
      int f;
      while((f = dfs(s, t, ff)) > 0 && flow < ff) flow += f;
    }
    return flow;
  }
};

signed main()
{
  int V, E;
  cin >> V >> E;
  Dinic graph(V);
  vector< Pi > vec;
  for(int i = 0; i < E; i++) {
    int s, t, c;
    cin >> s >> t >> c;
    Pi p = graph.add_edge(s, t, c);
    if(c == 1) vec.push_back(p);
  }
  int flow = graph.max_flow(0, V - 1);
  int flag = 0;
  for(Pi p : vec) {
    edge &e = graph.graph[p.first][p.second];
    if(e.cap == 0 || graph.graph[e.to][e.rev].cap == 0) {
      bool hoge = e.cap == 0;
      e.cap = graph.graph[e.to][e.rev].cap = 0;
      if(hoge) {
        if(e.to != V - 1) graph.max_flow(V - 1, e.to, 1);
        if(p.first != 0) graph.max_flow(p.first, 0, 1);
      } else {
        if(p.first != V - 1) graph.max_flow(V - 1, p.first, 1);
        if(e.to != 0) graph.max_flow(e.to, 0, 1);
      }
      int f = graph.max_flow(0, V - 1, 1);
      if(f == 0) {
        flag = 1;
        break;
      }

      if(hoge) {
        graph.graph[e.to][e.rev].cap = 1;
        if(e.to != V - 1) graph.max_flow(e.to, V - 1, 1);
        if(p.first != 0) graph.max_flow(0, p.first, 1);
      } else {
        e.cap = 1;
        if(p.first != V - 1) graph.max_flow(p.first, V - 1, 1);
        if(e.to != 0) graph.max_flow(0, e.to, 1);
      }
    }
  }
  if(flow - flag > 10000) cout << -1 << endl;
  else cout << flow - flag << endl;

  return 0;
}