[백준]10866-덱(설명X)

#include <iostream>
#include <queue>
using namespace std;
 
int main() {
    int command;
    cin >> command;
    deque<int> que;
    for (size_t i = 0; i < command; i++) {
        string str;
        cin >> str;
        if (!str.compare("pop_front")) {
            int size = que.size();
            if (size > 0) {
                cout << que.front() << endl;
                que.pop_front();
            }
            else
                cout << -1 << endl;
        }
        else if (!str.compare("pop_back")) {
            int size = que.size();
            if (size > 0) {
                cout << que.back() << endl;
                que.pop_back();
            }
            else
                cout << -1 << endl;
        }
        else if (!str.compare("size")) {
            cout << que.size() << endl;
        }
        else if (!str.compare("empty")) {
            if (que.empty())
                cout << 1 << endl;
            else
                cout << 0 << endl;
        }
        else if (!str.compare("front")) {
            int size = que.size();
            if (size > 0)
                cout << que.front() << endl;
            else
                cout << -1 << endl;
        }
        else if (!str.compare("back")) {
            int size = que.size();
            if (size > 0)
                cout << que.back() << endl;
            else
                cout << -1 << endl;
        }
        else if (!str.compare("push_front")) {
            int num;
            cin >> num;
            que.push_front(num);
        }
        else if (!str.compare("push_back")) {
            int num;
            cin >> num;
            que.push_back(num);
        }
    }
    return 0;
}