Minimum Ternary String CodeForces

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” →→ “100210”;
“010210” →→ “001210”;
“010210” →→ “010120”;
“010210” →→ “010201”.
Note than you cannot swap “02” →→ “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 aa is lexicographically less than string bb (if strings aa and bb have the same length) if there exists some position ii (1≤i≤|a|1≤i≤|a|, where |s||s| is the length of the string ss) such that for every j<ij<i holds aj=bjaj=bj, and ai<biai<bi.

Input
The first line of the input contains the string ss consisting only of characters ‘0’, ‘1’ and ‘2’, its length is between 11 and 105105 (inclusive).

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

Examples
Input
100210
Output
001120
Input
11222121
Output
11112222
Input
20
Output
20
思路：很不错的一道题目。1可以和0交换，也可以和2交换。那么1就要尽可能的往前。0和2不能交换，那么第一个2后面的那些0和2的相对位置是不会变的，因为1我们要让它尽可能的往前，这样才是最优的。因此我们将第一个2前面的0放置在最前面，后面排上所有的1，剩下的0和2相对位置就不变了。
代码如下：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#include<stack>
#include<map>
#include<algorithm>
#define inf 0x3f3f3f3f
using namespace std;
const int maxn=1e5+10;
typedef long long ll;
char s[maxn],str[maxn];
int main()
{scanf("%s",&s);int n = strlen(s);int sum = 0； // 第一个2 前边0 的个数 int sum1 = 0;  // 1 的个数int k = 0,flag = 0;for(int i=0;i<n;i++){if(s[i]=='0' && flag==0)sum++;else if(s[i]=='0' && flag==1)str[k++] = s[i];else if(s[i]=='1')sum1++;else if(s[i]=='2'){flag = 1;str[k++] = s[i];}}for(int i=0;i<sum;i++)printf("0");for(int i=0;i<sum1;i++)printf("1");printf("%s\n",str);return 0;
}

努力加油a啊，(^o)/~

Minimum Ternary String CodeForces - 1009B（思维）相关推荐

牛客网暑期ACM多校训练营(第三场): A. Ternary String（欧拉降幂+递推）
题目描述 A ternary string is a sequence of digits, where each digit is either 0, 1, or 2. Chiaki has a t ...
B. Ternary String
B. Ternary String B.三元字符串 time limit per test: 2 seconds time limit per test: 2 seconds memory limit ...
String类常用方法思维导图总结
String类常用方法思维导图总结给自己加油,保持每天都学习,更新博客!信Java得永生!
CSL分苹果小埋与扫雷 Doors Breaking and Repairing Key Set Balanced Ternary String
第一题CSL分苹果思路:基础动态规划,设m为所有苹果的数量和,dp[x]为,容量为x时候能分的最多苹果数目,那么wavator分到的最多苹果数目就是dp[m/2],tokitsukaze分到的苹果数 ...
UCF HSPT 2021 A . Minimum Excluded String (mex)
A . Minimum Excluded String [ 问题 7945 ] [ 讨论 ] 描述我们将最小排除 (mex) 字符串定义为不包含在给定字符串中的最小字符串.如果一个字符串的长度更短, ...
String[]转化暴露“思维误区”
那天写code,用到这个,强转,将页面传来的值转换为数组,结果是,当页面传来的只有一个值时,它是无法转换为数组的,只能获得1个string,只有length>1时才会转化为数组的形式,报的错误是 ...
Balanced Ternary String
https://codeforces.com/contest/1102/problem/D 题解: /* *@Author: STZG *@Language: C++ */ #include < ...
D. Mahmoud and Ehab and the binary string Codeforces Round #435 (Div. 2)
http://codeforces.com/contest/862/problem/D 交互题 fflush(stdout) 调试: 先行给出结果,函数代替输入 1 #include <cstd ...
Generate a String CodeForces - 710E（dp）
zscoder wants to generate an input file for some programming competition problem. His input is a str ...

Minimum Ternary String CodeForces - 1009B（思维）

Minimum Ternary String CodeForces - 1009B（思维）相关推荐

最新文章

热门文章