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: Wrong Answer)

use std::cmp;

fn main() {
    let mut sc = Scanner::new();
    let n = sc.read();
    let m = sc.read();

    let mut graph = vec![vec![]; n];
    for _ in 0..m {
        let u = sc.usize_read() - 1;
        let v = sc.usize_read() - 1;
        let s: i64 = sc.read();
        graph[u].push((v, s));
        graph[v].push((u, s));
    }

    let mut check: Vec<Vec<Option<i64>>> = vec![vec![None, None]; n];
    check[0][0] = Some(0);
    if !dfs(0, 0, &graph, &mut check) {
        println!("0");
        return;
    }

    let mut ans = None;
    let mut min_left = 0;
    let mut min_right = 1e15 as i64;
    for v in &check {
        let left = v[0];
        let right = v[1];
        match left {
            Some(left) => {
                match right {
                    Some(right) => {
                        // left+a=right-a
                        // a+a = right-left
                        if (right - left) % 2 != 0 {
                            println!("0");
                            return;
                        }
                        match ans {
                            Some(ans) => {
                                if ans != (right - left) / 2 {
                                    println!("0");
                                    return;
                                }
                            }
                            None => {
                                ans = Some((right - left) / 2);
                            }
                        }
                    }
                    None => {
                        // left+a>0
                        min_left = cmp::min(min_left, left);
                    }
                }
            }
            None => {
                match right {
                    Some(right) => {
                        // right-a>0
                        min_right = cmp::min(min_right, right);
                    }
                    None => {
                        panic!();
                    }
                }
            }
        }
    }

    match ans {
        Some(ans) => {
            if ans + min_left > 0 && min_right - ans > 0 {
                println!("1");
            } else {
                println!("0");
            }
        }
        None => {
            // min_right>ans>-min_left
            println!("{}", cmp::max(min_right - (-min_left) - 1, 0));
        }
    }
}

fn dfs(
    v: usize,
    side: usize,
    graph: &Vec<Vec<(usize, i64)>>,
    check: &mut Vec<Vec<Option<i64>>>,
) -> bool {
    let cur = check[v][side].unwrap();
    for &(next, sum) in &graph[v] {
        match check[next][side ^ 1] {
            Some(t) => if cur + t != sum {
                return false;
            },
            None => {
                check[next][side ^ 1] = Some(sum - cur);
                if !dfs(next, side ^ 1, graph, check) {
                    return false;
                }
            }
        }
    }
    return true;
}

struct Scanner {
    ptr: usize,
    length: usize,
    buf: Vec<u8>,
    small_cache: Vec<u8>,
}

#[allow(dead_code)]
impl Scanner {
    fn new() -> Scanner {
        Scanner {
            ptr: 0,
            length: 0,
            buf: vec![0; 1024],
            small_cache: vec![0; 1024],
        }
    }

    fn load(&mut self) {
        use std::io::Read;
        let mut s = std::io::stdin();
        self.length = s.read(&mut self.buf).unwrap();
    }

    fn byte(&mut self) -> u8 {
        if self.ptr >= self.length {
            self.ptr = 0;
            self.load();
            if self.length == 0 {
                self.buf[0] = b'\n';
                self.length = 1;
            }
        }

        self.ptr += 1;
        return self.buf[self.ptr - 1];
    }

    fn is_space(b: u8) -> bool {
        b == b'\n' || b == b'\r' || b == b'\t' || b == b' '
    }

    fn read_vec<T>(&mut self, n: usize) -> Vec<T>
    where
        T: std::str::FromStr,
        T::Err: std::fmt::Debug,
    {
        (0..n).map(|_| self.read()).collect()
    }

    fn usize_read(&mut self) -> usize {
        self.read()
    }

    fn read<T>(&mut self) -> T
    where
        T: std::str::FromStr,
        T::Err: std::fmt::Debug,
    {
        let mut b = self.byte();
        while Scanner::is_space(b) {
            b = self.byte();
        }

        for pos in 0..self.small_cache.len() {
            self.small_cache[pos] = b;
            b = self.byte();
            if Scanner::is_space(b) {
                return String::from_utf8_lossy(&self.small_cache[0..(pos + 1)])
                    .parse()
                    .unwrap();
            }
        }

        let mut v = self.small_cache.clone();
        while !Scanner::is_space(b) {
            v.push(b);
            b = self.byte();
        }
        return String::from_utf8_lossy(&v).parse().unwrap();
    }
}