112 stucked keyboard (20 points)

The main idea of the topic ： If a keyboard gets stuck , It will output continuously k Time , Determine which keyboards are stuck , And output the original sequence

Be careful ： If a character appears consecutively k Secondary sum is not continuous k Time of , Then this key is good .(k Multiple )

 

#include <iostream>
#include <unordered_map>
#include <vector>
using namespace std;
unordered_map<char,int>mp1,mp2,st;
int k,cnt;
int main()
{
	string s;
	cin >> k >> s;
	char c = ' ';
    s += '*';// Facilitate the judgment of the last continuous character 
	for(int i = 0; i < s.size(); i ++)
	{    
		if(s[i] == c) cnt ++;
		else 
		{  
			if(cnt % k == 0) mp1[c] = 1;// stuck 
			if(cnt % k != 0) mp2[c] = 1;// No card 
			cnt = 1;c = s[i];
		}
	}
    for(int i = 0; i < s.size() - 1; i ++)
    {
        if(mp1[s[i]] == 1 && mp2[s[i]] == 0)// At the same time satisfy 
        {   
            if(st[s[i]] != 1) cout << s[i];// Output only once 
            st[s[i]] = 1;
        }
    }
    cout << '\n';
	for(int i = 0; i < s.size() - 1; i ++)
	{
		cout << s[i];
		if(mp1[s[i]] == 1 && mp2[s[i]] == 0) i = i + k - 1;
	}
	return 0;
}