A - ACboy needs your help again!
阿新 • • 發佈：2018-01-28
ear inpu his lin 技術 art clu acm main
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!
Problem Description
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!
InputThe 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.OutputFor 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
題目大意：
FIFO指先輸入先輸出
FILO指先輸入後輸出
解題思路：
FIFO用棧
FILO用隊列
註意：
特殊情況：元素為空
第一次寫，所以代碼很亂，沒整理，你可能看不懂，以後盡量整理好代碼。
#include <iostream> #include <string> #include <stack> #include <queue> using namespace std; int main() { int number, i, k; int number2; int x; int arr[20]; int t = 0; int j; string a, b; cin >> number; for(i = 0; i < number; i++) { cin >> number2; cin >> a; if(a == "FILO") { stack <int> st; for(k = 0; k < number2; k++) { cin >> b; if(b == "IN") { cin >> x; st.push(x); } else { if(st.size()!=0) { arr[t] = st.top(); t++; st.pop(); } else { arr[t] = -100; t++; } } } } else { for(k = 0; k < number2; k++) { queue <int> sc; for(k = 0; k < number2; k++) { cin >> b; if(b == "IN") { cin >> x; sc.push(x); } else { if(sc.size()!=0) { arr[t] = sc.front(); t++; sc.pop(); } else { arr[t] = -100; t++; } } } } } } for(j = 0; j < t; j++) if(arr[j]==-100) { cout << "None" << endl; } else cout << arr[j] << endl; return 0; }
A - ACboy needs your help again!