A13550 | New Theatre Square
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You might have remembered Theatre square from the [problem 1A](https://codeforces.com/problemset/problem/1/A). Now it's finally getting repaved.
The square still has a rectangular shape of $n \times m$ meters. However, the picture is about to get more complicated now. Let $a_{i,j}$ be the $j$ -th square in the $i$ -th row of the pavement.
You are given the picture of the squares:
- if $a_{i,j} = $ "\*", then the $j$ -th square in the $i$ -th row should be black;
- if $a_{i,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 \times 1$ tiles — each tile costs $x$ burles and covers exactly $1$ square;
- $1 \times 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 \times 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?
The square still has a rectangular shape of $n \times m$ meters. However, the picture is about to get more complicated now. Let $a_{i,j}$ be the $j$ -th square in the $i$ -th row of the pavement.
You are given the picture of the squares:
- if $a_{i,j} = $ "\*", then the $j$ -th square in the $i$ -th row should be black;
- if $a_{i,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 \times 1$ tiles — each tile costs $x$ burles and covers exactly $1$ square;
- $1 \times 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 \times 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?
输入格式
The first line contains a single integer $t$ ( $1 \le t \le 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 \le n \le 100$ ; $1 \le m \le 1000$ ; $1 \le x, y \le 1000$ ) — the size of the Theatre square, the price of the $1 \times 1$ tile and the price of the $1 \times 2$ tile.
Each of the next $n$ lines contains $m$ characters. The $j$ -th character in the $i$ -th line is $a_{i,j}$ . If $a_{i,j} = $ "\*", then the $j$ -th square in the $i$ -th row should be black, and if $a_{i,j} = $ ".", then the $j$ -th square in the $i$ -th row should be white.
It's guaranteed that the sum of $n \times m$ over all testcases doesn't exceed $10^5$ .
The first line of each testcase contains four integers $n$ , $m$ , $x$ and $y$ ( $1 \le n \le 100$ ; $1 \le m \le 1000$ ; $1 \le x, y \le 1000$ ) — the size of the Theatre square, the price of the $1 \times 1$ tile and the price of the $1 \times 2$ tile.
Each of the next $n$ lines contains $m$ characters. The $j$ -th character in the $i$ -th line is $a_{i,j}$ . If $a_{i,j} = $ "\*", then the $j$ -th square in the $i$ -th row should be black, and if $a_{i,j} = $ ".", then the $j$ -th square in the $i$ -th row should be white.
It's guaranteed that the sum of $n \times m$ over all testcases doesn't exceed $10^5$ .
输出格式
For each testcase print a single integer — the smallest total price of the tiles needed to cover all the white squares in burles.
输入输出样例
输入 #1
4 1 1 10 1 . 1 2 10 1 .. 2 1 10 1 . . 3 3 3 7 ..* *.. .*.
输出 #1
10 1 20 18
In the first testcase you are required to use a single $1 \times 1$ tile, even though $1 \times 2$ tile is cheaper. So the total price is $10$ burles.
In the second testcase you can either use two $1 \times 1$ tiles and spend $20$ burles or use a single $1 \times 2$ tile and spend $1$ burle. The second option is cheaper, thus the answer is $1$ .
The third testcase shows that you can't rotate $1 \times 2$ tiles. You still have to use two $1 \times 1$ tiles for the total price of $20$ .
In the fourth testcase the cheapest way is to use $1 \times 1$ tiles everywhere. The total cost is $6 \cdot 3 = 18$ .
In the second testcase you can either use two $1 \times 1$ tiles and spend $20$ burles or use a single $1 \times 2$ tile and spend $1$ burle. The second option is cheaper, thus the answer is $1$ .
The third testcase shows that you can't rotate $1 \times 2$ tiles. You still have to use two $1 \times 1$ tiles for the total price of $20$ .
In the fourth testcase the cheapest way is to use $1 \times 1$ tiles everywhere. The total cost is $6 \cdot 3 = 18$ .
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted