数据结构舞伴问题(纯c语言)

#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#define OK 1
#define ERROR 0
#define OVERLOW -1
#define MAXSIZE 100
typedef int Status;
/*跳舞这个人信息*/
typedef struct
{
    char name[20];//名字
    char sex;//F为女性，M为男性
}Person;
/*队列的顺序存储结构*/
typedef struct
{
    Person* base;//队列中数据元素类型为Person
    int front;//头指针
    int rear;//尾指针
}SqQueue;
typedef Person ElemType;
/*队列初始化*/
Status InitQueue(SqQueue& Q)
{//构造一个空队列Q
     Q.base=(Person*)malloc(MAXSIZE*sizeof(Person));
     if(!Q.base) exit(OVERLOW);
    Q.front = Q.rear = 0;
    return OK;
}
 
/*求队列的长度*/
int QueueLength(SqQueue* Q)
{
    return(Q->rear - Q->front + MAXSIZE) % MAXSIZE;
}
 
/*判断队列是否为空*/
bool QueueEmpty(SqQueue& Q)
{
    if (Q.front == Q.rear)
        return true;//队满
    else
        return false;
}
 
Status EnQueue(SqQueue& Q, Person e)
{//插入元素e为Q的新的队尾元素
    if ((Q.rear + 1) % MAXSIZE == Q.front)//尾指针在循环意义上加1后等于头指针，表明队满
    {
        return ERROR;
    }
    Q.base[Q.rear] = e;
    Q.rear = (Q.rear + 1) % MAXSIZE;//队尾指针加1
    return OK;
}
 
/*出队（保留队头元素）删除Q的队头元素，用e返回其值*/
Status DeQueue(SqQueue& Q, Person& e)
{
    if (Q.front == Q.rear)
        return ERROR;//队空
    e = Q.base[Q.front];  //保留队头元素
    Q.front = (Q.front + 1) % MAXSIZE;//队头指针加1
    return OK;
}
 
/*出队（不保留对头元素）*/
Status DeQueuee(SqQueue& Q)
{
    if (Q.front == Q.rear)
        return ERROR;
    Q.front = (Q.front + 1) % MAXSIZE;
    return OK;
}
//取队头元素
Person GetHead(SqQueue& Q)
{//返回Q的队头元素，不修改队头指针
    if (Q.rear != Q.front)
    {
        return Q.base[Q.front];//返回队头元素的值，队头指针不变
    }//队列非空
}
 
//舞伴问题解决
void dancersolve(Person dancer[], int num, int m, SqQueue male, SqQueue female)
{//结构体数组中dancer中存放跳舞的男女姓名，num是跳舞的人数
    for (int j = 0; j < m; j++)
    {
        printf("第%d轮:\n",j+1);
        for (int i = 0; i < num; i++)
        {
            if (dancer[i].sex == 'F')
                EnQueue(female, dancer[i]);//插入女队
            else
                EnQueue(male, dancer[i]);//插入男队
        }
        printf("The dancing partners are:\n");
        while (!QueueEmpty(male) && !QueueEmpty(female))
        {//依次输入男女舞伴问题
            Person p;
            DeQueue(male, p);
            printf("%s",p.name);//女士出列
            DeQueue(female, p);
            printf("%s",p.name);//男士出列
        }
        Person e;
        if (!QueueEmpty(female))//女士队列非空，输出队头女士的姓名
        {
            e = GetHead(female);//取女士队头
            printf("The first woman to get a partner is: %s\n", e.name); 
        }
        else if (!QueueEmpty(male))//男士队列非空，输出队头男士的姓名
        {
            e = GetHead(male);//取男士队头
            printf("The first man to get a partner is: %s\n", e.name);
        }
        DeQueuee(female);
        DeQueuee(male);
    }
}
 
//主函数
int main()
{
    int n;
    printf("请输入跳舞人的人数:");
    scanf("%d",&n);
    Person* dancer = (Person*)malloc(n * sizeof(Person));
    printf("请依次输入跳舞人的信息：\n");
    for (int i = 0; i < n; i++)
    {
        printf("name: ");
        scanf("%s", dancer[i].name);
        printf("sex: ");
        scanf(" %c", &dancer[i].sex);
    }
    int m;
    printf("请输入舞会的轮数：");
    scanf("%d",&m);
 
    SqQueue male, female;
    InitQueue(male);
    InitQueue(female);
 
    dancersolve(dancer, n, m, male, female);
    free(dancer);
    return 0;
}