Informatics Olympiad all in one 1332: [example 2-1] weekend dance

【 Topic link 】

ybt 1332：【 example 2-1】 Weekend dance

【 Topic test site 】

1. queue

【 Their thinking 】

Use two queues to simulate two teams of men and women , Let the two teams join the team first .
The number of dances is n.
Let the two teams go out each time 1 people , The two danced in pairs , Output the numbers of these two people .
Then the two men who left the team joined the team to the end of the team , Go back to your line .
So circular n Time .

【 Solution code 】

solution 1： Using arrays and expressions to implement queues

#include <bits/stdc++.h>
using namespace std;
#define N 1005
int que_m[N], que_f[N];// Two queues  
int h_m, t_m, h_f, t_f;// The head and tail pointers of the two queues 
int main()
{
    
    int m, f, temp_m, temp_f, n;//m,f: Number of men and women  temp_m, temp_f: The male and female numbers of the temporary team  n: Number of dances 
    cin >> m >> f >> n;
    for(int i = 1; i <= m; ++i)// Men join the team 
        que_m[++t_m] = i;
    for(int i = 1; i <= f; ++i)// Ladies join the team 
        que_f[++t_f] = i;
    for(int i = 1; i <= n; ++i)
    {
    
        temp_m = que_m[++h_m];// men 's team , Women's teams go out 1 people 
        temp_f = que_f[++h_f];
        cout << temp_m << ' ' << temp_f << endl;
        que_m[++t_m] = temp_m;// Put two people out of the team back into the team 
        que_f[++t_f] = temp_f;
    }
	return 0;
}

solution 2： Use C++ STL

#include <bits/stdc++.h>
using namespace std;
int main()
{
    
	queue<int> q1, q2;//q1： Men's queue  q2： Ladies line up  
	int a, b, n;
	cin >> a >> b >> n;
	for(int i = 1; i <= a; ++i)
		q1.push(i);
	for(int i = 1; i <= b; ++i)
		q2.push(i);
	for(int i = 1; i <= n; ++i)
	{
    
		cout << q1.front() << ' ' << q2.front() << endl;// The heads of the two teams came out to dance in pairs  
		q1.push(q1.front());// Put the value of the team leader in the team to the end of the team  
		q1.pop();// Team leader out of team  
		q2.push(q2.front());
		q2.pop();
	}
	return 0;
}