Submission #27959124

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++(i))
#define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++(i))
#define REP_R(i, n) for (int i = (int)(n)-1; (i) >= 0; --(i))
#define REP3R(i, m, n) for (int i = (int)(n)-1; (i) >= (int)(m); --(i))
#define ALL(x) ::std::begin(x), ::std::end(x)
using namespace std;

vector<string> solve(int Q, const std::vector<std::string> &S)
{
    vector<string> ans;
    stack<string> s;
    REP(i,Q){
        if(S[i]=="READ"){
            ans.push_back(s.top());
            s.pop();
        }else{
            s.push(S[i]);
        }
    }
    return ans;
}

// generated by oj-template v4.8.1 (https://github.com/online-judge-tools/template-generator)
int main()
{
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int Q;
    std::cin >> Q;
    std::vector<std::string> S(Q);
    REP(i, Q) { std::cin >> S[i]; }
    auto ans = solve(Q, S);
    REP(i, ans.size())
    std::cout << ans[i] << '\n';
    return 0;
}

Submission Info

Judge Result