CF771B Bear and Different Names

Bear and Different Names

Time limit1000 ms
Memory limit262144 kB

In the army, it isn’t easy to form a group of soldiers that will be effective on the battlefield. The communication is crucial and thus no two soldiers should share a name (what would happen if they got an order that Bob is a scouter, if there are two Bobs?).

A group of soldiers is effective if and only if their names are different. For example, a group (John, Bob, Limak) would be effective, while groups (Gary, Bob, Gary) and (Alice, Alice) wouldn’t.

You are a spy in the enemy’s camp. You noticed n soldiers standing in a row, numbered 1 through n. The general wants to choose a group of k consecutive soldiers. For every k consecutive soldiers, the general wrote down whether they would be an effective group or not.

You managed to steal the general’s notes, with n - k + 1 strings s1, s2, …, sn - k + 1, each either “YES” or “NO”.

The string s1 describes a group of soldiers 1 through k (“YES” if the group is effective, and “NO” otherwise).
The string s2 describes a group of soldiers 2 through k + 1.
And so on, till the string sn - k + 1 that describes a group of soldiers n - k + 1 through n.
Your task is to find possible names of n soldiers. Names should match the stolen notes. Each name should be a string that consists of between 1 and 10 English letters, inclusive. The first letter should be uppercase, and all other letters should be lowercase. Names don’t have to be existing names — it’s allowed to print “Xyzzzdj” or “T” for example.

Find and print any solution. It can be proved that there always exists at least one solution.

Input
The first line of the input contains two integers n and k (2 ≤ k ≤ n ≤ 50) — the number of soldiers and the size of a group respectively.

The second line contains n - k + 1 strings s1, s2, …, sn - k + 1. The string si is “YES” if the group of soldiers i through i + k - 1 is effective, and “NO” otherwise.

Output
Find any solution satisfying all given conditions. In one line print n space-separated strings, denoting possible names of soldiers in the order. The first letter of each name should be uppercase, while the other letters should be lowercase. Each name should contain English letters only and has length from 1 to 10.

If there are multiple valid solutions, print any of them.

Examples
Input
8 3
NO NO YES YES YES NO
Output
Adam Bob Bob Cpqepqwer Limak Adam Bob Adam
Input
9 8
YES NO
Output
R Q Ccccccccc Ccocc Ccc So Strong Samples Ccc
Input
3 2
NO NO
Output
Na Na Na
Note
In the first sample, there are 8 soldiers. For every 3 consecutive ones we know whether they would be an effective group. Let’s analyze the provided sample output:

First three soldiers (i.e. Adam, Bob, Bob) wouldn’t be an effective group because there are two Bobs. Indeed, the string s1 is “NO”.
Soldiers 2 through 4 (Bob, Bob, Cpqepqwer) wouldn’t be effective either, and the string s2 is “NO”.
Soldiers 3 through 5 (Bob, Cpqepqwer, Limak) would be effective, and the string s3 is “YES”.
…,
Soldiers 6 through 8 (Adam, Bob, Adam) wouldn’t be effective, and the string s6 is “NO”.

题意就是有n个名字,需要满足n-k+1个要求
对于每个要求有"YES"或"NO" 两种情况
YES表示的是从第i个名字到第i+k-1个名字都不相同.
NO表示第i个名字到第i+k-1个名字至少有两个相同的名字

数据量很小，初始化一个50的字符串数组就够了
如果输入检测到是No就让第i+k-1和第i个相同即可满足题意
代码如下

#include<iostream>
using namespace std;
const int N=1e3+10;
string a[N];

int main()
{
	int n,k;
	cin>>n>>k;
	string s;
	a[0]="Aa";
	for(int i=1;i<26;i++)
	{
		a[i]=a[i-1];
		a[i][1]++;
	}
	a[26]="Ba";
	for(int i=27;i<51;i++)
	{
		a[i]=a[i-1];
		a[i][1]++;
	}
	for(int i=0;i<n-k+1;i++)
	{
		cin>>s;
		if(s[0]=='N')
			a[i+k-1]=a[i];
	}
	for(int i=0;i<n;i++)
	cout<<a[i]<<" ";
	cout<<endl;
	return 0;
}