# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
523563 | Farhan_HY | Treasure (info1cup19_treasure) | C++14 | 9 ms | 1084 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>
#define int long long
#define float double
#define pb push_back
#define F first
#define S second
#define T int t; cin >> t; while(t--)
#define IOS ios::sync_with_stdio(); cin.tie(0); cout.tie(0);
using namespace std;
const int inf = 8e18;
const int N = 1e6 + 6;
const int M = 1e3 + 3;
const int mod = 1e9 + 7;
const float pi = atan(1) * 4;
int a[N];
int n, m;
string s;
vector<pair<char, int>> v;
main()
{
cin >> n >> m >> s;
v.pb({s[0], 1});
for(int i = 1; i < n; i++)
{
if (s[i] == v.back().F)
{
v.back().S++;
if (v.back().S == m)
v.pop_back();
}
else
v.pb({s[i], 1});
}
for(auto x: v)
{
for(int i = 0; i < x.S; i++)
cout << x.F;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |