Educational Codeforces Round 88 (Rated for Div. 2) B. New Theatre Square

最新推荐文章于 2020-06-07 16:36:06 发布

Huffman_Tree_

最新推荐文章于 2020-06-07 16:36:06 发布

阅读量266

点赞数

转载请注明出处//https://blog.csdn.net/qq_43658924

本文链接：https://blog.csdn.net/qq_43658924/article/details/106461451

版权

这道题目要求计算覆盖所有白色方格的最小总成本，使用1×1和1×2两种尺寸的瓷砖。每种瓷砖有不同的价格，且1×2瓷砖必须沿同一行放置。测试用例包含多个案例，每个案例给出广场的尺寸、瓷砖价格以及黑白方格布局。需要找到覆盖所有白色方格的最省钱策略。

摘要由CSDN通过智能技术生成

B. New Theatre Square
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
You might have remembered Theatre square from the problem 1A. Now it’s finally getting repaved.

The square still has a rectangular shape of n×m meters. However, the picture is about to get more complicated now. Let ai,j be the j-th square in the i-th row of the pavement.

You are given the picture of the squares:

if ai,j= “*”, then the j-th square in the i-th row should be black;
if ai,j= “.”, then the j-th square in the i-th row should be white.
The black squares are paved already. You have to pave the white squares. There are two options for pavement tiles:

1×1 tiles — each tile costs x burles and covers exactly 1 square;
1×2 tiles — each tile costs y burles and covers exactly 2 adjacent squares of the same row. Note that you are not allowed to rotate these tiles or cut them into 1×1 tiles.
You should cover all the white squares, no two tiles should overlap and no black squares should be covered by tiles.

What is the smallest total price of the tiles needed to cover all the white squares?

Input
The first line contains a single integer t (1≤t≤500) — the number of testcases. Then the description of t testcases follow.

The first line of each testcase contains four integers n, m, x and y (1≤n≤100; 1≤m≤1000; 1≤x,y≤1000) — the size of the Theatre square, the price of the 1×1 tile and the price of the 1×2 tile.

Each of the next n lines contains m characters. The j-th character in the i-th line is ai,j. If ai,j= “*”, then the j-th square in the i-th row should be b