Codeforces Round #352 (Div. 2) B. Different is Good
来源:互联网 发布:fixmail 删除网络邮件 编辑:程序博客网 时间:2024/05/14 23:22
A wise man told Kerem "Different is good" once, so Kerem wants all things in his life to be different.
Kerem recently got a string s consisting of lowercase English letters. Since Kerem likes it when things are different, he wants all substringsof his string s to be distinct. Substring is a string formed by some number of consecutive characters of the string. For example, string "aba" has substrings "" (empty substring), "a", "b", "a", "ab", "ba", "aba".
If string s has at least two equal substrings then Kerem will change characters at some positions to some other lowercase English letters. Changing characters is a very tiring job, so Kerem want to perform as few changes as possible.
Your task is to find the minimum number of changes needed to make all the substrings of the given string distinct, or determine that it is impossible.
The first line of the input contains an integer n (1 ≤ n ≤ 100 000) — the length of the string s.
The second line contains the string s of length n consisting of only lowercase English letters.
If it's impossible to change the string s such that all its substring are distinct print -1. Otherwise print the minimum required number of changes.
2aa
1
4koko
2
5murat
0
In the first sample one of the possible solutions is to change the first character to 'b'.
In the second sample, one may change the first character to 'a' and second character to 'b', so the string becomes "abko".
要求所有子集都各不相同,空集不用管,考虑极端情况集合中只有一个元素的时候,要保证所有子集各不相同,必须保证输入的字符串中每个元素各异,有重复的
要把重复的换成a - z中在字符串中没有出现过的,由此可见,若字符串长度大于26,根据鸽笼原理,那么肯定不能保证他们各异,因为a - z只有26个字母,第27个肯定至少跟
26个中的一个相同。在字符串小于等于26的时候去重就行了。
既然保证每个元素都互不相同,那么他们组成的更长的字符串肯定也互不相同
#include <cstdio>#include <cstring>#include <algorithm>#include <iostream>#include <cstdlib>#include <stack>#include <queue>#include <string>using namespace std;const int maxn = 100000;char s[maxn + 10];int a[30];int main(){int n;scanf("%d", &n);scanf("%s", s);memset(a, 0, sizeof(a));for (int i = 0; i < n; i++) {a[s[i] - 'a']++;}if (n > 26) {puts("-1");}else {int ans = 0;for (int i = 0; i < 26; i++) {if (a[i])ans += (a[i] - 1);}printf("%d\n", ans);}return 0;}
- Codeforces Round #352 (Div. 2) B. Different is Good
- Codeforces Round #352 (Div. 2) B. Different is Good __ substrings water problem
- Codeforces Round #352 (Div. 2)-B. Different is Good(模拟)
- CodeForces 672B Different is Good
- CodeForces-672B-Different is Good
- CodeForces 672B Different is Good
- [CodeForces]-672B-Different is Good
- Codeforces 672B Different is Good【水题】
- B. Different is Good
- CodeForces - 672B Different is Good (模拟)水
- CodeForces 672B Different is Good(和而不同)
- Codeforces Round #313 (Div. 2) B. Gerald is into Art
- Codeforces Round #313 (Div. 2)-B. Gerald is into Art
- Codeforces Round #388 (Div. 2)B Parallelogram is Back
- Codeforces Round #388 (Div. 2) 749B Parallelogram is Back
- Codeforces Round #266 (Div. 2)(good)
- Codeforces Round #279 (Div. 2)(good)
- Codeforces Round #280 (Div. 2)E good
- 命令模式在MVC框架中的应用
- 1.创建型.4.原型模式
- dblink的查询与删除
- 小波函数的数据拟合方法
- C primer plus 学习之存储类、链接、内存管理
- Codeforces Round #352 (Div. 2) B. Different is Good
- Android 自定义SnakeBar
- 2.结构型.1.组合模式
- Summary Ranges
- zoj1171题解
- 2.结构型.2.适配器模式
- HDU 1003
- 收集android上开源的酷炫的交互动画和视觉效果:Interactive-animation
- tomcat 下配置ajax 跨域 访问