output_description: If the graph contains a negative cycle (a cycle whose sum of edge costs is a
  negative value) which is reachable from the source r, print
  
      
      
      NEGATIVE CYCLE
      
  
  in a line.
  
  Otherwise, print
  
      
      
      c0
      c1
      :
      c|V|-1
      
  
  The output consists of |V| lines. Print the cost of the shortest path from the
  source r to each vertex 0, 1, ... |V|-1 in order. If there is no path from the
  source to a vertex, print "INF".
input_description: An edge-weighted graph G (V, E) and the source r.
  
      
      
      |V| |E| r
      s0 t0 d0
      s1 t1 d1
      :
      s|E|-1 t|E|-1 d|E|-1
      
  
  |V| is the number of vertices and |E| is the number of edges in G. The graph
  vertices are named with the numbers 0, 1,..., |V|-1 respectively. r is the
  source of the graph.
  
  si and ti represent source and target vertices of i-th edge (directed) and di
  represents the cost of the i-th edge.
attempt: # Input acceptance
  import sys
  
  file_input = sys.stdin
  
  V, E, r = map(int, file_input.readline().split())
  
  edges = []
  
  for line in file_input:
      edges.append(tuple(map(int, line.split())))
  
  
  # Bellman???Ford algorithm
  distance = [float("inf")] * V
  distance[r] = 0
  
  for i in range(V):
      notUpdated = True
      for e in edges:
          t = e[1]
          temp_d = distance[e[0]] + e[2]
          if temp_d < distance[t]:
              distance[t] = temp_d
              notUpdated = False
      if notUpdated:
          break
  
  
  # Output
  if i == V - 1:
      print("NEGATICE CYCLE")
  else:
      print(*map(lambda x: str(x).upper(), distance), sep="\n")
  
problem_description: Single Source Shortest Path (Negative Edges)
samples: [{"input": "4 5 0\n    0 1 2\n    0 2 3\n    1 2 -5\n    1 3 1\n    2 3 2", "output": "0\n    2\n    -3\n    -1"}, {"input": "4 6 0\n    0 1 2\n    0 2 3\n    1 2 -5\n    1 3 1\n    2 3 2\n    3 1 0", "output": "NEGATIVE CYCLE"}, {"input": "4 5 1\n    0 1 2\n    0 2 3\n    1 2 -5\n    1 3 1\n    2 3 2", "output": "INF\n    0\n    -5\n    -3"}]