BOJ 28279 덱 2

1 개요

BOJ 28279 덱 2

• 백준 온라인 저지 28279번 문제
• BOJ 16단계

2 C++

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
    int N, command, temp;
    cin >> N;
    deque<int> q;
    for(int i=0; i<N; i++) {
        cin >> command;
        switch(command) {
            case 1:
                cin >> temp;
                q.push_front(temp);
                break;
            case 2:
                cin >> temp;
                q.push_back(temp);
                break;
            case 3:
                if(q.empty()) { cout << "-1\n"; continue; }
                cout << q.front() << "\n";
                q.pop_front();
                break;
            case 4:
                if(q.empty()) { cout << "-1\n"; continue; }
                cout << q.back() << "\n";
                q.pop_back();
                break;
            case 5:
                cout << q.size() << "\n";
                break;
            case 6:
                cout << q.empty() << "\n";
                break;
            case 7:
                if(q.empty()) { cout << "-1\n"; continue; }
                cout << q.front() << "\n";
                break;
            case 8:
                if(q.empty()) { cout << "-1\n"; continue; }
                cout << q.back() << "\n";
                break;
        }
    }
}