for _ in range(int(input())):
n,m,x,y = map(int, input().split())
grid = [[i for i in input()] for j in range(n)]
count = 0
if 2*x <= y:
for row in grid:
for i in row:
if i == '.':
count += x
else:
for row in grid:
for i in range(len(row)):
if row[i] == '.' and i != m-1:
if row[i+1] == '.':
count += y
row[i+1] = '*'
else:
count += x
elif row[i] == '.' and i == m-1:
count += x
print(count)#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <deque>
#include <cstring>
#include <stack>
using namespace std;
const int N=5e5+10,M=1e7+10,INF=0x3f3f3f3f,mod=1e9+7;
typedef pair<int,int>PII;
typedef long long LL;
char s[110][1100];
void solve()
{
int n,m,x,y;
cin>>n>>m>>x>>y;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
cin>>s[i][j];
LL ans=0;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
if(s[i][j]=='.')
{
if(j+1<=m&&s[i][j+1]=='.'&&y<=2*x)
{
j++;
ans+=y;
}
else ans+=x;
}
}
}
cout<<ans<<'\n';
}
signed main()
{
int T=1;
cin>>T;
while(T--)solve();
}39F - Pacifist frogs | 1451C - String Equality |
386A - Second-Price Auction | 1690E - Price Maximization |
282B - Painting Eggs | 440A - Forgotten Episode |
233B - Non-square Equation | 628B - New Skateboard |
262B - Roma and Changing Signs | 755C - PolandBall and Forest |
456B - Fedya and Maths | 376B - IOU |
1623B - Game on Ranges | 1118A - Water Buying |
1462C - Unique Number | 301A - Yaroslav and Sequence |
38A - Army | 38C - Blinds |
1197A - DIY Wooden Ladder | 1717D - Madoka and The Corruption Scheme |
1296D - Fight with Monsters | 729D - Sea Battle |
788A - Functions again | 1245B - Restricted RPS |
1490D - Permutation Transformation | 1087B - Div Times Mod |
1213B - Bad Prices | 1726B - Mainak and Interesting Sequence |
1726D - Edge Split | 1726C - Jatayu's Balanced Bracket Sequence |