POJ 2259 Team Queue 数据结构 队列

Team Queue

Time Limit: 2000MS   Memory Limit: 65536K
Total Submissions: 3282   Accepted: 1188

Description

Queues and Priority Queues are data structures which are known to most computer scientists. The Team Queue, however, is not so well known, though it occurs often in everyday life. At lunch time the queue in front of the Mensa is
a team queue, for example.

In a team queue each element belongs to a team. If an element enters the queue, it first searches the queue from head to tail to check if some of its teammates (elements of the same team) are already in the queue. If yes, it enters the queue right behind them.
If not, it enters the queue at the tail and becomes the new last element (bad luck). Dequeuing is done like in normal queues: elements are processed from head to tail in the order they appear in the team queue.

Your task is to write a program that simulates such a team queue.

Input

The input will contain one or more test cases. Each test case begins with the number of teams t (1<=t<=1000). Then t team descriptions follow, each one consisting of the number of elements belonging to the team and the elements
themselves. Elements are integers in the range 0 - 999999. A team may consist of up to 1000 elements.

Finally, a list of commands follows. There are three different kinds of commands:

  • ENQUEUE x - enter element x into the team queue
  • DEQUEUE - process the first element and remove it from the queue
  • STOP - end of test case

The input will be terminated by a value of 0 for t.

Warning: A test case may contain up to 200000 (two hundred thousand) commands, so the implementation of the team queue should be efficient: both enqueing and dequeuing of an element should only take constant time.

Output

For each test case, first print a line saying "Scenario #k", where k is the number of the test case. Then, for each DEQUEUE command, print the element which is dequeued on a single line. Print a blank line after each test case,
even after the last one.

Sample Input

2
3 101 102 103
3 201 202 203
ENQUEUE 101
ENQUEUE 201
ENQUEUE 102
ENQUEUE 202
ENQUEUE 103
ENQUEUE 203
DEQUEUE
DEQUEUE
DEQUEUE
DEQUEUE
DEQUEUE
DEQUEUE
STOP
2
5 259001 259002 259003 259004 259005
6 260001 260002 260003 260004 260005 260006
ENQUEUE 259001
ENQUEUE 260001
ENQUEUE 259002
ENQUEUE 259003
ENQUEUE 259004
ENQUEUE 259005
DEQUEUE
DEQUEUE
ENQUEUE 260002
ENQUEUE 260003
DEQUEUE
DEQUEUE
DEQUEUE
DEQUEUE
STOP
0

Sample Output

Scenario #1
101
102
103
201
202
203

Scenario #2
259001
259002
259003
259004
259005
260001

Source

Ulm Local 1998

ACcode：

