Algorithm

B. Lawnmower
time limit per test
2 seconds
memory limit per test
256 megabytes
Problem Link- https://codeforces.com/problemset/problem/115/B
input
standard input
output
standard output

You have a garden consisting entirely of grass and weeds. Your garden is described by an n × m grid, with rows numbered 1 to n from top to bottom, and columns 1 to m from left to right. Each cell is identified by a pair (r, c) which means that the cell is located at row r and column c. Each cell may contain either grass or weeds. For example, a 4 × 5 garden may look as follows (empty cells denote grass):

You have a land-mower with you to mow all the weeds. Initially, you are standing with your lawnmower at the top-left corner of the garden. That is, at cell (1, 1). At any moment of time you are facing a certain direction — either left or right. And initially, you face right.

In one move you can do either one of these:

1) Move one cell in the direction that you are facing.

 

  • if you are facing right: move from cell (r, c) to cell (r, c + 1)

     

     

  • if you are facing left: move from cell (r, c) to cell (r, c - 1)

     

2) Move one cell down (that is, from cell (r, c) to cell (r + 1, c)), and change your direction to the opposite one.

 

  • if you were facing right previously, you will face left

     

     

  • if you were facing left previously, you will face right

     

You are not allowed to leave the garden. Weeds will be mowed if you and your lawnmower are standing at the cell containing the weeds (your direction doesn't matter). This action isn't counted as a move.

What is the minimum number of moves required to mow all the weeds?

Input

The first line contains two integers n and m (1 ≤ n, m ≤ 150) — the number of rows and columns respectively. Then follow n lines containing m characters each — the content of the grid. "G" means that this cell contains grass. "W" means that this cell contains weeds.

It is guaranteed that the top-left corner of the grid will contain grass.

Output

Print a single number — the minimum number of moves required to mow all the weeds.

Examples
input
Copy
4 5
GWGGW
GGWGG
GWGGG
WGGGG
output
Copy
11
input
Copy
3 3
GWW
WWW
WWG
output
Copy
7
input
Copy
1 1
G
output
Copy
0
Note

For the first example, this is the picture of the initial state of the grid:

A possible solution is by mowing the weeds as illustrated below:

 

Code Examples

#1 Code Example with C++ Programming

Code - C++ Programming

#include<iostream>
#include<vector>

long abs(long x){return x>=0?x:-x;}

int main(){

    long rows, cols; std::cin >> rows >> cols;
    std::vector<std::string> m(rows);
    for(int p = 0; p < rows; p++){std::cin >> m[p];}

    long rr(0), cc(0), res(0);
    for(long row = 0; row < rows; row++){
        long startCol = (row % 2) ? (cols - 1) : 0;
        long stepCol = (row % 2) ? -1 : 1;
        for(long col = startCol; col >=0 && col < cols; col += stepCol){
            if(m[row][col]=='W'){
                long xdiff = (cc > col) ? (cc - col) : (col - cc);
                long ydiff = (rr > row) ? (rr - row) : (row - rr);
                res += xdiff + ydiff;
                rr = row; cc = col;
            }
        }
    }

    std::cout << res << std::endl;
    return 0;
}
Copy The Code & Try With Live Editor

Input

x
–
+
cmd
4 5
GWGGW
GGWGG
GWGGG
WGGGG

Output

x
–
+
cmd
11
Advertisements

Demonstration

Codeforces Solution-B. Lawnmower-Solution in C, C++, Java, Python

Previous
Codeforces solution 1080-B-B. Margarite and the best present codeforces solution
Next
CodeChef solution DETSCORE - Determine the Score CodeChef solution C,C+