# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
839048 | fanwen | Treasure (info1cup19_treasure) | C++17 | 4 ms | 724 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.
/**
* author : pham van sam
* created : 28 August 2023 (Monday)
**/
#include <bits/stdc++.h>
using namespace std;
void you_make_it(void) {
int n, k; cin >> n >> k;
vector <pair <char, int>> vt;
for (int i = 1; i <= n; ++i) {
char x; cin >> x;
if(!vt.empty() and vt.back().first == x) {
vt.back().second++;
if(vt.back().second == k) vt.pop_back();
} else vt.emplace_back(x, 1);
}
for (auto [x, d] : vt) {
for (int i = 0; i < d; ++i) cout << x;
}
}
signed main() {
#ifdef LOCAL
freopen("TASK.inp", "r", stdin);
freopen("TASK.out", "w", stdout);
#endif
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |