Codeforces Round #632 (Div. 2) D-Challenges in school №41（模拟好题）

 Challenges in school №41

 

 

 学习博客：here

AC_Code;

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 3e6+10;
const int inf = 0x3f3f3f3f;
const double pi = acos(-1.0);
#define rep(i,first,second) for(ll i=first;i<=second;i++)
#define dep(i,first,second) for(ll i=first;i>=second;i--)

int n,k;
char str[3005];
vector<int>v[maxn];
ll maxk,mink,d;

void solve(){
    int p=0,p2=0,kk=mink;
    while( kk<k ){
        cout<<"1 "<<v[p][p2]<<'
';//用cout<<"1 "<<v[p][p2]<<endl;就超时了
        p2++;
        if( p2==v[p].size() ){
            p2=0;
            p++;
        }
        else kk++;
    }
    cout<<v[p].size()-p2;
    for(int i=p2;i<v[p].size();i++){
        cout<<' '<<v[p][i];
    }
    cout<<'
';//用cout<<endl就超时了
    p++;

    while( p<mink ){
        cout<<v[p].size();
        for(int i=0;i<v[p].size();i++){
            cout<<' '<<v[p][i];
        }
        cout<<'
';//用cout<<endl就超时了
        p++;
    }
}

void check(int p){
    for(int i=1;i<n; ){
        if( str[i]=='R' && str[i+1]=='L' ){
            str[i]='L';
            str[i+1]='R';
            v[p].push_back(i);
            i+=2;
        }
        else{
            i++;
        }
    }
}

int main(){
    scanf("%d%d",&n,&k);
    scanf("%s",str+1);

    check(0);
    while( v[mink].size() && mink<=k ){
        maxk += v[mink].size();
        mink++;
        check(mink);
    }
    if( mink<=k && k<=maxk ){
        solve();
    }
    else{
        printf("-1
");
    }
    return 0;
}