제출 #228895

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
228895		blacktulip	Treasure (info1cup19_treasure)	C++17	35 / 100	6 ms	384 KiB

treasure

#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(6,(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;
}

• Subtask 1: 35 / 35
• Subtask 2: 0 / 65