<pre class="sh_cpp sh_sourceCode" style="font-family:Courier New,Courier,monospace"><span class="sh_preproc">#include</span> <span class="sh_string"><iostream></span>
<span class="sh_preproc">#include</span> <span class="sh_string"><cstdio></span>
<span class="sh_preproc">#include</span> <span class="sh_string"><cstring></span>
<span class="sh_keyword">using</span> <span class="sh_keyword">namespace</span> std<span class="sh_symbol">;</span>
<span class="sh_keyword">struct</span><span class="sh_normal"> </span><span class="sh_classname">node</span><span class="sh_cbracket">{</span>
    <span class="sh_type">int</span> p<span class="sh_symbol">;</span>
    <span class="sh_type">int</span> next<span class="sh_symbol">;</span>
<span class="sh_cbracket">}</span>my<span class="sh_symbol">[</span><span class="sh_number">200020</span><span class="sh_symbol">];</span>
<span class="sh_type">int</span> belong<span class="sh_symbol">[</span><span class="sh_number">1000000</span><span class="sh_symbol">];</span><span class="sh_comment">///哈希法表示元素属于哪个队列</span>
<span class="sh_type">int</span> pos<span class="sh_symbol">[</span><span class="sh_number">1010</span><span class="sh_symbol">];</span><span class="sh_comment">///团队最后一个元素在队列中的位置</span>
<span class="sh_type">int</span> st<span class="sh_symbol">,</span>ed<span class="sh_symbol">,</span>used<span class="sh_symbol">;</span>
<span class="sh_type">int</span> <span class="sh_function">main</span><span class="sh_symbol">()</span><span class="sh_cbracket">{</span>
    <span class="sh_type">int</span> loop<span class="sh_symbol">=</span><span class="sh_number">0</span><span class="sh_symbol">,</span>n<span class="sh_symbol">;</span>
    <span class="sh_keyword">while</span><span class="sh_symbol">(</span><span class="sh_function">scanf</span><span class="sh_symbol">(</span><span class="sh_string">"%d"</span><span class="sh_symbol">,&</span>n<span class="sh_symbol">)!=</span>EOF<span class="sh_symbol">&&</span>n<span class="sh_symbol">)</span><span class="sh_cbracket">{</span>
        st<span class="sh_symbol">=</span>ed<span class="sh_symbol">=-</span><span class="sh_number">1</span><span class="sh_symbol">;</span>
        used<span class="sh_symbol">=</span><span class="sh_number">0</span><span class="sh_symbol">;</span>
        <span class="sh_type">int</span> num<span class="sh_symbol">,</span>temp<span class="sh_symbol">;</span>
        <span class="sh_keyword">for</span><span class="sh_symbol">(</span><span class="sh_type">int</span> i<span class="sh_symbol">=</span><span class="sh_number">0</span><span class="sh_symbol">;</span>i<span class="sh_symbol"><</span>n<span class="sh_symbol">;++</span>i<span class="sh_symbol">)</span><span class="sh_cbracket">{</span>
            <span class="sh_function">scanf</span><span class="sh_symbol">(</span><span class="sh_string">"%d"</span><span class="sh_symbol">,&</span>num<span class="sh_symbol">);</span>
            <span class="sh_keyword">for</span><span class="sh_symbol">(</span><span class="sh_type">int</span> j<span class="sh_symbol">=</span><span class="sh_number">0</span><span class="sh_symbol">;</span>j<span class="sh_symbol"><</span>num<span class="sh_symbol">;++</span>j<span class="sh_symbol">)</span><span class="sh_cbracket">{</span>
                cin<span class="sh_symbol">>></span>temp<span class="sh_symbol">;</span>
                belong<span class="sh_symbol">[</span>temp<span class="sh_symbol">]=</span>i<span class="sh_symbol">;</span>
            <span class="sh_cbracket">}</span>
            pos<span class="sh_symbol">[</span>i<span class="sh_symbol">]=-</span><span class="sh_number">1</span><span class="sh_symbol">;</span>
        <span class="sh_cbracket">}</span>
        <span class="sh_keyword">if</span><span class="sh_symbol">(</span>loop<span class="sh_symbol">)</span><span class="sh_function">putchar</span><span class="sh_symbol">(</span><span class="sh_string">'</span><span class="sh_specialchar">\n</span><span class="sh_string">'</span><span class="sh_symbol">);</span>
        <span class="sh_function">printf</span><span class="sh_symbol">(</span><span class="sh_string">"Scenario #%d</span><span class="sh_specialchar">\n</span><span class="sh_string">"</span><span class="sh_symbol">,++</span>loop<span class="sh_symbol">);</span>
        string s<span class="sh_symbol">;</span>
        <span class="sh_keyword">while</span><span class="sh_symbol">(</span>cin<span class="sh_symbol">>></span>s<span class="sh_symbol">&&</span>s<span class="sh_symbol">!=</span><span class="sh_string">"STOP"</span><span class="sh_symbol">)</span><span class="sh_cbracket">{</span>
            <span class="sh_keyword">if</span><span class="sh_symbol">(</span>s<span class="sh_symbol">==</span><span class="sh_string">"ENQUEUE"</span><span class="sh_symbol">)</span><span class="sh_cbracket">{</span>
                <span class="sh_function">scanf</span><span class="sh_symbol">(</span><span class="sh_string">"%d"</span><span class="sh_symbol">,&</span>temp<span class="sh_symbol">);</span>
                my<span class="sh_symbol">[</span>used<span class="sh_symbol">].</span>p<span class="sh_symbol">=</span>temp<span class="sh_symbol">;</span>
                <span class="sh_keyword">if</span><span class="sh_symbol">(</span>pos<span class="sh_symbol">[</span>belong<span class="sh_symbol">[</span>temp<span class="sh_symbol">]]==-</span><span class="sh_number">1</span><span class="sh_symbol">)</span><span class="sh_cbracket">{</span>
                    my<span class="sh_symbol">[</span>used<span class="sh_symbol">].</span>next<span class="sh_symbol">=-</span><span class="sh_number">1</span><span class="sh_symbol">;</span>
                    <span class="sh_keyword">if</span><span class="sh_symbol">(</span>st<span class="sh_symbol">==-</span><span class="sh_number">1</span><span class="sh_symbol">&&</span>ed<span class="sh_symbol">==-</span><span class="sh_number">1</span><span class="sh_symbol">)</span><span class="sh_cbracket">{</span>
                        st<span class="sh_symbol">=</span>ed<span class="sh_symbol">=</span><span class="sh_number">0</span><span class="sh_symbol">;</span>
                    <span class="sh_cbracket">}</span>
                    <span class="sh_keyword">if</span><span class="sh_symbol">(</span>ed<span class="sh_symbol">>=</span><span class="sh_number">0</span><span class="sh_symbol">)</span><span class="sh_cbracket">{</span>
                        my<span class="sh_symbol">[</span>ed<span class="sh_symbol">].</span>next<span class="sh_symbol">=</span>used<span class="sh_symbol">;</span>
                    <span class="sh_cbracket">}</span>
                    ed<span class="sh_symbol">=</span>used<span class="sh_symbol">;</span>
                <span class="sh_cbracket">}</span><span class="sh_keyword">else</span> <span class="sh_cbracket">{</span>
                    <span class="sh_keyword">if</span><span class="sh_symbol">(</span>pos<span class="sh_symbol">[</span>belong<span class="sh_symbol">[</span>temp<span class="sh_symbol">]]==</span>ed<span class="sh_symbol">)</span>ed<span class="sh_symbol">=</span>used<span class="sh_symbol">;</span>
                    my<span class="sh_symbol">[</span>used<span class="sh_symbol">].</span>next<span class="sh_symbol">=</span>my<span class="sh_symbol">[</span>pos<span class="sh_symbol">[</span>belong<span class="sh_symbol">[</span>temp<span class="sh_symbol">]]].</span>next<span class="sh_symbol">;</span>
                    my<span class="sh_symbol">[</span>pos<span class="sh_symbol">[</span>belong<span class="sh_symbol">[</span>temp<span class="sh_symbol">]]].</span>next<span class="sh_symbol">=</span>used<span class="sh_symbol">;</span>
                <span class="sh_cbracket">}</span>
                pos<span class="sh_symbol">[</span>belong<span class="sh_symbol">[</span>temp<span class="sh_symbol">]]=</span>used<span class="sh_symbol">++;</span>
            <span class="sh_cbracket">}</span><span class="sh_keyword">else</span> <span class="sh_cbracket">{</span>
                <span class="sh_function">printf</span><span class="sh_symbol">(</span><span class="sh_string">"%d</span><span class="sh_specialchar">\n</span><span class="sh_string">"</span><span class="sh_symbol">,</span>my<span class="sh_symbol">[</span>st<span class="sh_symbol">].</span>p<span class="sh_symbol">);</span>
                <span class="sh_keyword">if</span><span class="sh_symbol">(</span>pos<span class="sh_symbol">[</span>belong<span class="sh_symbol">[</span>my<span class="sh_symbol">[</span>st<span class="sh_symbol">].</span>p<span class="sh_symbol">]]==</span>st<span class="sh_symbol">)</span>
                    pos<span class="sh_symbol">[</span>belong<span class="sh_symbol">[</span>my<span class="sh_symbol">[</span>st<span class="sh_symbol">].</span>p<span class="sh_symbol">]]=-</span><span class="sh_number">1</span><span class="sh_symbol">;</span>
                st<span class="sh_symbol">=</span>my<span class="sh_symbol">[</span>st<span class="sh_symbol">].</span>next<span class="sh_symbol">;</span>
            <span class="sh_cbracket">}</span>
        <span class="sh_cbracket">}</span>
    <span class="sh_cbracket">}</span>
   retrun 0;
<span class="sh_cbracket">}</span>


