Codeforces Round #352 (Div. 2)(B)思维

原创 2016年05月31日 17:58:02

B. Different is Good
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

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 allsubstrings of 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.

Input

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.

Output

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.

Examples
input
2
aa
output
1
input
4
koko
output
2
input
5
murat
output
0
Note

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".


题意:给你长度为n的字符串,问能否通过修改字符使得字符串的所有子串都不同,如果可以请输出修改最少的次数,如果不可以就输出-1



题解:这一题稍微想一下就会明白,如果要求所有的子串都不同,那么显然不能有相同的字母,如果长度大于26很明显没有解,否则就统计相同字符的个数,就可以啦



import java.lang.*;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO 自动生成的方法存根
		Scanner in = new Scanner(System.in);
		String s = new String();
		String n = new String();
		n=in.nextLine();
		s=in.nextLine();
		//System.out.println(n+" "+s);
		if(s.length()>26)
		{
			System.out.println(-1);
		}
		else
		{
			int cnt[] = new int[300];
			for(int i=0;i<150;i++)
			{
				cnt[i]=0;
			}
			for(int i=0;i<s.length();i++)
			{
				cnt[s.charAt(i)]++;
			}
			int ans=0;
			for(int i=0;i<150;i++)
			{
				if(cnt[i]>0)
				{
					ans+=(cnt[i]-1);
				}
			}
			System.out.println(ans);
		}
	}
}






版权声明:本文为博主原创文章,你若想转载请附上源博客地址。

相关文章推荐

Codeforces Round #352 (Div. 2) B. Different is Good __ substrings water problem

the smallest Substring of the given string can be lowercase English letters, so if it is possible to...

Codeforces Round #352 (Div. 2) B. Different is Good

B. Different is Good time limit per test 2 seconds memory limit per test 256 megabytes ...

Codeforces Round #352 (Div. 2)-B. Different is Good(模拟)

B. Different is Good time limit per test 2 seconds memory limit per test 256 megabytes ...

Codeforces Round #352 (Div. 1) B. Robin Hood

We all know the impressive story of Robin Hood. Robin Hood uses his archery skills and his wits to s...

Codeforces Round #384 (Div. 2) (A+B)(思维)

A. Vladik and flightstime limit per test:2 secondsmemory limit per test:256 megabytesinput:standard ...

Codeforces Aim Tech Round 3 (Div.2 )B.Checkpoints【思维】

B. Checkpoints time limit per test 1 second memory limit per test 256 megabytes input standard...

Codeforces Round #418 (Div. 2) A+B(思维)

A. An abandoned sentiment from past time limit per test1 second memory limit per test256 megabytes...

【Codeforces Round 336 (Div 2) C】【贪心 DP思维】Chain Reaction 每个灯塔位置为a[]破坏b[]范围所有灯塔 设置一个灯塔使得最多灯塔被保留

C. Chain Reaction time limit per test 2 seconds memory limit per test 256 megabytes ...

Codeforces Round #384(Div. 2)B. Chloe and the sequence【思维+lowbit】

B. Chloe and the sequence time limit per test 1 second memory limit per test 256 megabytes ...

Codeforces Round #423 (Div. 2) B Black Square 黑色正方形 思维题

CF传送门 题意: 1. 给你由B和W组成的二维图 2. 要求把最少数量的W变成B使得图内所有的B形成一个正方形 3. 如果不能形成正方形就输出-1 题解: 1. 如果这张图全是W,那...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)