日韩性视频-久久久蜜桃-www中文字幕-在线中文字幕av-亚洲欧美一区二区三区四区-撸久久-香蕉视频一区-久久无码精品丰满人妻-国产高潮av-激情福利社-日韩av网址大全-国产精品久久999-日本五十路在线-性欧美在线-久久99精品波多结衣一区-男女午夜免费视频-黑人极品ⅴideos精品欧美棵-人人妻人人澡人人爽精品欧美一区-日韩一区在线看-欧美a级在线免费观看

歡迎訪問 生活随笔!

生活随笔

當前位置: 首頁 > 编程资源 > 编程问答 >内容正文

编程问答

【HDU - 1702 】ACboy needs your help again! (栈和队列,水题模拟)

發布時間:2023/12/10 编程问答 27 豆豆
生活随笔 收集整理的這篇文章主要介紹了 【HDU - 1702 】ACboy needs your help again! (栈和队列,水题模拟) 小編覺得挺不錯的,現在分享給大家,幫大家做個參考.

題干:

ACboy was kidnapped!!?
he miss his mother very much and is very scare now.You can't image how dark the room he was put into is, so poor :(.?
As a smart ACMer, you want to get ACboy out of the monster's labyrinth.But when you arrive at the gate of the maze, the monste say :" I have heard that you are very clever, but if can't solve my problems, you will die with ACboy."?
The problems of the monster is shown on the wall:?
Each problem's first line is a integer N(the number of commands), and a word "FIFO" or "FILO".(you are very happy because you know "FIFO" stands for "First In First Out", and "FILO" means "First In Last Out").?
and the following N lines, each line is "IN M" or "OUT", (M represent a integer).?
and the answer of a problem is a passowrd of a door, so if you want to rescue ACboy, answer the problem carefully!

Input

The input contains multiple test cases.?
The first line has one integer,represent the number oftest cases.?
And the input of each subproblem are described above.

Output

For each command "OUT", you should output a integer depend on the word is "FIFO" or "FILO", or a word "None" if you don't have any integer.

Sample Input

4 4 FIFO IN 1 IN 2 OUT OUT 4 FILO IN 1 IN 2 OUT OUT 5 FIFO IN 1 IN 2 OUT OUT OUT 5 FILO IN 1 IN 2 OUT IN 3 OUT

Sample Output

1 2 2 1 1 2 None 2 3

解題報告:

? ? ? ?按照題意模擬棧和隊列就可以了。

AC代碼:

#include<bits/stdc++.h>using namespace std;int main() {int t,tmp;cin>>t;char op[15];while(t--) {int m;scanf("%d",&m);scanf("%s",op);if(!strcmp(op,"FIFO")) {queue<int > q;while(m--) {scanf("%s",op);if(op[0] == 'I') {scanf("%d",&tmp);q.push(tmp);}else {if(q.empty()) printf("None\n");else {printf("%d\n",q.front());q.pop();}}}}else {stack<int > sk;while(m--) {scanf("%s",op);if(op[0] == 'I') {scanf("%d",&tmp);sk.push(tmp);}else {if(sk.empty()) printf("None\n");else {printf("%d\n",sk.top());sk.pop();}}}}}return 0 ; }

?

總結

以上是生活随笔為你收集整理的【HDU - 1702 】ACboy needs your help again! (栈和队列,水题模拟)的全部內容,希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯,歡迎將生活随笔推薦給好友。