| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1229852 | Muhammad_Aneeq | parentrises (BOI18_parentrises) | C++20 | 0 ms | 328 KiB |
#include <iostream>
#include <vector>
using namespace std;
inline void solve()
{
string s;
cin>>s;
int n=s.size();
vector<int>l,r;
string ans(n,'G');
for (int i=0;i<n;i++)
{
if (s[i]=='(')
l.push_back(i);
else
r.push_back(i);
if (r.size()>l.size())
{
if (l.size()==0)
{
cout<<"impossible\n";return;
}
l.pop_back();
ans[r.back()]='B';
r.pop_back();
ans[r.back()]='R';
r.pop_back();
}
}
while (l.size()>r.size())
{
if (r.size()==0)
{
cout<<"impossible\n";return;
}
r.pop_back();
ans[l.back()]='B';
l.pop_back();
ans[l.back()]='R';
l.pop_back();
}
cout<<ans<<endl;
}
int main()
{
int sb;
cin>>sb;
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int t=1;
cin>>t;
for (int i=1;i<=t;i++)
{
solve();
}
}| # | 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... | ||||
