F. Chips

http://codeforces.com/contest/1244/problem/F 

#include <bits/stdc++.h>
//#include <queue>
//#include <cmath>
//#include <iostream>
//#include <unordered_map>

#define lson rt<<1
#define rson rt<<1|1
#define lowbit(x) ((x)&(-x))
#define mem(x,y) memset(x,y,sizeof(x))
#define pb push_back
#define INF 0x3f3f3f3f
#define ll long long
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;

const int mod=1e9+7;
const int N=2e5+9;

int vis[N];
int main()
{
    FAST_IO;

    int n,k;
    while(cin>>n>>k)
    {
        string s;
        cin>>s;

        mem(vis,-1);
        queue<int>q;
        for(int i=0;i<n;i++)
        {
            if(s[i]==s[(i+1)%n]||s[i]==s[(i-1+n)%n])
            {
                vis[i]=0;
                q.push(i);
            }

        }

        while(!q.empty())
        {
            int u=q.front();
            q.pop();

            if(vis[(u-1+n)%n]==-1)
            {
                vis[(u-1+n)%n]=vis[u]+1;
                q.push((u-1+n)%n);
            }
            if(vis[(u+1)%n]==-1)
            {
                vis[(u+1)%n]=vis[u]+1;
                q.push((u+1)%n);
            }
        }

        for(int i=0;i<n;i++)
        {
            if(vis[i]==-1)
            {
                if(k&1)
                {
                    if(s[i]=='B') cout<<'W';
                    else cout<<'B';
                }
                else cout<<s[i];
            }
            else if(vis[i]>k)
            {
                if(k&1)
                {
                    if(s[i]=='B') cout<<'W';
                    else cout<<'B';
                }
                else cout<<s[i];
            }
            else
            {
                if(vis[i]&1)
                {
                    if(s[i]=='B') cout<<'W';
                    else cout<<'B';
                }
                else cout<<s[i];
            }
        }
        cout<<endl;


    }


    return 0;
}