|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 |
#include <iostream> #include <algorithm> #include <queue> #include <vector> #include <cstdlib> #include <cstdio> #include <string> #include <cstring> #include <ctime> #include <iomanip> #include <cmath> #include <set> #include <map> #include <stack> using namespace std; int main(){ int casecnt; cin >> casecnt; while (casecnt--) { int cnt; string type; cin >> cnt >> type; if (type == "FIFO") { //queue resolutions queue<int> q; while (cnt--) { string cmd; int arg; cin >> cmd; if (cmd == "IN") { cin >> arg; q.push(arg); }else{ if (q.size() == 0) { cout << "None" << endl; continue; } cout << q.front() << endl; q.pop(); } } }else{ //stack resolutions stack<int> s; while (cnt--) { string cmd; int arg; cin >> cmd; if (cmd == "IN") { cin >> arg; s.push(arg); }else{ if (s.size() == 0) { cout << "None" << endl; continue; } cout << s.top() << endl; s.pop(); } } } } return 0; } |
STL小练习
其实手写应该会很带感
