Luo Gu $ P4001 \ [ICPC-Beijing 2006] $ wolf caught rabbits network flow

Positive Solutions: Network Flow

Report problem solving:

Portal!

$ Umm $ daily read a series of questions $ kk $. In fact, that is, given a $ n \ cdot n $ grid graph, find the minimum cut $ QwQ $

Then trellis diagram, then clearly a plan view, and see the data range $ n \ leq 1000 $, obviously consider a plan view of FIG turn dual chant

Then it seems there is nothing the details ,,,?

$ Written $