A15791 | Binary String Sorting
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given a binary string $s$ consisting of only characters 0 and/or 1.
You can perform several operations on this string (possibly zero). There are two types of operations:
- choose two consecutive elements and swap them. In order to perform this operation, you pay $10^{12}$ coins;
- choose any element from the string and remove it. In order to perform this operation, you pay $10^{12}+1$ coins.
Your task is to calculate the minimum number of coins required to sort the string $s$ in non-decreasing order (i. e. transform $s$ so that $s_1 \le s_2 \le \dots \le s_m$ , where $m$ is the length of the string after applying all operations). An empty string is also considered sorted in non-decreasing order.
You can perform several operations on this string (possibly zero). There are two types of operations:
- choose two consecutive elements and swap them. In order to perform this operation, you pay $10^{12}$ coins;
- choose any element from the string and remove it. In order to perform this operation, you pay $10^{12}+1$ coins.
Your task is to calculate the minimum number of coins required to sort the string $s$ in non-decreasing order (i. e. transform $s$ so that $s_1 \le s_2 \le \dots \le s_m$ , where $m$ is the length of the string after applying all operations). An empty string is also considered sorted in non-decreasing order.
输入格式
The first line contains a single integer $t$ ( $1 \le t \le 10^4$ ) — the number of test cases.
The only line of each test case contains the string $s$ ( $1 \le |s| \le 3 \cdot 10^5$ ), consisting of only characters 0 and/or 1.
The sum of lengths of all given strings doesn't exceed $3 \cdot 10^5$ .
The only line of each test case contains the string $s$ ( $1 \le |s| \le 3 \cdot 10^5$ ), consisting of only characters 0 and/or 1.
The sum of lengths of all given strings doesn't exceed $3 \cdot 10^5$ .
输出格式
For each test case, print a single integer — the minimum number of coins required to sort the string $s$ in non-decreasing order.
输入输出样例
输入 #1
6 100 0 0101 00101101 1001101 11111
输出 #1
1000000000001 0 1000000000000 2000000000001 2000000000002 0
In the first example, you have to remove the $1$ -st element, so the string becomes equal to 00.
In the second example, the string is already sorted.
In the third example, you have to swap the $2$ -nd and the $3$ -rd elements, so the string becomes equal to 0011.
In the fourth example, you have to swap the $3$ -rd and the $4$ -th elements, so the string becomes equal to 00011101, and then remove the $7$ -th element, so the string becomes equal to 0001111.
In the fifth example, you have to remove the $1$ -st element, so the string becomes equal to 001101, and then remove the $5$ -th element, so the string becomes equal to 00111.
In the sixth example, the string is already sorted.
In the second example, the string is already sorted.
In the third example, you have to swap the $2$ -nd and the $3$ -rd elements, so the string becomes equal to 0011.
In the fourth example, you have to swap the $3$ -rd and the $4$ -th elements, so the string becomes equal to 00011101, and then remove the $7$ -th element, so the string becomes equal to 0001111.
In the fifth example, you have to remove the $1$ -st element, so the string becomes equal to 001101, and then remove the $5$ -th element, so the string becomes equal to 00111.
In the sixth example, the string is already sorted.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted