Problem:
Score : 400 points

Problem Statement

There are N people standing on the x-axis.
Let the coordinate of Person i be x_i.
For every i, x_i is an integer between 0 and 10^9 (inclusive).
It is possible that more than one person is standing at the same coordinate.

You will given M pieces of information regarding the positions of these people.
The i-th piece of information has the form (L_i, R_i, D_i).
This means that Person R_i is to the right of Person L_i by D_i units of distance, that is, x_{R_i} - x_{L_i} = D_i holds.

It turns out that some of these M pieces of information may be incorrect.
Determine if there exists a set of values (x_1, x_2, ..., x_N) that is consistent with the given pieces of information.

Constraints

1 \leq N \leq 100 000

0 \leq M \leq 200 000

1 \leq L_i, R_i \leq N (1 \leq i \leq M)

0 \leq D_i \leq 10 000 (1 \leq i \leq M)

L_i \neq R_i (1 \leq i \leq M)

If i \neq j, then (L_i, R_i) \neq (L_j, R_j) and (L_i, R_i) \neq (R_j, L_j).

D_i are integers.

Input

Input is given from Standard Input in the following format:

N M
L_1 R_1 D_1
L_2 R_2 D_2
:
L_M R_M D_M

Output

If there exists a set of values (x_1, x_2, ..., x_N) that is consistent with all given pieces of information, print Yes; if it does not exist, print No.

Sample Input 1

3 3
1 2 1
2 3 1
1 3 2

Sample Output 1

Yes

Some possible sets of values (x_1, x_2, x_3) are (0, 1, 2) and (101, 102, 103).

Sample Input 2

3 3
1 2 1
2 3 1
1 3 5

Sample Output 2

No

If the first two pieces of information are correct, x_3 - x_1 = 2 holds, which is contradictory to the last piece of information.

Sample Input 3

4 3
2 1 1
2 3 5
3 4 2

Sample Output 3

Yes

Sample Input 4

10 3
8 7 100
7 9 100
9 8 100

Sample Output 4

No

Sample Input 5

100 0

Sample Output 5

Yes

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Time Limit Exceeded)

import java.util.*;
class Main
{
	static int noofnodes , noofqueries;
	static int[] arr = new int[100100];
	static Stack<Integer>[] lstk,rstk ;
	// static Stack<Integer> queries ;  
	static HashMap<String,Long> hmap = new HashMap<>();
	static int[] visit ,newvisit;
	static int flag =0 , currval=0 , chkflag =0 ;
	static Queue<Integer> queries = new LinkedList<>();
	static long sum =0 ,count =0 ;
	
	public static void dfs(int value)
	{
		abc:while(!lstk[value].isEmpty())
		{
			visit[value] = 1;
			int ele = lstk[value].pop();
			// System.out.println("Stack value = "+value);
			// System.out.println("poped  value = "+ele);
			
			sum = hmap.get(value+" "+ele);
			while(!lstk[ele].isEmpty() )
			{

				int poped = lstk[ele].peek();
				if(visit[poped]==0)
				{
					sum+=hmap.get(ele+" "+poped);
					ele = poped;
				}
				else
					break;
				
				// System.out.println("sum inside condition = "+sum);
				// System.out.println("visit value of poped element  = "+visit[poped]);
				// System.out.println("visit value of stack number = "+visit[value]);
				// count++;
				// System.out.println("poped  = "+poped);
				
				// dfs(poped);
			}
			if(hmap.containsKey(value+" "+ele) )//|| hmap.containsKey(ele+" "+value))
			{
				if(hmap.get(value+" "+ele) != sum)
				{
					chkflag = 1;
					break abc;
				}
				/*
				else if(hmap.get(ele+" "+value) != sum)
				{
					chkflag = 1;
					break abc;
				}
				*/
			}
			else
			{
				hmap.put((value+" "+ele),sum);
				hmap.put((ele+" "+value),-sum);
			}
			// System.out.println("sum of "+value+" and "+ ele +" = "+sum);

		}		
		

	}


	public static void main(String[] args)
	{
		Scanner s= new Scanner(System.in);
		noofnodes = s.nextInt();
		noofqueries = s.nextInt();
		visit = new int[noofnodes+1];

		lstk = new Stack[noofnodes+1];
		rstk = new Stack[noofnodes+1];
		// queries = new Stack<Integer>();
		for(int i =0;i<noofnodes+1;i++ )
		{
			lstk[i] = new Stack<Integer>();
			rstk[i] = new Stack<Integer>();
		}

		//storing 
		for(int i=0;i<noofqueries;i++)
		{
			int l = s.nextInt();	
			int r = s.nextInt();
			long d = s.nextLong();
			lstk[l].push(r);
			rstk[r].push(l);
			if(arr[l] == 0)
				queries.add(l);
			arr[l] = 1;

			String line1 = l+" "+r;
			String line2 = r+" "+l;
			
			hmap.put(l+" "+r,d);
			hmap.put(r+" "+l,-d);

		}

		
			while(!queries.isEmpty())
			{
				int ele = queries.remove();
				sum=0;
				currval = ele;
				newvisit = new int[noofnodes+1];
				
				// System.out.println("came from here "+ele);
				
				if(visit[ele] == 0)
				dfs(ele);			
				visit[ele]=1;

				if(chkflag != 0)	
				{
					break;
					// System.out.println("time to take break ");
				}
			}
			// System.out.println(count);
			
			if(chkflag == 0)
				System.out.println("Yes");
			else
				System.out.println("No");
				

	}



}