UVa 540: Team Queue

最新推荐文章于 2023-10-05 12:47:33 发布

原创最新推荐文章于 2023-10-05 12:47:33 发布 · 883 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#uva #queue #540

UVa Coding Practice 专栏收录该内容

22 篇文章

订阅专栏

本文介绍了一个使用 C++ 实现的队列管理系统，该系统通过 deque 和 map 数据结构处理元素的入队和出队操作，并利用特定指令进行控制。程序能够处理多个场景的数据输入，适用于模拟排队系统的逻辑。

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

#define _CRT_SECURE_NO_WARNINGS

#include <iostream>
#include <deque>
#include <cstring>
#include <map>
#include <string>

#define OPEN_DEBUG 1

using namespace std;

/*
map for elements and teams nums.
deque for the queue
*/
int main()
{
    const string ope_stop = "STOP";
    const string ope_enqueue = "ENQUEUE";
    const string ope_dequeue = "DEQUEUE";

    int scene_num = 1;
    int n;
    while(cin >> n && n != 0)
    {
        if(n < 1 || n > 1000)
        {
            continue;
        }   

        int *team_end = new int[n];

        memset(team_end, 0, n*sizeof(int));

        deque<int> t_q;
        map<int, int> map_q;
        for(int i = 0; i < n; i++)
        {
            int num_elsements;
            cin >> num_elsements;
            for(int j = 0; j < num_elsements; j++)
            {
                int element;
                cin >> element; 
                map_q[element] = i;
            }
        }   

        #if(OPEN_DEBUG == 1)
            for (map<int, int>::iterator it = map_q.begin(); it != map_q.end(); it++)
            {
                cout << "1st " << it->first << "  2nd " << it->second << " " << endl;
            }   
            cout << endl;
        #endif  

        string ope;
        cout << "Scenario #" << scene_num << endl;
        while(cin >> ope && ope != ope_stop)
        {
            if(ope_enqueue == ope)
            {
                int num_ele;
                cin >> num_ele;
                int no_team = map_q[num_ele]; 
                int end_pos_team = team_end[no_team];

                #if(OPEN_DEBUG == 1)
                    cout << "Team No." << no_team << " " << end_pos_team << endl;
                    for(int m = 0; m < n; m++)
                    {
                        cout << &team_end[m] << " ";
                    }   
                    cout << endl;
                #endif

                if(!end_pos_team)
                {
                    #if(OPEN_DEBUG == 1)
                        cout << num_ele << " "  << no_team << endl;
                    #endif
                    t_q.push_back(num_ele);
                    int pos = t_q.size();
                    team_end[no_team] = pos;
                }
                else
                {   
                    deque<int>::iterator it = t_q.begin() + end_pos_team;
                    t_q.insert(it, num_ele);
                    for(int j = 0; j < n; j++)
                    {
                        if( team_end[j] >= end_pos_team)
                        {
                            team_end[j]++;
                        }   
                    }                   
                }   

                #if(OPEN_DEBUG == 1)
                    for(deque<int>::iterator it = t_q.begin(); it != t_q.end(); it++)   
                    {
                        cout << *it << " "; 
                    }   
                    cout << endl;
                #endif  
            }   

            if(ope_dequeue == ope)
            {
                if(!t_q.empty())
                {   
                    int tmp_front = t_q.front();
                    cout << tmp_front << endl;
                    t_q.pop_front();
                    // map_q.erase(tmp_front);

                    for(int j = 0; j < n; j++)
                    {
                        if(team_end[j])
                        {
                            team_end[j]--;
                        }   
                    }   
                }   
                #if(OPEN_DEBUG == 1)
                    for(deque<int>::iterator it = t_q.begin(); it != t_q.end(); it++)   
                    {
                        cout << *it << " "; 
                    }   
                    cout << endl;
                #endif  
            }   
        }   

        cout << endl;
        scene_num++;

        delete []team_end;
    }   

    return 0;
}