Submission #228890

# Submission time Handle Problem Language Result Execution time Memory
228890 2020-05-03T02:52:56 Z blacktulip Treasure (info1cup19_treasure) C++17
0 / 100
5 ms 384 KB
#include <bits/stdc++.h>

using namespace std;

typedef long long lo;
typedef pair< lo,lo > PII;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 1000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;

int n,m,b[li],a[li],k,flag,t;
int cev;
string s;
vector<int> v;

int main(void){
	fio();
	cin>>n>>k>>s;
	for(int jjj=1;jjj<=min(1,(int)sqrt(n)+5);jjj++){
		int say=1;
		for(int i=1;i<(int)s.size();i++){
			if(s[i]==s[i-1])say++;
			else say=1;
			if(say==k){
				while(say>0){
					s.erase(s.begin()+i-k+1);
					say--;
				}
			}
		}
		
	}
	cout<<s<<endl;
	return 0;
}

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -