[백준]5430-AC(설명X)

#include <iostream>
#include <queue>
using namespace std;
 
int main()
{
    int T;
    cin >> T;
    for (size_t i = 0; i < T; i++) {
        string command, element;
        int n;
        cin >> command >> n >> element;
        string tmp;
        deque<string> deq;
        for (size_t j = 0; j < element.size(); j++) {
            if (element[j] == '[');
            else if (element[j] == ',' || element[j] == ']') {
                if (tmp.size() > 0)
                    deq.push_back(tmp);
                tmp.clear();
            }
            else {
                tmp.append(1, element[j]);
            }
        }
        bool order = true, error = false;
        for (size_t j = 0; j < command.size(); j++) {
            if (command[j] == 'R')
                order = !order;
            else {
                if (deq.size() == 0) {
                    error = true;
                    break;
                }
                else if (order)
                    deq.pop_front();
                else
                    deq.pop_back();
            }
        }
        if (error)
            cout << "error" << endl;
        else {
            cout << '[';
            while (deq.size() > 0) {
                if (order) {
                    cout << deq.front();
                    deq.pop_front();
                    if (deq.size() > 0)
                        cout << ',';
                }
                else {
                    cout << deq.back();
                    deq.pop_back();
                    if (deq.size() > 0)
                        cout << ',';
                }
            }
            cout << ']' << endl;
        }
    }
    return 0;
}