oj.uz

Submission #64448

# Submission time Handle Problem Language Result Execution time Memory
64448 2018-08-04T13:43:57 Z Bodo171 parentrises (BOI18_parentrises) C++14
56 / 100
 186 ms 5676 KB 
#include <iostream>
#include <fstream>
using namespace std;
const int nmax=1000005;
string s;
char ans[nmax];
int st1[nmax],st2[nmax];
int tip,cnt,u,t,i,u1,u2,p1;
int answ[]={0,0,1,2,2,6,12,18,43,86,148,326,652,1194,2531,5062,9578,19884,39768,76680,157236,314472,613440,1248198,2496396,4906266};
int main()
{
    //freopen("data.in","r",stdin);
    cin>>tip;
    if(tip==1)
    {
        cin>>t;
        for(int cnt=1;cnt<=t;cnt++)
        {
            cin>>s;u1=u2=0;

            bool ok=1;
            for(i=0;i<s.size();i++)
            {
                if(s[i]=='(')
                {
                    st1[++u1]=i;
                    st2[++u2]=i;
                }
                else
                {
                    if(u1)
                    {
                        ans[st1[u1]]='R';
                        u1--;
                        ans[i]='R';
                    }
                    else
                    {
                        if(u2)
                        {
                            ans[st2[u2]]='G';
                            u2--;
                            ans[i]='B';
                        }
                        else ok=0;
                    }
                }
            }
            p1=1;
            for(i=0;i<s.size();i++)
                if(s[i]==')')
            {
                  if(p1<=u1&&st1[p1]<=i)
                  {
                       ans[st1[p1]]='B';
                       p1++;
                       ans[i]='G';
                  }
            }
            for(i=0;i<s.size();i++)
                if(!ans[i])
                  ok=0;
            if(p1<=u1||(!ok))
            {
                for(i=0;i<s.size();i++)
                 ans[i]=0;
                cout<<"impossible\n";
                continue;
            }
            cout<<ans<<'\n';
            for(i=0;i<s.size();i++)
              ans[i]=0;
        }
    }
    else
    {
        cin>>t;
        int x;
        for(i=1;i<=t;i++)
        {
            cin>>x;
            cout<<answ[x]<<'\n';
        }
    }
    return 0;
}

Compilation message

parentrises.cpp: In function 'int main()':
parentrises.cpp:22:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(i=0;i<s.size();i++)
                     ~^~~~~~~~~
parentrises.cpp:50:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(i=0;i<s.size();i++)
                     ~^~~~~~~~~
parentrises.cpp:60:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(i=0;i<s.size();i++)
                     ~^~~~~~~~~
parentrises.cpp:65:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for(i=0;i<s.size();i++)
                         ~^~~~~~~~~
parentrises.cpp:71:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(i=0;i<s.size();i++)
                     ~^~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 3 ms 472 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 3 ms 496 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 572 KB Output is correct
2 Correct 2 ms 572 KB Output is correct
3 Correct 3 ms 572 KB Output is correct
4 Correct 2 ms 572 KB Output is correct
5 Correct 3 ms 692 KB Output is correct

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 572 KB Output is correct
2 Correct 2 ms 572 KB Output is correct
3 Correct 3 ms 572 KB Output is correct
4 Correct 2 ms 572 KB Output is correct
5 Correct 3 ms 692 KB Output is correct
6 Correct 3 ms 692 KB Output is correct
7 Correct 2 ms 692 KB Output is correct
8 Correct 2 ms 692 KB Output is correct
9 Correct 2 ms 692 KB Output is correct
10 Correct 3 ms 692 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 572 KB Output is correct
2 Correct 2 ms 572 KB Output is correct
3 Correct 3 ms 572 KB Output is correct
4 Correct 2 ms 572 KB Output is correct
5 Correct 3 ms 692 KB Output is correct
6 Correct 3 ms 692 KB Output is correct
7 Correct 2 ms 692 KB Output is correct
8 Correct 2 ms 692 KB Output is correct
9 Correct 2 ms 692 KB Output is correct
10 Correct 3 ms 692 KB Output is correct
11 Correct 3 ms 692 KB Output is correct
12 Correct 3 ms 692 KB Output is correct
13 Correct 4 ms 692 KB Output is correct
14 Correct 4 ms 692 KB Output is correct
15 Correct 4 ms 692 KB Output is correct
16 Correct 26 ms 692 KB Output is correct
17 Correct 9 ms 1180 KB Output is correct
18 Correct 12 ms 1180 KB Output is correct
19 Correct 10 ms 1180 KB Output is correct
20 Correct 8 ms 1200 KB Output is correct
21 Correct 186 ms 1452 KB Output is correct
22 Correct 62 ms 5660 KB Output is correct
23 Correct 60 ms 5660 KB Output is correct
24 Correct 56 ms 5660 KB Output is correct
25 Correct 61 ms 5676 KB Output is correct

Subtask #5
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5676 KB Output is correct

Subtask #6
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5676 KB Output is correct
2 Incorrect 4 ms 5676 KB Output isn't correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5676 KB Output is correct
2 Incorrect 4 ms 5676 KB Output isn't correct