D. Challenges in school №41(模拟)

vector<vector<int>> ans;
int b[N];
int main()//[下界:每次尽其所能，上界：每次操作一对]
{
	int n, k;
	string a;
	while (cin >> n>>k>>a)
	{
		f(i, 1, n)
		{
			if (a[i - 1] == 'R')b[i] = 1;
			else b[i] = 0;
		}
		ll sum = 0;
		while (1)
		{
			vector<int> now;
			for (int i = 1;i <= n - 1;i++)//每分钟尽其所能
			{
				if (b[i] == 1 && b[i + 1] == 0) { 
					now.emplace_back(i);swap(b[i], b[i + 1]);i++; }//每个人只能参与一次在每分钟
			}
			if (now.size() == 0)break;
			sum += now.size();
			ans.emplace_back(now);
		}
		if (k > sum || k < ans.size()) { puts("-1");continue; }
		else
		{
			int re = k - ans.size();//需要拆出来多少
			for (auto I : ans)
			{
				int j = 0;
				while (re > 0 && j < I.size()-1)
				{
					re--;
					printf("1 %d\n", I[j]);
					j++;
				}
				cout << I.size()-j << " ";
				f(i, j, I.size() - 1)
				{
					cout << I[i] << " ";
				}
				cout << endl;
			}
		}
	}
	return 0;
}