Submission #543645

#	Time	Username	Problem	Language	Result	Execution time	Memory
543645		tudor	Treasure (info1cup19_treasure)	C++17	100 / 100	8 ms	884 KiB

treasure

#include <iostream>

using namespace std;
const int nmax = 2e5;

pair < char, int > st[nmax + 1];
string s;
int sz = 0;

int main() {
    int n, k;

    cin >> n >> k >> s;
    st[sz] = { '#', 1 };
    for ( int i = 0; i < n; i++ ) {
        if ( s[i] != st[sz].first )
            st[++sz] = { s[i], 1 };
        else {
            st[sz].second++;
            if ( st[sz].second == k )
                st[sz--] = { 0, 0 };
        }
    }
    for ( int i = 1; i <= sz; i++ )
        for ( int j = 1; j <= st[i].second; j++ )
            cout << st[i].first;

    return 0;
}

• Subtask 1: 35 / 35
• Subtask 2: 65 / 65