提出 #5679332

---

ソースコード 拡げる

N,G,E = map(int,input().split())
P = [int(x) for x in input().split()]
AB = [[int(x) for x in input().split()] for _ in range(E)]


graph = [[0]*(N+1) for _ in range(N+1)]
for a,b in AB:
  graph[a][b] = 1
  graph[b][a] = 1
for p in P:
  graph[p][N] = 1


def find_path(graph,v,flow,visited):
  visited[v] = True
  if v == N:
    return [N],flow
  for w in range(N+1):
    f = graph[v][w]
    if f and not visited[w]:
      p,f = find_path(graph,w,min(flow,f),visited)
      if p is None:
        continue
      return p+[v],f
  return None,None

INF = 10**18

def max_flow(graph):
  visited = [False]*(N+1)
  p,f = find_path(graph,0,INF,visited)
  if p is None:
    return 0
  v = 0
  for w in p[::-1][1:]:
    # 残capに更新
    graph[v][w] -= 1
    graph[w][v] += 1
    v = w
  return f + max_flow(graph)

answer = max_flow(graph)
print(answer)

提出情報

ジャッジ結果