CodeForces - 791C Bear and Different Names

题意：

        N 个人站一排，从左至右依次每 K 个人中有重名的标记为 NO ，没有重名则标记为 YES，请给出一种可能的队列。N,K<=50。

思路：

        先生成50个不重复的名字，怎么生成都行。

        先固定前 K - 1的人名字不重复，若遇到 NO 则向队列后加入即将出队的那个名字。若遇到 YES 就找一遍队列中没有的名字。

代码：

#include <bits/stdc++.h>

using namespace std;
int vis[2000],n,k;
string name[55];
void make_name(){
int ppp=-1;
int temp;
memset(vis,0,sizeof(vis));
while(ppp<=50){
temp=rand()%2001;
if(!vis[temp]){
vis[temp]=1;
ppp++;
while(temp){
name[ppp] += (char)(temp%10+'a');
temp/=10;
}
}
}
for(int i=0;i<=50;i++) name[i][0]=name[i][0]-'a'+'A';
}
int get_yes(){
for(int i=1;i<=50;i++)
if(!vis[i]) return i;
return -1;
}

int main()
{
make_name();
//for(int i=1;i<=50;i++) cout<<name[i]<<endl;
queue <int> que;
string str;
int cho,pos;
while(cin>>n>>k){
while(!que.empty()) que.pop();
pos=0;
memset(vis,0,sizeof(vis));
for(;pos<k-1;pos++){
if(pos==0) cout<<name[pos];
else cout<<" "<<name[pos];
vis[pos]++;
que.push(pos);
}
for(int i=0;i<=n-k;i++){
cin>>str;
if(str=="YES") cho=get_yes();
else cho=que.front();
vis[que.front()]--;
vis[cho]++;
que.pop();
que.push(cho);
cout<<" "<<name[cho];
}
cout<<endl;
}
}

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 + 1through 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 to10.

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

Example

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 strings3 is "YES".
...,
Soldiers 6 through 8 (Adam, Bob, Adam) wouldn't be effective, and the string s6is "NO".