hdu 1387 team queue 有问题
来源:互联网 发布:淘宝什么叫直通车 编辑:程序博客网 时间:2024/06/05 16:09
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.
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.
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.
23 101 102 1033 201 202 203ENQUEUE 101ENQUEUE 201ENQUEUE 102ENQUEUE 202ENQUEUE 103ENQUEUE 203DEQUEUEDEQUEUEDEQUEUEDEQUEUEDEQUEUEDEQUEUESTOP25 259001 259002 259003 259004 2590056 260001 260002 260003 260004 260005 260006ENQUEUE 259001ENQUEUE 260001ENQUEUE 259002ENQUEUE 259003ENQUEUE 259004ENQUEUE 259005DEQUEUEDEQUEUEENQUEUE 260002ENQUEUE 260003DEQUEUEDEQUEUEDEQUEUEDEQUEUESTOP0
Scenario #1101102103201202203Scenario #2259001259002259003259004259005260001
#include <iostream>#include<cstdio>#include<queue>#include<cstring>using namespace std;const int maxn=1005;int c[1000000];int main(){ int t; int cc=1; while(~scanf("%d",&t)&&t) { printf("Scenario #%d\n",cc++); memset(c,0,sizeof(c)); queue<int>team[maxn],q; for(int i=1;i<=t;i++) { int n; scanf("%d",&n); while(n--) { int tmp; scanf("%d",&tmp); c[tmp]=i; //这样可以记录一个元素有没有出现且记录他在哪个队 } } char s[10]; scanf("%s",s); while(s[0]!='S') { if(s[0]=='E') { int tmp; scanf("%d",&tmp); int id=c[tmp]; //c[tmp]就是队的编号 if(team[id].empty())q.push(id); //如果队为空就在q--主队列后加入该元素 team[id].push(tmp); //把元素放在它的队的队尾 } else { int id=q.front(); // printf("%d\n",team[id].front()); team[id].pop(); if(team[id].empty()) q.pop(); } scanf("%s",s); } cout<<endl; } return 0;}
阅读全文
0 0
- hdu 1387 team queue 有问题
- HDU-1387-Team Queue
- hdu 1387 Team Queue
- HDU 1387 Team Queue
- HDU 1387 Team Queue
- hdu 1387 Team Queue
- hdu 1387 Team Queue 优先队列
- hdu 1387 Team Queue (链表)
- HDU 1387 Team Queue 队列的模拟
- Hdu 1387 Team Queue[队列 || 链表]
- hdu 1387 Team Queue(队列的嵌套)
- HDU 1387 Team Queue(优先队列)
- HDU - problem 1387 Team Queue【队列】
- HDU 1387 Team Queue (嵌套队列)
- HDU 1387 Team Queue (队列模拟)
- HDU 1387 && UVa 540 Team Queue(队列应用)
- Queue Team
- Team Queue
- NYOJ 8888 取石子(九)(反尼姆博弈)
- ESP8266交叉编译器xtensa-lx106-elf 在Linux下编译与生成
- 数组、List、ArrayList的区别
- Linux 常用基本命令 which
- selenium2library期望值关键字总结
- hdu 1387 team queue 有问题
- hdu6040 (nth_element函数)
- Mysql中的存储过程
- C语言-基本数据类型
- 2017多校联合1(hdu6033)水Add More Zero
- 万能头文件#include <bits/stdc++.h>
- 项目一:绘制地图
- linux命令相关
- 判断当前应用是否启动/是否在前台