Submission #1627681

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
int n,k;
string s;
string A(int x){ string s="";rep(i,x)s.pb('A');return s;}
string B(int x){ string s="";rep(i,x)s.pb('B');return s;}

string rec(int a,int b,int zan){
	if(a>1&&b>1){
		if(zan==0) return B(a)+A(b);
		if(zan==1) return A(a-1)+B(b)+A(1);
		if(zan==2) return B(1)+A(a-2)+B(b)+A(1);
		return rec(a-1,b-1,zan-3)+"BA";
	}
	if(a==1&&b==1) return B(1)+A(1);
	if(zan==0) return B(a)+A(b);
	if(a==1){
		if(zan==1) return B(a+b-1)+A(1);
		if(zan==2) return A(a+b-2)+B(1)+A(1);
		return rec(1,a+b-3,zan-3)+B(1)+A(1);
	}
	else{
		if(zan==1) A(a+b-2)+B(1)+A(1);
		return rec(1,a+b-3,zan-2)+B(1)+A(1);
	}
}
int main(){
	cin>>n>>k>>s;
	while(1){
		if(k==0){
			cout<<s<<endl; return 0;
		}
		if(s[0]=='A'){
			s[0]='B'; k--; continue;
		}//cout<<"N"<<endl;
		for(int i=0;i<n;){
			while(s[i]=='B'){
				if(i!=n-1&&s[i+1]=='A');
				else s[i]='A';
				i++;
			}
			if(i==n){
				k--; continue;
			}
			while(s[i]=='A'){
				if(i!=n-1&&s[i+1]=='A') s[i]='B';
				i++;
			}
			if(i==n){//cout<<s<<endl;
				k--; goto out;
			}
		}
	}out:;
	if(k==0){
		cout<<s<<endl; return 0;
	}
	string ans = ""; 
	for(int i=0;i<n;){
		int x = 0,y = 0;
		while(s[i]=='B'){
			i++; x++;
		}
		while(s[i]=='A'){
			i++; y++;
		}//cout<<x<<y<<endl;
		ans+=rec(x,y,k);
	}
	cout<<ans<<endl;
}

Submission Info

Judge Result