oj.uz

Submission #74116

# Submission time Handle Problem Language Result Execution time Memory
74116 2018-08-30T06:36:48 Z jiajunlee parentrises (BOI18_parentrises) C++11
0 / 100
 3 ms 1276 KB 
#include <iostream>
#include <cstring>
#include <stack>
#include <deque>

using namespace std;


typedef long long LL;

const LL MAXN = 1000 * 1005; 
const LL MOD = (1000 * 1000 * 1000) + 7;

LL type, t;
LL SIZE;
string input, nono = {"impossible"};

int main(void)
{
  cin >> type >> t;
  if(type == 1)
  {
    string temp;
    getline(cin, temp);
    for(LL i0 = 0; i0 < t; i0++)
    {
      getline(cin, input);
      //cout << input << endl;
      SIZE = input.size();
      deque<pair<char, LL> > parent = {};
      char ans[MAXN] = {};
      bool GG = false;
      for(LL idx = 0; idx < SIZE; idx++)
      {
        if(!parent.empty() && parent.back().first == '(' && input[idx] == ')')
        {
          ans[parent.back().second] = 'G';
          ans[idx] = 'G';
          parent.pop_back();
        }else parent.push_back(make_pair(input[idx], idx));
      }
      //cout << "normal" << endl;
      LL i, j;
      if(!parent.empty() )
      {
        i = parent.back().second-1;
        j = parent.front().second+1;
      }
      while(!parent.empty() )
      {
        if(GG)break;
        if(parent.back().first == '(')
        {
          if(SIZE <= j)
          {
            GG = true;
            break;
          }
          while(j < SIZE)
          {
            if(input[j] == '(' && ans[j] == 'G')
            {
              ans[j] = 'R';
              ans[parent.back().second] = 'B';
              parent.pop_back();
              j++;
              break;
            }
            j++;
            if(SIZE <= j)
            {
              GG = true;
              break;
            }
          }
        }else
        {
          if(i < 0)
          {
            GG = true;
            break;
          }
          while(0 <= i)
          {
            if(input[i] == ')' && ans[i] == 'G')
            {
              ans[i] = 'R';
              ans[parent.back().second] = 'B';
              parent.pop_back();
              i--;
              break;
            }
            i--;
            if(i < 0)
            {
              GG = true;
              break;
            }
          }
        }
      }
      //cout << "FIN" << endl;
      if(GG || !parent.empty())cout << nono << endl;
      else 
      {
        for(LL idx = 0; idx < SIZE; idx++)
        {
          cout << ans[idx];
        }
        cout << endl;
      }
    }
  }else
  {

  }
  return 0;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 1272 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 1276 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 1276 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 28.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 1276 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 1276 KB Unexpected end of file - int32 expected

Subtask #6
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 1276 KB Unexpected end of file - int32 expected

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 1276 KB Unexpected end of file - int32 expected