Submission #1778815

---

Source Code Expand

def dfs(graph, used, from, to, flow)
  return flow if from==to
  used[from] = true
  graph[from].each{|edge|
    next if used[edge[0]] || edge[1]<=0
    fmin = edge[1]
    fmin = flow if fmin > flow
    d = dfs(graph, used, edge[0], to, fmin)
    if d>0 then
      edge[1] -= d
      graph[edge[0]][edge[2]][1] += d
      return d
    end
  }
  return 0
end

n,g,e = gets.split.map &:to_i
v = n+1
source = 0
sink = n
graph = v.times.map{[]} 

p = gets.split.map &:to_i
e.times{
  a,b = gets.split.map &:to_i
  graph[a]<<[b, 1,  graph[b].size]
  graph[b]<<[a, 1, graph[a].size-1]
}
p.each{|tmp|
  graph[tmp]<<[sink, 1,  graph[sink].size]
  graph[sink]<<[tmp, 1, graph[tmp].size-1]
}

used = Array.new(v,false)
flow = 0
while 1
  v.times{|i|used[i]=false}
  f = dfs(graph, used, source, sink, 1000000000)
  break if f==0
  flow += f
end

p flow

Submission Info

Compile Error

./Main.rb:18: warning: `&' interpreted as argument prefix
./Main.rb:24: warning: `&' interpreted as argument prefix
./Main.rb:26: warning: `&' interpreted as argument prefix
./Main.rb:37: warning: literal in condition
./Main.rb:18: warning: assigned but unused variable - g

Judge Result