Bertown is a city with nn 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 nn, where the ii-th character is "1" if there is a mine under the building number ii 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 xx is activated, it explodes and activates two adjacent mines under the buildings numbered x-1x−1 and x+1x+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 aa 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 bb 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 tt (1 \le t \le 10^51≤t≤105) — the number of test cases. Then tt test cases follow.
Each test case begins with a line containing two integers aa and bb (1 \le a, b \le 10001≤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 exceed 10^5105.
Output
For each test case, output one integer — the minimum number of coins that the sapper will have to pay.
Sample 1
Inputcopy | Outputcopy |
---|---|
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=1b=1 coin for placing a mine and a=5a=5 coins for activating.
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int a,b;
scanf("%d %d",&a,&b);
string ok;
cin>>ok;
int ans=0;
int flag=0, sum=0;
for(int i=0; i<ok.length(); i++)
{
if(ok[i]=='1')
{
if(!flag)
flag=1,
ans=a;
else
ans+=min(a,sum*b);
sum=0;
}
if(ok[i]=='0')
sum++;
}
cout<<ans<<endl;
}
return 0;
}