Codeforces Beta Round 58
E
World Evil
Codeforces
2700
原题
← D→
翻译中…

As a result of Pinky and Brain's mysterious experiments in the Large Hadron Collider some portals or black holes opened to the parallel dimension. And the World Evil has crept to the veil between their world and ours. Brain quickly evaluated the situation and he understood that the more evil tentacles creep out and become free, the higher is the possibility that Brain will rule the world.

翻译中…

The collider's constriction is a rectangular grid rolled into a cylinder and consisting of $*n*$ rows and $*m*$ columns such as is shown in the picture below:

翻译中…

image

翻译中…

In this example $*n* = 4$, $*m* = 5$. Dotted lines are corridores that close each column to a ring, i. e. connect the $*n*$-th and the $1$-th rows of the grid.

翻译中…

In the leftmost column of the grid the portals are situated and the tentacles of the World Evil are ready to creep out from there. In the rightmost column the exit doors are located. The tentacles can only get out through those doors. The segments joining the nodes of the grid are corridors.

翻译中…

Brain would be glad to let all the tentacles out but he faces a problem: the infinite number of tentacles can creep out of the portals, every tentacle possesses infinite length and some width and the volume of the corridors are, unfortunately, quite limited. Brain could approximately evaluate the maximal number of tentacles that will be able to crawl through every corridor.

翻译中…

Now help the mice to determine the maximal number of tentacles of the World Evil that will crawl out of the Large Hadron Collider.

翻译中…

Input

翻译中…

The first line of the input file contains two integers $*n*$ and $*m*$ ($2 ≤ *n* ≤ 5$, $2 ≤ *m* ≤ 10^{5}$). They are the sizes of the Large Hadron Collider grid. The next $*m* - 1$ lines contain $*n*$ numbers each. They are the horizontal corridors' capacities. The next $*m*$ lines contain $*n*$ numbers each. They are the vertical corridors' capacities. Corridors are described from left to right and from top to bottom. Every $*n*$-th vertical corridor connects nodes of the $*n*$-th and $1$-th rows. A corridor's capacity is a non-negative integer that does not exceed $10^{9}$.

翻译中…

Output

翻译中…

Print a single number, the number of the World Evil tentacles Pinky and Brain will command.

翻译中…

Please, do not use %lld specificator to read or write 64-bit integers in C++. It is preffered to use cout (also you may use %I64d).

翻译中…

样例

Input #1
3 4
4 4 4
1 1 5
5 5 3
4 1 2
1 3 1
3 5 4
1 4 3
Output #1
7
InputCopy OutputCopy
Input #2
2 2
9 2
2 3
6 1
Output #2
11
InputCopy OutputCopy
题目信息
题号
62E
时间限制
5 s
内存限制
256 MB
标签
动态规划
网络流

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。