BOJ_algorithm/10866.cpp at master · WHO-A-U/BOJ_algorithm · GitHub

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
#include<deque>
#include<iostream>
#include<cstring>
#include<queue>
using namespace std;
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin>>n;
    deque<int> d;
    while(n--){
        string s;
        int x;
        cin>>s;
        if(s=="push_back"){
            cin>>x;
            d.push_back(x);
        }
        if(s=="push_front"){
            cin>>x;
            d.push_front(x);
        }

        if(s=="pop_front"){
            if(d.empty()){
                cout<<"-1\n";
                continue;
            }
            cout<<d.front()<<"\n";
            d.pop_front();
        }
        if(s=="pop_back"){
            if(d.empty()){
                cout<<"-1\n";
                continue;
            }
            cout<<d.back()<<"\n";
            d.pop_back();
        }

        if(s=="front"){
            if(d.empty()){
                cout<<"-1\n";
                continue;
            }
            cout<<d.front()<<"\n";
        }
        if(s=="back"){
            if(d.empty()){
                cout<<"-1\n";
                continue;
            }
            cout<<d.back()<<"\n";

        }
        if(s=="size"){
            cout<<d.size()<<"\n";
        }
        if(s=="empty"){
            cout<<d.empty()<<"\n";

        }
    }
}