CF1009B Minimum Ternary String

最新推荐文章于 2024-10-18 22:48:33 发布

꧁Q༒ོγ꧂

最新推荐文章于 2024-10-18 22:48:33 发布

阅读量58

点赞数

分类专栏：洛谷题解文章标签： c++

本文链接：https://blog.csdn.net/ababhhh/article/details/132271259

版权

洛谷题解专栏收录该内容

12 篇文章 1 订阅

订阅专栏

解决给定三元字符串通过特定交换规则转化为字典序最小形式的问题，涉及字符串操作和优化技巧。

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

Minimum Ternary String

题目描述

You are given a ternary string (it is a string which consists only of characters ‘0’, ‘1’ and ‘2’).

You can swap any two adjacent (consecutive) characters ‘0’ and ‘1’ (i.e. replace “01” with “10” or vice versa) or any two adjacent (consecutive) characters ‘1’ and ‘2’ (i.e. replace “12” with “21” or vice versa).

For example, for string “010210” we can perform the following moves:

“010210” $\rightarrow$ “100210”;
“010210” $\rightarrow$ “001210”;
“010210” $\rightarrow$ “010120”;
“010210” $\rightarrow$ “010201”.

Note than you cannot swap “02” $ \rightarrow $ “20” and vice versa. You cannot perform any other operations with the given string excluding described above.

You task is to obtain the minimum possible (lexicographically) string by using these swaps arbitrary number of times (possibly, zero).

String $a$ is lexicographically less than string $b$ (if strings $a$ and $b$ have the same length) if there exists some position $i$ ( $\le i \le |a|$ , where $∣ s ∣$ is the length of the string $s$ ) such that for every $j < i$ holds $a_j = b_j$ , and $a_i < b_i$ .

输入格式

The first line of the input contains the string $s$ consisting only of characters ‘0’, ‘1’ and ‘2’, its length is between $1$ and $10^5$ (inclusive).

输出格式

Print a single string — the minimum possible (lexicographically) string you can obtain by using the swaps described above arbitrary number of times (possibly, zero).

题面翻译

题目描述

给定一个由 ‘0’, ‘1’, ‘2’ 组成的字符串 $S$ 。可以交换相邻’0’, ‘1’或’1’, '2’的位置（例如：‘12’ - ‘21’ $\;$ ‘01’ - ‘10’）请输出原字符串经过任意转换后字典序最小的字符串。原字符串长度不超过 $10^5$ 。

输入格式

字符串 $S$

输出格式

转化后字典序最小的字符串

样例 #1

样例输入 #1

样例输出 #1

样例 #2

样例输入 #2

11222121

样例输出 #2

11112222

样例 #3

样例输入 #3

样例输出 #3

思路

这道题单纯模拟肯定会超时，但我们会发现 $0$ 和 $1$ 可以交换， $1$ 和 $2$ 可以交换 $0$ 和 $2$ 不可以交换，也就是说 $1$ 可以换到任何位置，因此我们可以先把所有的 $1$ 取出，得到一个由 $0$ 和 $2$ 组成的字符串，由于 $0$ 和 $2$ 不能交换，且要得到字典序最小的字符串，我们要把所有的 $1$ 放在第一个 $2$ 前。
然后要再特判一下没有 2 的字符串。

代码

/*************************************************
Note:
*************************************************/
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <stdio.h>
#include <iostream>
#include <vector>
#include <iomanip>
#include <string.h>
#include <algorithm>
#include <cmath>
#include <cstring>
#define ll long long
#define ull unsigned long long
using namespace std;
const int N = 1e5 + 10;
const int INF = 0x3f3f3f3f;
inline int read()
{
    int s = 0, w = 1;
    char ch = getchar();
    while (ch < '0' || ch > '9')
    {
        if (ch == '-')
            w = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9')
        s = s * 10 + ch - '0', ch = getchar();
    return s * w;
}
int n, cnt, num;
string s, ans;
int main()
{
    cin >> s;
    for (int i = 0; i < s.size(); i++)
    {
        if (s[i] == '1')
        {
            cnt++;
            continue;
        }
        ans += s[i];
    }
    num = ans.size();
    for (int i = 0; i < ans.size(); i++)
    {
        if (ans[i] == '2')
        {
            num = i;
            break;
        }
    }
    for (int j = 0; j < cnt; j++)
    {
        ans.insert(ans.begin() + num, '1');
    }
    cout << ans << endl;
}