2021-3-23-meituan-priority queue

Title Description ：
The canteen of Xiaomei and Xiaotuan's company has N A dining table ,
Form a row from left to right , Each table has 2 Dining chairs for up to 2 People eat ,
Company staff lined up to eat in the canteen . Xiaomei found a rule of staff dining and told Xiaotuan ：

When the male staff entered the canteen , He will give priority to those who already sit 1 People's dining table , Only when each table is either empty or full 2 Human hour , He'll think about an empty table ;
When the female staff entered the canteen , She will prefer the uninhabited table , Only if every table has at least 1 Human hour , She'll think about having 1 Human table ;

Both men and women , When there are multiple tables for staff to choose from , He will choose the leftmost table . Now there are several people eating in the canteen , in addition M People are lining up to enter the canteen , Xiaotuan will predict which table everyone in line will sit at according to the law Xiaomei told him .

Input description :
Enter an integer in the first line T（1<=T<=10）, Represents the number of data groups .

Each group of data consists of four rows , Enter an integer in the first line N（1<=N<=500000）;

On the second line, enter a length of N And contains only numbers 0、1、2 String , The first i A number indicates the... From the left i The number of people sitting at this table ;

Enter an integer in the third line M（1<=M<=2N And ensure that everyone in line has an alternative table when entering the canteen ）;

On the fourth line, enter a length of M And contains only the letters M、F String , Ruodi i The letters are M, Is ranked No i People are men , Otherwise it's female .

Output description :
Each group of data output accounts for M That's ok , The first i Line outputs an integer j（1<=j<=N）, Means to be in the i People will choose the first from the left j Eat at a table .

Example 1
Input
1
5
01102
6
MFMMFF

Output
2
1
1
3
4
4

#include <iostream>
#include <vector>
#include <string>

using namespace std;

int main()
{
    
	int T  = 0;
	cin >> T;

	for (int k = 0; k < T; k++)
	{
    
		int N , M ;
		cin >> N;
		string desk, que;
		cin >> M;
		cin >> desk;
		cin >> que;

		int f_zero = -1, f_one = -1;

		for (int i = 0; i < N; i++)
		{
    
			if (f_zero == -1 && f_one == -1)
			{
    
				break;
			}
			else if (f_zero == -1 && desk[i] == '0')
			{
    
				f_zero = i;
			}
			else if (f_one == -1 && desk[i] == '1')
			{
    
				f_one = i;
			}
		}

		for (int i = 0; i < M; i++)
		{
    
			if (que[i] == 'M')
			{
    
				// When the male staff entered the canteen ,  Will give priority to what has been done 1 People's dining table 
				if (f_one < N)
				{
    
					cout << f_one + 1 << endl;
					desk[f_one] = '2';
					while (f_one < N && desk[f_one] != '1')
					{
    
						f_one++;
					}
				}
				else
				{
    
					// Only when each table is either empty or full 2 people ,  He'll think about an empty table 
					cout << f_zero + 1 << endl;
					desk[f_zero] = '1';
					if (f_zero < f_one)
					{
    
						f_one = f_zero;
					}
					while (f_zero < N && desk[f_zero] != '0')
					{
    
						f_zero++;
					}
				}
			}
			else
			{
    
				// When the female staff entered the canteen , Will give priority to the table without being human 
				if (f_zero < N)
				{
    
					cout << f_zero + 1 << endl;
					desk[f_zero] = '1';
					while (f_zero < N && desk[f_zero] != '0')
					{
    
						f_zero++;
					}
				}
				else
				{
    
					// Only when every table is only made 1 Human hour , She thought it was full 1 Human table 
					cout << f_one + 1 << endl;
					desk[f_one] = '2';
					while (f_one < N && desk[f_one] != '1')
					{
    
						f_one++;
					}
				}
			}
		}
	}
}