uva 540 team queue

最新推荐文章于 2025-08-12 14:30:08 发布

tianming_fan

最新推荐文章于 2025-08-12 14:30:08 发布

阅读量498

点赞数

CC 4.0 BY-SA版权

文章标签： list struct input output date null

本文链接：https://blog.youkuaiyun.com/tianming_fan/article/details/6387471

本文介绍了一个使用C++实现的队列管理系统，该系统能够根据不同团队的需求分配元素到不同的队列中，并提供基本的操作如添加元素和输出队列头部元素。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

// 别人的代码

#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <string>
#define MAXN 1000010
#define MAXT 10000

using namespace std;

typedef struct List{
int date;
struct List *next;
}List;

struct Queue{
List *head,*tail;
}Q[1001] = {0};

int T,n,team[MAXN] = {0},whichteam[MAXT] = {0};

void Input(){
    memset(team,0,sizeof(team));
    int element;
    for(int t = 0;t < T;t++){
        scanf("%d",&n);

        for(int i = 0;i < n;i++){
            scanf("%d",&element);
            team[element] = t;
        }
    }
}

void Solve(){
    List *p;
    char opr[20];
    int num = 0,pos = 0,temp,flage,E;
    memset(whichteam,-1,sizeof(whichteam));
    while(scanf("%s",opr) && opr[0] != 'S'){
        if(opr[0] == 'E'){
            scanf("%d",&E);

            p = (List *)malloc(sizeof(List));
            p->date = E;
            p->next = NULL;

            if(whichteam[team[E]] == -1){
                whichteam[team[E]] = num;
                Q[num].head = Q[num].tail = p;
                num++;
            }
            else{
                temp = whichteam[team[E]];
                Q[temp].tail->next = p;
                Q[temp].tail = p;
            }
        }
        else{ /*output the elementary*/

            if(!Q[pos].head){
                pos++;
                whichteam[flage] = -1;
            }

            if(Q[pos].head){
                printf("%d/n",Q[pos].head->date);
                flage = team[Q[pos].head->date];
                Q[pos].head = Q[pos].head->next;
            }

        }
    }
    printf("/n");
}

int main()
{
    int t = 0;
    while(scanf("%d",&T) && T != 0 ){
        printf("Scenario #%d/n",++t);
        Input();
        Solve();
    }
    return 0;
}