Codeforces812B Sagheer, the Hausmeister

B. Sagheer, the Hausmeister

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Some people leave the lights at their workplaces on when they leave that is a waste of resources. As a hausmeister of DHBW, Sagheer waits till all students and professors leave the university building, then goes and turns all the lights off.

The building consists of n floors with stairs at the left and the right sides. Each floor has m rooms on the same line with a corridor that connects the left and right stairs passing by all the rooms. In other words, the building can be represented as a rectangle with n rows and m + 2 columns, where the first and the last columns represent the stairs, and the m columns in the middle represent rooms.

Sagheer is standing at the ground floor at the left stairs. He wants to turn all the lights off in such a way that he will not go upstairs until all lights in the floor he is standing at are off. Of course, Sagheer must visit a room to turn the light there off. It takes one minute for Sagheer to go to the next floor using stairs or to move from the current room/stairs to a neighboring room/stairs on the same floor. It takes no time for him to switch the light off in the room he is currently standing in. Help Sagheer find the minimum total time to turn off all the lights.

Note that Sagheer does not have to go back to his starting position, and he does not have to visit rooms where the light is already switched off.

Input

The first line contains two integers n and m (1 ≤ n ≤ 15 and 1 ≤ m ≤ 100) — the number of floors and the number of rooms in each floor, respectively.

The next n lines contains the building description. Each line contains a binary string of length m + 2 representing a floor (the left stairs, then m rooms, then the right stairs) where 0 indicates that the light is off and 1 indicates that the light is on. The floors are listed from top to bottom, so that the last line represents the ground floor.

The first and last characters of each string represent the left and the right stairs, respectively, so they are always 0.

Output

Print a single integer — the minimum total time needed to turn off all the lights.

Examples

input

2 2
0010
0100

output

5

input

3 4
001000
000010
000010

output

12

input

4 3
01110
01110
01110
01110

output

18

Note

In the first example, Sagheer will go to room 1 in the ground floor, then he will go to room 2 in the second floor using the left or right stairs.

In the second example, he will go to the fourth room in the ground floor, use right stairs, go to the fourth room in the second floor, use right stairs again, then go to the second room in the last floor.

In the third example, he will walk through the whole corridor alternating between the left and right stairs at each floor.

——————————————————————————————————————

题目的意思是给出一栋楼的灯的状态，每一栋一格花费1分钟，只能在两端的楼梯上楼

且只有一层的灯全关闭才能上楼，问最小时间。最下面是一楼，最上面是顶楼，人初始

在（n，1）的位置

思路：dp dp[i][0]表示在i层左边上楼的花费，dp[i][1]表示在i层右边上楼的花费

注意一层全空的情况即可

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <cmath>

using namespace std;

#define LL long long
const int inf=0x7fffffff;

int dp[20][2];
char mp[20][200];
int l[20],r[20];

int main()
{
    int n,m;
    scanf("%d%d",&n,&m);
    memset(l,0,sizeof l);
    memset(r,0,sizeof r);
    memset(dp,inf,sizeof dp);
    for(int i=n-1; i>=0; i--)
    {
        scanf("%s",&mp[i]);
        for(int j=0; j<m+2; j++)
        {
            if(mp[i][j]=='1')
                r[i]=j;
            if(mp[i][j]=='1'&&l[i]==0)
                l[i]=j;
        }
    }
    for(int i=n-1; i>=0; i--)
        if(l[i]==0&&r[i]==0)
            n--;
        else
            break;
    if(n==1)
        printf("%d",r[0]);
    else
    {
        dp[0][0]=2*r[0]+1;
        dp[0][1]=m+1+1;
        for(int i=1; i<n-1; i++)
        {
            if(l[i]==0&&r[i]==0)
                dp[i][0]=dp[i-1][0]+1,dp[i][1]=dp[i-1][1]+1;
            else
            {
                dp[i][0]=min(dp[i-1][0]+2*r[i],dp[i-1][1]+m+1)+1;
                dp[i][1]=min(dp[i-1][0]+m+1,dp[i-1][1]+(m+1-l[i])*2)+1;
            }
        }

        printf("%d\n",min(dp[n-2][0]+r[n-1],dp[n-2][1]+(m+1-l[n-1])));
    }

    return 0;
}