oj.uz

Submission #98564

# Submission time Handle Problem Language Result Execution time Memory
98564 2019-02-24T10:45:27 Z tdwn parentrises (BOI18_parentrises) C++17
0 / 100
 3 ms 384 KB 
#include <bits/stdc++.h>
#define ll long long
using namespace std;

string code;
string answ;

void solvea() {
    cin>>code;
    answ = code;
    stack<int>p1, p2;

    for(int i=0;i<code.length();i++) {
        if(code[i] == '(') {
            p1.push(i);
        }
        else {
            if(p1.size() != 0) {
                answ[i] = 'B';
                p2.push(p1.top());
                answ[p1.top()] = 'B';
                p1.pop();
            }
            else if(p2.size() != 0) {
                answ[p2.top()] = 'G';
                answ[i] = 'R';
                p2.pop();
            }
        }
    }


    while(p1.size() > 0) p1.pop();
    while(p2.size() > 0) p2.pop();

    for(int i=code.length()-1;i>=0;i--) {
        if(code[i] == ')' && answ[i] == 'B') {
            p1.push(i);
        }
        else if(code[i] == '(' && answ[i] == '(') {
            if(p1.size() != 0) {
                answ[p1.top()] = 'G';
                answ[i] = 'R';
                p1.pop();
            }
        }
    }

    int sb = 0, sr = 0;
    for(int i=0;i<code.length();i++) {
        if(answ[i] != 'G' && answ[i] != 'B' && answ[i] != 'R') {
            cout<<"Impossible\n";
            return;
        }

        if(code[i] == '(') {
            if(answ[i] == 'B') sb++;
            else if(answ[i] == 'R') sr++;
            else {
                sb++; sr++;
            }
        }
        else {
            if(answ[i] == 'B') sb--;
            else if(answ[i] == 'R') sr--;
            else {
                sb--; sr--;
            }
        }

        if(sb < 0 || sr < 0) {
            cout<<"Impossible\n";
            return;
        }
    }

    if(sb != 0 || sr != 0) {
        cout<<"Impossible\n";
        return;
    }

    cout<<answ<<"\n";
    return;
}

void solveb() {
    cout<<"0\n";
}

int main() {
    int P, T;
    cin>>P;
    cin>>T;

    while(T--) {
        if(P == 1) solvea();
        else solveb();
    }
    return 0;
}

Compilation message

parentrises.cpp: In function 'void solvea()':
parentrises.cpp:13:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<code.length();i++) {
                 ~^~~~~~~~~~~~~~
parentrises.cpp:50:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<code.length();i++) {
                 ~^~~~~~~~~~~~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Incorrect 2 ms 256 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

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

Subtask #3
0 / 6.0

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

Subtask #4
0 / 28.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 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 384 KB Output isn't correct

Subtask #6
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 384 KB Output isn't correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 384 KB Output isn't correct