Internet connection

import java.util.*;
public class Task2
{
  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 tmp_flow;
    long[][] am = new long [n+1][n+1];
    long flow = 0;
    int x;
    int y;
    for(int i = 0; i < m; i++)
    {
      x = s.nextInt();
      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);
    visited = new ArrayList<Integer>();
    track = new ArrayList<Integer>();
    while(path.size() != 0)
    {
      tmp_flow = flow_of_path(am, path);
      flow += tmp_flow;
      am = switch_edges(am,path, tmp_flow);     
      path = find_path(am, 1, n, visited, track);
      visited = new ArrayList<Integer>();
      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 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, 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