Problem:
Score : 600 points

Problem Statement

Kenkoooo found a simple connected graph.
The vertices are numbered 1 through n.
The i-th edge connects Vertex u_i and v_i, and has a fixed integer s_i.

Kenkoooo is trying to write a positive integer in each vertex so that the following condition is satisfied:

For every edge i, the sum of the positive integers written in Vertex u_i and v_i is equal to s_i.

Find the number of such ways to write positive integers in the vertices.

Constraints

2 \leq n \leq 10^5

1 \leq m \leq 10^5

1 \leq u_i < v_i \leq n

2 \leq s_i \leq 10^9

If i\neq j, then u_i \neq u_j or v_i \neq v_j.

The graph is connected.

All values in input are integers.

Input

Input is given from Standard Input in the following format:

n m
u_1 v_1 s_1
:
u_m v_m s_m

Output

Print the number of ways to write positive integers in the vertices so that the condition is satisfied.

Sample Input 1

3 3
1 2 3
2 3 5
1 3 4

Sample Output 1

1

The condition will be satisfied if we write 1,2 and 3 in vertices 1,2 and 3, respectively.
There is no other way to satisfy the condition, so the answer is 1.

Sample Input 2

4 3
1 2 6
2 3 7
3 4 5

Sample Output 2

3

Let a,b,c and d be the numbers to write in vertices 1,2,3 and 4, respectively.
There are three quadruples (a,b,c,d) that satisfy the condition:

(a,b,c,d)=(1,5,2,3)

(a,b,c,d)=(2,4,3,2)

(a,b,c,d)=(3,3,4,1)

Sample Input 3

8 7
1 2 1000000000
2 3 2
3 4 1000000000
4 5 2
5 6 1000000000
6 7 2
7 8 1000000000

Sample Output 3

0

Solution in Rust (1.15.1) (judge verdict: Runtime Error)

use std::cmp;

fn main() {
    let (r, w) = (std::io::stdin(), std::io::stdout());
    let mut sc = IO::new(r.lock(), w.lock());
    let n: usize = sc.read();
    let m: usize = sc.read();
    let mut graph = vec![vec![]; n];
    for _ in 0..m {
        let u = sc.read::<usize>() - 1;
        let v = sc.read::<usize>() - 1;
        let s: i64 = sc.read();
        graph[u].push((v, s));
        graph[v].push((u, s));
    }

    let mut plus = vec![None; n];
    let mut minus = vec![None; n];
    plus[0] = Some(0);
    if !dfs(0, &graph, &mut plus, &mut minus) {
        println!("0");
        return;
    }
    let mut x2 = None;
    for i in 0..n {
        match (plus[i], minus[i]) {
            (Some(p), Some(m)) => {
                if x2.is_none() {
                    x2 = Some(m - p);
                }
            }
            _ => {}
        }
    }

    let mut max_x = 1 << 50;
    let mut min_x = 1;
    for i in 0..n {
        match (plus[i], minus[i]) {
            (Some(p), Some(m)) => {
                let x2 = x2.unwrap();
                if x2 % 2 == 1 {
                    println!("0");
                    return;
                }
                let x = x2 / 2;
                if m - x <= 0 || p + x <= 0 || p + x != m - x {
                    println!("0");
                    return;
                }
            }
            (Some(p), None) => {
                if let Some(x2) = x2 {
                    if x2 % 2 == 1 {
                        println!("0");
                        return;
                    }
                    let x = x2 / 2;
                    if p + x <= 0 {
                        println!("0");
                        return;
                    }
                } else {
                    min_x = cmp::max(min_x, -p + 1);
                }
            }
            (None, Some(m)) => {
                if let Some(x2) = x2 {
                    if x2 % 2 == 1 {
                        println!("0");
                        return;
                    }
                    let x = x2 / 2;
                    if m - x <= 0 {
                        println!("0");
                        return;
                    }
                } else {
                    max_x = cmp::min(max_x, m - 1);
                }
            }
            _ => unreachable!(),
        }
    }

    if let Some(x2) = x2 {
        if x2 % 2 == 1 {
            println!("0");
        } else {
            println!("1");
        }
    } else if min_x > max_x {
        println!("0");
    } else {
        println!("{}", max_x - min_x + 1);
    }
}

fn dfs(
    v: usize,
    graph: &Vec<Vec<(usize, i64)>>,
    plus: &mut Vec<Option<i64>>,
    minus: &mut Vec<Option<i64>>,
) -> bool {
    for &(next, sum) in graph[v].iter() {
        if let Some(t) = plus[v] {
            if let Some(cur) = minus[next] {
                if cur != sum - t {
                    return false;
                }
            } else {
                minus[next] = Some(sum - t);
                dfs(next, graph, plus, minus);
            }
        }
        if let Some(t) = minus[v] {
            if let Some(cur) = plus[next] {
                if cur != sum - t {
                    return false;
                }
            } else {
                plus[next] = Some(sum - t);
                dfs(next, graph, plus, minus);
            }
        }
    }
    true
}

pub struct IO<R, W: std::io::Write>(R, std::io::BufWriter<W>);

impl<R: std::io::Read, W: std::io::Write> IO<R, W> {
    pub fn new(r: R, w: W) -> Self {
        IO(r, std::io::BufWriter::new(w))
    }
    pub fn write<S: ToString>(&mut self, s: S) {
        use std::io::Write;
        self.1.write(s.to_string().as_bytes()).unwrap();
    }
    pub fn read<T: std::str::FromStr>(&mut self) -> T {
        use std::io::Read;
        let buf = self
            .0
            .by_ref()
            .bytes()
            .map(|b| b.unwrap())
            .skip_while(|&b| b == b' ' || b == b'\n' || b == b'\r' || b == b'\t')
            .take_while(|&b| b != b' ' && b != b'\n' && b != b'\r' && b != b'\t')
            .collect::<Vec<_>>();
        unsafe { std::str::from_utf8_unchecked(&buf) }
            .parse()
            .ok()
            .expect("Parse error.")
    }
    pub fn vec<T: std::str::FromStr>(&mut self, n: usize) -> Vec<T> {
        (0..n).map(|_| self.read()).collect()
    }
    pub fn chars(&mut self) -> Vec<char> {
        self.read::<String>().chars().collect()
    }
}