Submission #689530

#TimeUsernameProblemLanguageResultExecution timeMemory
689530tvladm2009Treasure (info1cup19_treasure)C++17
100 / 100
4 ms1256 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, k; string s; cin >> n >> k >> s; stack<pair<int, int>> st; for (int i = 1; i <= n; i++) { if (!st.empty()) { if (st.top().first == s[i - 1]) { st.push({s[i - 1], st.top().second + 1}); } else { st.push({s[i - 1], 1}); } } else { st.push({s[i - 1], 1}); } if (st.top().second == k) { int cnt = 0; while (cnt < k) { st.pop(); cnt++; } } } string ret = ""; while (!st.empty()) { ret += st.top().first; st.pop(); } reverse(ret.begin(), ret.end()); cout << ret; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...