Internet connection

import java.util.*;
public class Task2
{
public static void main(String[] args)
{
	Scanner s = new Scanner(System.in);
	int n = s.nextInt();
	int m = s.nextInt();
	int[][] am = new int [n+1][n+1];
	int flow = 0;
	for(int i = 0; i < m; i++)
	{
		int x = s.nextInt();
		int y = s.nextInt();
		am[x][y] = s.nextInt();
	} 
	
	List<Integer> visited = new ArrayList<Integer>();
	List<Integer> track = new ArrayList<Integer>();
	/*List<Integer> path = find_path(am, 1, n, visited, track);
	System.out.println(path);
	flow = flow_of_path(am, path);
	System.out.println(flow);
	switch_edges(am, path, flow);
	printam(am);
	path = find_path(am, 1, n, visited, track);
	*/
	while(find_path(am, 1, n, visited, track).size() != 0)
	{
		visited = new ArrayList<Integer>();
		track = new ArrayList<Integer>();
		List<Integer> path = find_path(am, 1, n, visited, track);
		int tmp_flow = flow_of_path(am, path);
		flow += flow_of_path(am, path);
		am = switch_edges(am,path, tmp_flow);		
		printam(am);
		visited = new ArrayList<Integer>();
		track = new ArrayList<Integer>();
	}
	System.out.println(flow);
}

public static int[][] switch_edges(int [][] am, List<Integer> path, int 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 int flow_of_path(int [][] am, List<Integer> path)
{
	int flow = Integer.MAX_VALUE;
	for (int i = 0; i < path.size()-1; i++)
        {
			int x = path.get(i);
			int y = path.get(i+1);
			//System.out.print("x: " + x + " y: " + y);		
			if(am[x][y] < flow)
				flow = am[x][y];
	}
	return flow;
}
public static List<Integer> find_path(int[][] am, int source, int target, List<Integer> visited, List<Integer> track)
{
	visited.add(source);
	for(int i = 1; i < am[source].length; i++)
	{	
		if(am[source][i] != 0 && !visited.contains(i))
		{
			if(i == target)
			{
				track.add(0, target);
				track.add(0, source);
				return track;
			}
			else
			{
				List<Integer> track_from_i = find_path(am, i, target, visited, track);
				if(track_from_i.contains(target))
				{
					track.add(0, source);
					return track;
				}
				
			}	
		}	
 	}
	return (new ArrayList<Integer>());  
	
}

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: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: TIME LIMIT EXCEEDED

Test 7

Verdict: TIME LIMIT EXCEEDED

Test 8

Verdict: TIME LIMIT EXCEEDED

Test 9

Verdict: TIME LIMIT EXCEEDED

Test 10

Verdict: TIME LIMIT EXCEEDED