-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathAC.cpp
112 lines (88 loc) · 2.07 KB
/
AC.cpp
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
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
#include <cmath>
#include <iostream>
#include <vector>
#include <algorithm>
#include <bitset>
#include <unordered_map>
#include <regex>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <deque>
#include <sstream>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0);
cout.tie(NULL);
int t;
cin >> t;
int n;
string str;
string result;
string command;
for (int i = 0; i < t; i++) {
cin >> command;
cin >> n;
cin >> str;
deque<int> res;
string temp = "";
for (int i = 0, lens = str.size(); i < lens; i++)
{
if (isdigit(str[i]))
temp += str[i];
else
{
if (!temp.empty())
res.push_back(stoi(temp));
temp = "";
}
}
bool err=false;
int rev_num = 0;
for (auto& i : command)
{
if (i == 'R')
rev_num++;
else if (i == 'D')
{
if (res.empty())
{
err = true;
break;
}
else
{
if (rev_num % 2 == 0)
res.pop_front();
else
res.pop_back();
}
}
}
if(err)
cout<<"error\n";
else if (res.empty())
cout << "[]\n";
else if (rev_num % 2 != 0) // reverse
{
cout << '[';
int len = res.size();
for (int i = len - 1; i > 0; i--)
{
cout << res[i] << ',';
}
cout << res.front() << "]\n";
}
else if (rev_num % 2 == 0) {
cout << '[';
int len = res.size();
for (int i = 0; i < len - 1; i++)
{
cout << res[i] << ',';
}
cout << res.back() << "]\n";
}
}
}