1112 Stucked Keyboard (20 分)

题目：https://pintia.cn/problem-sets/994805342720868352/problems/994805357933608960

#pragma warning(disable:4996)
#define _CRT_SECURE_NO_WARNINGS

#include <iostream>
#include <map>
#include <set>
#include <string>
#include <cctype>
#include <stack>
#include <vector>
using namespace std;

int main()
{
    int N;
    cin >> N;
    string s;
    getchar();
    getline(cin, s);//可能会遇到空格，所以用getline读入，但是貌似直接读也能AC
    int i = 0;
    int cnt = 1;
    map<char, bool> is;//是否是坏键
    map<char, bool> finished;//标志不是坏键，只要出现重复次数cnt，有cnt%N!=0的情况，即可判断不是坏键
    while (i < s.size())
    {
        if (s[i] == s[i + 1] && i != s.size() - 1)
        {
            ++i;
            ++cnt;
        }
        else
        {
            if (cnt % N == 0 && finished[s[i]] == false)
            {
                is[s[i]] = true;
            }
            else
            {
                finished[s[i]] = true;
                is[s[i]] = false;
            }
            cnt = 1;
            ++i;
        }
    }
    i = 0;
    vector<char>show;
    set<char> sset;
    for (int i = 0; i < s.size(); ++i)//顺序输出坏键处理
    {
        if (sset.find(s[i]) == sset.end() && is[s[i]])
        {
            sset.insert(s[i]);
            show.push_back(s[i]);
        }
    }
    for (int i = 0; i < show.size(); ++i)
    {
        cout << show[i];
    }
    cout << endl;
    while (i < s.size())
    {
        cout << s[i];
        if (is[s[i]])
            i += N;
        else
            ++i;
    }
    cout << endl;
    return 0;
}