Internet connection

import java.util.*;
public class Task2_new
{
	static long tmp_flow = 0;
	static ArrayList<ArrayList<Integer>> neighbors;
public static void main(String[] args)
{		
	long startTime = System.nanoTime();
	Scanner s = new Scanner(System.in);
	int n = s.nextInt();
	int m = s.nextInt();
	long flow = 0;
	initialize_neighbors(n);
	long[][] am = read_input(n, m, s);
	int [] visited = new int[n+1];
	List<Integer> track = new ArrayList<Integer>();
	List<Integer> path = find_path(am, 1, n, visited, track);
	visited = new int [n+1];
	track = new ArrayList<Integer>();
	while(path != null && path.size() != 0)
	{
		flow += tmp_flow;
		am = switch_edges(am,path, tmp_flow);	
		tmp_flow = 0;		
		path = find_path(am, 1, n, visited, track);
		visited = new int[n+1];
		track = new ArrayList<Integer>();
	}
	System.out.println(flow);
	long endTime   = System.nanoTime();	
	long totalTime = endTime - startTime;
	double seconds = (double)totalTime / 1000000000.0;
	//System.out.println("time: " + seconds);
}

public  static void initialize_neighbors(int n)
{
	neighbors = new ArrayList<ArrayList<Integer>>();
	for(int i = 0; i< n; i++)
	{
		neighbors.add(new ArrayList<Integer>());
	}
}

public static long[][] read_input(int n, int m, Scanner s)
{
	long[][] am = new long [n+1][n+1];
	int x;
	int y;
	for(int i = 0; i < m; i++)
	{
		x = s.nextInt();
		y = s.nextInt();
		am[x][y] = s.nextInt();
		neighbors.get(x-1).add(y);
		neighbors.get(y-1).add(x);
	} 
	return am;
}

public static long[][] switch_edges(long [][] am, List<Integer> path, long flow)
{
	for (int i = 0; i < path.size()-1; i++)
        {
			int x = path.get(i);
			int y = path.get(i+1);
			am[x][y] = am[x][y] - flow;
			am[y][x] += flow;
	}
	return am;
}

public static long flow_of_path(long[][] am, List<Integer> path)
{
	long flow = Long.MAX_VALUE;
	for (int i = 0; i < path.size()-1; i++)
        {
			int x = path.get(i);
			int y = path.get(i+1);		
			if(am[x][y] < flow)
				flow = am[x][y];
	}
	return flow;
}
public static List<Integer> find_path(long[][] am, int source, int target, int[] visited, List<Integer> track)
{
	visited[source] = 1;
	for(int i = 0; i < neighbors.get(source-1).size(); i++)
	{        	 
		int j = neighbors.get(source-1).get(i);	
		if(am[source][j] != 0 && visited[j] == 0)
		{
			if(j == target)
			{
				track.add(0, target);
				track.add(0, source);
				tmp_flow = am[source][target];
				return track;
			}
			else
			{
				List<Integer> track_from_i = find_path(am, j, target, visited, track);
				if(track_from_i != null && track_from_i.size() > 0)
				{
					track.add(0, source);
					new_flow(am[source][track.get(1)]);
					return track;
				}
				
			}	
		}	
 	}
	return null;  
	
}

public static void new_flow(long new_flow)
{	
	if(new_flow < tmp_flow)
		tmp_flow = new_flow;
}

public static void printam(int[][] am)
{
	for(int i = 0; i < am.length; i++)
	{
		for(int j = 0; j < am[i].length; j++)
			System.out.print(am[i][j]);
		System.out.println("");
	}
}
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED