# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
689530 | tvladm2009 | Treasure (info1cup19_treasure) | C++17 | 4 ms | 1256 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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++;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |