# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
68313 | aome | parentrises (BOI18_parentrises) | C++17 | 3 ms | 740 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
namespace Task1 {
char color[1000005];
void solve() {
int q; cin >> q;
while (q--) {
string s; cin >> s;
stack<int> st;
stack<int> st2;
stack<int> st3;
bool fail = 0;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == '(') st.push(i), color[i] = 'G';
else {
if (st.size()) {
st2.push(i), color[i] = 'G', st3.push(st.top()), st.pop();
}
else {
if (!st2.size()) { fail = 1; break; }
color[i] = 'R', color[st2.top()] = 'B', st2.pop(), st3.pop();
}
}
}
while (st.size() && st3.size()) {
color[st.top()] = 'R', color[st3.top()] = 'B';
st.pop(), st3.pop();
}
fail |= st.size() != 0;
if (fail) cout << "impossible\n";
else {
for (int i = 0; i < s.size(); ++i) cout << color[i]; cout << '\n';
}
}
}
}
namespace Task2 {
void solve() {
}
}
int main() {
ios::sync_with_stdio(false);
int P; cin >> P;
if (P == 1) Task1::solve();
else Task2::solve();
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |