Codeforces Round #417 (Div. 2) B. 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分钟，问最少要多少分钟可以关掉所有的灯。

分析：从题面上可以看出用动态规划，然后想到，到达当前层有两种状态，一种是从左边楼梯到达，一种是从右边。

那么我们可以设置一个大小为dp[2][2]的数组去进行dp，因为每次状态的转移只涉及到前一次和当前次（脑抽的用了状态压缩）。

要注意如果当前层全部关了灯的话也需要1分钟的时间去上楼。

可以避免这个考虑，因为最后都是要上到有灯的最高层，所以只需要计算出到达每一层的最小时间。

最后用到达有灯的最高楼层的时间加上有灯的最高楼层-1，就可以了。

还有就是灯全灭的情况直接输出0；

AC代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int dp[2][2],st[20]={0},ed[20]={0};
int main()
{
	int n,m;
	scanf("%d%d",&n,&m);
	for(int i=n-1; i>=0; i--)
	{
		int f=0;
		char s[200];
		scanf("%s",s);
		for(int j=1;j<=m;j++)
		{
			if(s[j]=='1'&&!f) 
			st[i]=j,f=1;
			if(s[j]=='1') 
			ed[i]=j;
		}
	}
	int tp=n-1, bt=0;
	while(tp>=0) 
	{
		if(st[tp]!=0) 
		break; 
		else 
		tp--;
	}
	while(bt<=n-1) 
	{
		if(st[bt]!=0) 
		break; 
		else 
		bt++;
	}
	dp[0][0]=ed[bt];dp[0][1]=1e7;
	int j=0;
	int ans=min(dp[0][0],dp[0][1]);
	for(int i=bt+1; i<=tp; i++)
	{
		if(st[i]==0)
		{
			st[i]=st[i-1], ed[i]=ed[i-1];
			continue;
		}
		j^=1;
		dp[j][0]=min(dp[j^1][0]+ed[i-1]+ed[i], dp[j^1][1]+st[i-1]+ed[i]);
		dp[j][1]=min(dp[j^1][0]+m+1-ed[i-1]+m+1-st[i], dp[j^1][1]+m+1-st[i-1]+1+m-st[i]);
		ans=min(dp[j][0],dp[j][1]);
	}
	if(tp==-1)
	printf("0\n");
	else 
	printf("%d\n",ans+tp);
}