Saving the City

Bertown is a city with n buildings in a straight line.

The city's security service discovered that some buildings were mined. A map was compiled, which is a string of length n, where the i-th character is "1" if there is a mine under the building number i and "0" otherwise.

Bertown's best sapper knows how to activate mines so that the buildings above them are not damaged. When a mine under the building numbered x is activated, it explodes and activates two adjacent mines under the buildings numbered x−1 and x+1 (if there were no mines under the building, then nothing happens). Thus, it is enough to activate any one mine on a continuous segment of mines to activate all the mines of this segment. For manual activation of one mine, the sapper takes a coins. He can repeat this operation as many times as you want.

Also, a sapper can place a mine under a building if it wasn't there. For such an operation, he takes b coins. He can also repeat this operation as many times as you want.

The sapper can carry out operations in any order.

You want to blow up all the mines in the city to make it safe. Find the minimum number of coins that the sapper will have to pay so that after his actions there are no mines left in the city.

Input

The first line contains one positive integer t (1≤t≤10^5) — the number of test cases. Then t test cases follow.

Each test case begins with a line containing two integers a and b (1≤a,b≤1000) — the cost of activating and placing one mine, respectively.

The next line contains a map of mines in the city — a string consisting of zeros and ones.

The sum of the string lengths for all test cases does not exceed10^5.

Output

For each test case, output one integer — the minimum number of coins that the sapper will have to pay.

Sample 1

Input	Output
2 1 1 01000010 5 1 01101110	2 6

Note

In the second test case, if we place a mine under the fourth building and then activate it, then all mines on the field are activated. The cost of such operations is six, b=1 coin for placing a mine and a=5 coins for activating.

思路：

动态规划，找转移方程。

f(i,j)为第i个位置为j时的所需的coins数量。

（1）若当前位置i为1时

1. 若前一个位置i-1为1时 f(i,1)=f(i-1,1);
2. 若前一个位置i-1为0时 f(i,1)=min( f(i-1,0)+a, f(i-1,1))。

（2）若当前位置为0时

1. 若前一个位置i-1为1时 f(i,0)=f(i-1,1);
2. 若前一个位置i-1为0时 f(i,0)=f(i-1,0)。

边界可以缩短为第一个1开始到最后一个1结束。

#include<iostream>
#include<string.h>
using namespace std;
const int N=1e5;
int t,a,b,st,ed;
int f[N+5][2];
char m[N+5];
int main()
{
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d %d",&a,&b);
		cin>>m+1;
		ed=strlen(m+1);
		st=1;
		while(m[st]=='0')
			st++;
		while(m[ed]=='0')
			ed--;
		f[st][1]=a;
		for(int i=st+1;i<=ed;i++)
		{
			f[i][1]=f[i][0]=0;
			if(m[i]=='1')
			{
				if(m[i-1]=='1')
					f[i][1]=f[i-1][1];
				else
					f[i][1]=min(f[i-1][1],f[i-1][0]+a);	
			}
			else
			{
				f[i][1]=f[i-1][1]+b;
				if(m[i-1]=='1')
					f[i][0]=f[i-1][1];
				else 
					f[i][0]=f[i-1][0];
			}
		}
		cout<<f[ed][1]<<endl;
	}
	return 0;
}