A881.Radio Contact--Gold
普及/提高-
通过率:0%
时间限制:1.00s
内存限制:128MB
题目描述
Farmer John has lost his favorite cow bell, and Bessie the cow has agreed to
help him find it! They both fan out and search the farm along different paths,
but stay in contact via radio so they can keep in touch with each-other.
Unfortunately, the batteries in their radios are running low, so they want to
plan their movements so as to conserve power, by trying to stay always within
a short distance apart.
Farmer John starts at location (fx,fy) and plans to follow a path
consisting of N steps, each of which is either 'N' (north), 'E' (east), 'S'
(south), or 'W' west. Bessie starts at location (bx,by) and follows a
similar path consisting of M steps. Both paths may share points in common.
At each time step, Farmer John can either stay put at his current location, or
take one step forward along his path, in whichever direction happens to be
next (assuming he has not yet reached the final location in his path). Bessie
can make a similar choice. At each time step (excluding the first step where
they start at their initial locations), their radios consume energy equal to
the square of the distance between them.
Please help FJ and Bessie plan a joint movement strategy that will minimize
the total amount of energy consumed up to and including the final step where
both of them first reach the final locations on their respective paths.
输入格式
The first line of input contains N and M (1≤N,M≤1000). The
second line contains integers fx and fy, and the third line contains
bx and by (0≤fx,fy,bx,by≤1000). The next line
contains a string of length N describing FJ's path, and the final line
contains a string of length M describing Bessie's path.
It is guranteed that Farmer John and Bessie's coordinates are always in the
range (0≤x,y≤1000) throughout their journey. Note that East points
in the positive x direction and North points in the positive y direction.
输出格式
Output a single integer specifying the minimum energy FJ and Bessie can use
during their travels.
输入输出样例
输入#1
2 7 3 0 5 0 NN NWWWWWN
输出#1
28