oj.uz

Submission #69966

# Submission time Handle Problem Language Result Execution time Memory
69966 2018-08-22T07:10:51 Z 3zp parentrises (BOI18_parentrises) C++14
50 / 100
 213 ms 13352 KB 
#include<bits/stdc++.h>
using namespace std;
int f[2000009];
main(){
    int P;
    cin >> P;
    if(P == 1){
        int t;
        cin >> t;

        while(t--){
            string s, ans = "";
            cin >> s;
            int a = 0, b = 0, fl = 0;
            for(int i = 0; i < s.size(); i++){
                if(s[i] == '(') a++;
                else b++;
            }
            if(a > 2 * b || b > 2 * a){
                cout << "impossible"<<endl;
                continue;
            }
            if(a > b){
                fl = 1;
                swap(a, b);
                reverse(s.begin(), s.end());
                for(int i = 0; i < s.size(); i++)
                    if(s[i] == '(') s[i] = ')';
                else s[i] = '(';
            }
            int k =  b - a;
            vector<int> X, Y;
            for(int i = 0; i < s.size(); i++){
                f[i] = 0;
                if(s[i] == '(') X.push_back(i);

            else Y.push_back(i);
            }
            for(int i = 0; i < k; i++)
                f[X[i]] = 1;
            int x = k, y = Y.size()-1;
            int A = 0, B = 0;
            while(x < X.size() && y >= 0 && X[x] < Y[y])
                f[X[x]] = 1, f[Y[y]] = 1, x++, y--;
            for(int i = 0; i < s.size(); i++){
                if(s[i] == '('){

                    if(f[i]) A++,B++,ans+='G';
                    else if(A < B) A++,ans+='R';
                    else B++, ans += 'B';
                }
                else{
                    if(f[i]) A--,B--, ans+='G';
                    else {if(A > B) A--, ans+='R';
                    else B--,ans+='B';
                    }
                }
                if(A < 0 ||  B < 0) fl = 2;
            }
            if(fl == 2) cout <<"impossible"<<endl;
            else {if (fl) reverse(ans.begin(), ans.end());
            cout<<ans<<endl;}
        }
    }
}

Compilation message

parentrises.cpp:4:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(){
      ^
parentrises.cpp: In function 'int main()':
parentrises.cpp:15:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int i = 0; i < s.size(); i++){
                            ~~^~~~~~~~~~
parentrises.cpp:27:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for(int i = 0; i < s.size(); i++)
                                ~~^~~~~~~~~~
parentrises.cpp:33:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int i = 0; i < s.size(); i++){
                            ~~^~~~~~~~~~
parentrises.cpp:43:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             while(x < X.size() && y >= 0 && X[x] < Y[y])
                   ~~^~~~~~~~~~
parentrises.cpp:45:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int i = 0; i < s.size(); i++){
                            ~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 500 KB Output is correct
2 Correct 2 ms 524 KB Output is correct
3 Correct 2 ms 676 KB Output is correct
4 Correct 2 ms 676 KB Output is correct
5 Correct 2 ms 676 KB Output is correct

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 500 KB Output is correct
2 Correct 2 ms 524 KB Output is correct
3 Correct 2 ms 676 KB Output is correct
4 Correct 2 ms 676 KB Output is correct
5 Correct 2 ms 676 KB Output is correct
6 Correct 2 ms 676 KB Output is correct
7 Correct 2 ms 676 KB Output is correct
8 Correct 3 ms 676 KB Output is correct
9 Correct 3 ms 676 KB Output is correct
10 Correct 3 ms 748 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 500 KB Output is correct
2 Correct 2 ms 524 KB Output is correct
3 Correct 2 ms 676 KB Output is correct
4 Correct 2 ms 676 KB Output is correct
5 Correct 2 ms 676 KB Output is correct
6 Correct 2 ms 676 KB Output is correct
7 Correct 2 ms 676 KB Output is correct
8 Correct 3 ms 676 KB Output is correct
9 Correct 3 ms 676 KB Output is correct
10 Correct 3 ms 748 KB Output is correct
11 Correct 4 ms 748 KB Output is correct
12 Correct 3 ms 764 KB Output is correct
13 Correct 3 ms 764 KB Output is correct
14 Correct 2 ms 764 KB Output is correct
15 Correct 3 ms 780 KB Output is correct
16 Correct 26 ms 780 KB Output is correct
17 Correct 11 ms 1812 KB Output is correct
18 Correct 9 ms 1812 KB Output is correct
19 Correct 9 ms 1812 KB Output is correct
20 Correct 10 ms 1832 KB Output is correct
21 Correct 213 ms 1832 KB Output is correct
22 Correct 86 ms 13352 KB Output is correct
23 Correct 74 ms 13352 KB Output is correct
24 Correct 77 ms 13352 KB Output is correct
25 Correct 107 ms 13352 KB Output is correct

Subtask #5
0 / 6.0

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

Subtask #6
0 / 16.0

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

Subtask #7
0 / 28.0

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