版权声明：本文为博主原创文章，未经博主允许不得转载。
				


				
时间： 2024-10-13 05:26:47 

		


		


	

	
	

		


		
POJ 2259 Team Queue   数据结构 队列的相关文章


								

		

			

                POJ 2259 Team Queue(STL队列)
			

		

		

									

				转自:https://www.cnblogs.com/yjlblog/p/7056746.html 题目背景 队列和优先级队列是大多数计算机科学家都知道的数据结构.但是团队队列却不被人熟知,尽管在生活中经常出现.比如,午餐时间的食堂门口的队列就是一个团队队列.在一个团队队列中,每个元素属于一个团队.如果一个元素进入一个队列,它首先从头到尾地搜寻这个队列--检查是否它的队友(在同一个团队称之为队友)也在这个队列里.如果有,它就排在它队友的后面(:-D就是插队咯~~).如果没有,它就排在整个队列的最			

		

	

				

		

			

                queue POJ 2259 Team Queue
			

		

		

									

				题目传送门 题意:先给出一些小组成员,然后开始排队.若前面的人中有相同小组的人的话,直接插队排在同小组的最后一个,否则只能排在最后面.现在有排队和出队的操作. 分析:这题关键是将队列按照组数分组,用另外一个队列保存组的序号,当该组里没有人了才换下一组.很好的一道题. 收获:队列的灵活运用 代码: /************************************************ * Author :Running_Time * Created Time :2015/9/9 星期三			

		

	

				

		

			

                POJ 3125 Printer Queue 数据结构 队列
			

		

		

									

				Printer Queue Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 4329   Accepted: 2269 Description The only printer in the computer science students' union is experiencing an extremely heavy workload. Sometimes there are a hundred jobs in t			

		

	

				

		

			

                poj 3125 Printer Queue （队列）
			

		

		

									

				 Printer Queue Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 3679   Accepted: 1975 Description The only printer in the computer science students' union is experiencing an extremely heavy workload. Sometimes there are a hundred jobs i			

		

	

				

		

			

                ACM学习历程——UVA540 Team Queue（队列，map：Hash）
			

		

		

									

				Description Team Queue   Team Queue  Queues and Priority Queues are data structures which are known to most computer scientists. The Team Queue, however, is not so well known, though it occurs often in everyday life. At lunch time the queue in front			

		

	

				

		

			

                Team Queue POJ - 2259 （队列）
			

		

		

									

				Queues and Priority Queues are data structures which are known to most computer scientists. The Team Queue, however, is not so well known, though it occurs often in everyday life. At lunch time the queue in front of the Mensa is a team queue, for exa			

		

	

				

		

			

                UVa 540 Team Queue（团队队列）
			

		

		

									

				题意  模拟团队队列的入队和出队 STL应用  用一个队列维护团队编号  再用一个队列数组维护个体 #include <cstdio> #include <cstring> #include <queue> #include <map> using namespace std; const int N = 1000005; int team[N]; int main() { int cas = 0, n, t, a; char cmd[20]; while(			

		

	

				

		

			

                UVA - 540 Team Queue（STL，队列 ）
			

		

		

									

				Team Queue Time Limit: 3000MS   Memory Limit: Unknown   64bit IO Format: %lld & %llu Submit Status Description Queues and Priority Queues are data structures which are known to most computer scientists. The Team Queue, however, is not so well known,			

		

	

				

		

			

                java数据结构与算法之（Queue）队列设计与实现
			

		

		

									

				[版权申明]转载请注明出处(请尊重原创,博主保留追究权) http://blog.csdn.net/javazejian/article/details/53375004 出自[zejian的博客] 关联文章: java数据结构与算法之顺序表与链表设计与实现分析 java数据结构与算法之双链表设计与实现 java数据结构与算法之改良顺序表与双链表类似ArrayList和LinkedList(带Iterator迭代器与fast-fail机制) java数据结构与算法之栈设计与实现 java数据结构