CF903G Yet Another Maxflow Problem
Description
In this problem you will have to deal with a very special network.
The network consists of two parts: part $ A $ and part $ B $ . Each part consists of $ n $ vertices; $ i $ -th vertex of part $ A $ is denoted as $ A_{i} $ , and $ i $ -th vertex of part $ B $ is denoted as $ B_{i} $ .
For each index $ i $ ( $ 1
Input Format
N/A
Output Format
N/A
Explanation/Hint
This is the original network in the example:
